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!

1. Email Kelvin Forson , Linus Okoth , Philip Boakye or Paul Opiyo your GitHub username to be added as a contributor.
2. After your request have been approved, upload files using the Upload Files button on the GitHub repository homepage.
3. Add your username to the GitHub commit message when uploading to attribute credit to the contributor.
4. Follow the style of the previously uploaded Jupyter Notebooks files.

1. Follow this link Guide to contribute on GitHub
2. Kindly follow the format of the previously uploaded Jupyter Notebooks files.

1. Reversing a String
2. Checking if a string a substring of another string
3. Checking if there is a Duplicate letter in a string
4. Finding The Next Smallest Prime Number
5. Finding the sum of multiples of 3 and 5 below number
6. Finding Sum Of Even Number Fibonacci Numbers Before N
7. Determine Whether Input Is A Happy Number
8. Checking if two strings are anagrams
   
9. Counting the prime numbers less than a given number
   
10. Find the index of the first value in a fibonacci series with the given number of digits.
    
11. Finding the nth value in a fibonacci series given its index
    
12. Converts a roman numeral to its equivalent integer
13. Finds the indices of two numbers in an array that adds up to a target number
14. Find A Pair With the Given Sum
15. Kth Frequent Number
16. Isomorphic Strings
17. Find the first missing positive integer in an array
18. Rotate an array in the right direction for a given number of steps
19. Add one to an array of digits
20. Merges together a 2D-array specifying the interval of integers
21. Finding the previous fibonacci Number
22. Longest Consercutive Subsequence
23. Check For Duplicates Within A Range
24. String to Integer <--Classic Atoi-->
25. Checks is a given sentence is valid
26. Finds the index of the first unique character in a string
27. Replaces a character in a string with the space character(Brick-break-problem)
28. Checks is a given array of strings is an alliteration
29. Palindrome Check
30. Number and Longest Palindromic Subtstring(s)
31. Finds the kth highest occuring numbers in an array
32. Checks to see if the letters in one string matches the words in the another string<--Word Pattern-->
33. Implements the classic strStr() needle in haystack
34. Sort a stock alphabetically
35. Convert an integer to its Roman Numerals
36. Checks if the number of occurences of list items are the same or not
37. Find the n-th ugly number in a sequence
38. Finds uncommon words in two sentences
39. Moves all the zeros in a list to the end in place
40. Computes the pascal triangle based on the number of rows
41. Find the longest common prefix in an array of strings
42. Determine whether an integer is a palindrome
43. Checks if a given string of parentheses is balanced
44. Uses the reverse Polish notation to make computations
45. Uses recursion to check if a given string is a palindrome
46. Uses recursion to flatten a 2D array
47. Uses recursion to reverse a given string
48. Finds the next smallest number after a number whose digits sum is the same as the input
49. Calculates the max height of a given binary tree
50. Recursive Implementation of the binary search
51. Implementation of the selection sort algorithm
52. Implementation of the shell sort algorithm
53. Implementation of the insertion sort algorithm