Keep Coding Keep Cheering!
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.
Given a target amount n and a list (array) of distinct coin values, what’s the fewest coins needed to make the change amount.
Implement a Fibonnaci Sequence in three different ways:
Recursively
Dynamically (Using Memoization to store results)
Iteratively
Given a string, write a function that uses recursion to output a list of all the possible permutations of that string.
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
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.
November 2, 2020 | Algorithm | No comments
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
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.
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.
Given an array of integers (positive and negative) find the largest continuous sum.
October 2, 2020 | Algorithm, Data Structure, python | No comments