This resource to help Freshmen and Sophomores quickly brush through the common interview problems and different solutions in python. We have included the runtime and space complexity. In case you run into any interesting intermediate and beginner level problems feel free to contribute
Check out the website with the run time of python in built functions here
If you have an alternative solution to any of the above questions, kindly follow the Standards of contribution to add your work.
If there is a mistake in the analysis of the Space or Time Complexity, kindly contact Kelvin Forson Incoming Google STEP intern , Linus Okoth Incoming Facebook SWE intern, Philip Boakye Incoming Microsoft Explore Intern or Paul Opiyo Incoming Goldman Sachs Summer Analyst
Enjoy Learning and Goodluck!
- Email Kelvin Forson , Linus Okoth , Philip Boakye or Paul Opiyo your GitHub username to be added as a contributor.
- After your request have been approved, upload files using the
Upload Filesbutton on the GitHub repository homepage. - Add your username to the GitHub commit message when uploading to attribute credit to the contributor.
- Follow the style of the previously uploaded Jupyter Notebooks files.
- Follow this link Guide to contribute on GitHub
- Kindly follow the format of the previously uploaded Jupyter Notebooks files.
- Reversing a String
- Checking if a string a substring of another string
- Checking if there is a Duplicate letter in a string
- Finding The Next Smallest Prime Number
- Finding the sum of multiples of 3 and 5 below number
- Finding Sum Of Even Number Fibonacci Numbers Before N
- Determine Whether Input Is A Happy Number
- Checking if two strings are anagrams
- Counting the prime numbers less than a given number
- Find the index of the first value in a fibonacci series with the given number of digits.
- Finding the nth value in a fibonacci series given its index
- Converts a roman numeral to its equivalent integer
- Finds the indices of two numbers in an array that adds up to a target number
- Find A Pair With the Given Sum
- Kth Frequent Number
- Isomorphic Strings
- Find the first missing positive integer in an array
- Rotate an array in the right direction for a given number of steps
- Add one to an array of digits
- Merges together a 2D-array specifying the interval of integers
- Finding the previous fibonacci Number
- Longest Consercutive Subsequence
- Check For Duplicates Within A Range
- String to Integer <--Classic Atoi-->
- Checks is a given sentence is valid
- Finds the index of the first unique character in a string
- Replaces a character in a string with the space character(Brick-break-problem)
- Checks is a given array of strings is an alliteration
- Palindrome Check
- Number and Longest Palindromic Subtstring(s)
- Finds the kth highest occuring numbers in an array
- Checks to see if the letters in one string matches the words in the another string<--Word Pattern-->
- Implements the classic strStr() needle in haystack
- Sort a stock alphabetically
- Convert an integer to its Roman Numerals
- Checks if the number of occurences of list items are the same or not
- Find the n-th ugly number in a sequence
- Finds uncommon words in two sentences
- Moves all the zeros in a list to the end in place
- Computes the pascal triangle based on the number of rows
- Find the longest common prefix in an array of strings
- Determine whether an integer is a palindrome
- Checks if a given string of parentheses is balanced
- Uses the reverse Polish notation to make computations
- Uses recursion to check if a given string is a palindrome
- Uses recursion to flatten a 2D array
- Uses recursion to reverse a given string
- Finds the next smallest number after a number whose digits sum is the same as the input
- Calculates the max height of a given binary tree
- Recursive Implementation of the binary search
- Implementation of the selection sort algorithm
- Implementation of the shell sort algorithm
- Implementation of the insertion sort algorithm