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.
Array Pair Sum in Python
Given an integer array, output all the unique pairs that sum up to a specific value k.
Sentence or String Reversal in Python
Given a string of words, reverse all the words. For example:
Big-O Complexity for Python Data Structures
Big-O Complexity for Python Data Structures
Algorithm Big-O Notation Examples
Big-O (in its simplest form) reduces the comparison between algorithms to a single variable. That variable is chosen based on observations or assumptions