Fibonnaci Sequence in Python
Implement a Fibonnaci Sequence in three different ways:
Recursively
Dynamically (Using Memoization to store results)
Iteratively
String Permutation in Python
Given a string, write a function that uses recursion to output a list of all the possible permutations of that string.
Reverse a String in Python
This interview question requires you to reverse a string using recursion. Make sure to think of the base case here.
Introduction to Recursion
The first is when recursion is used as a technique in which a function makes one or more calls to itself. The second is when a data structure uses smaller instances of the exact same type of data structure when it represents itself. Both of these instances are use cases of recursion.
Implement a Queue Using Two Stacks in Python
Given the Stack class below, implement a Queue class using two stacks
Balanced Parentheses Check in Python
Given a string of opening and closing parentheses, check whether it’s balanced. We have 3 types of parentheses: round brackets: (), square brackets: [], and curly brackets: {}.
Unique Characters in String using Python
Given a string,determine if it is compressed of all unique characters. For example, the string 'abcde' has all unique characters and should return True.
String Compression in Python
Given a string in the form 'AAAABBBBCCCCCDDEEEE' compress it to become 'A4B4C5D2E4'. For this problem, you can falsely "compress" strings of single or double letters.
Largest Continuous Sum in Python
Given an array of integers (positive and negative) find the largest continuous sum.
Find the Missing Element in Python
Consider an array of non-negative integers. A second array is formed by shuffling the elements of the first array and deleting a random element. Given these two arrays, find which element is missing in the second array.