C Programming Language
C is a general-purpose, procedural, imperative computer programming language developed at AT & T’s Bell Laboratories of USA in 1972.
February 2, 2022 | C | 1 comment
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
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
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.
November 2, 2020 | Algorithm | 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.
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.