Implementation of Insertion Sort in Python
Insertion Sort builds the final sorted array (or list) one item at a time.
Implementation of a Bubble Sort in Python
The bubble sort makes multiple passes through a list. It compares adjacent items and exchanges those that are out of order. Each pass through the list places the next largest value in its proper place. In essence, each item “bubbles” up to the location where it belongs.
Implementation of Binary Search in Python
Binary Search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the middle element of the array.
Coin Change Problem in Python
Given a target amount n and a list (array) of distinct coin values, what’s the fewest coins needed to make the change amount.
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.
November 7, 2020 | Algorithm, Data Structure, python | No comments
Implement a Queue Using Two Stacks in Python
Given the Stack class below, implement a Queue class using two stacks
October 21, 2020 | Data Structure, python | No comments
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: {}.
October 12, 2020 | Algorithm, Data Structure, python | No comments
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.