⭐ AlgoExpert

Description: This is a collection of my solutions to AlgoExpert Coding Interview questions. There are solutions for each problem statement including time and space complexity along with a unittest starter code.

Levels:

🟩 : Easy
🟦 : Medium
🟥 : Hard

Level	No.	Name
🟩	01	Two Number Sum
🟩	02	Validate Subsequence
🟩	03	Sorted Squared Array
🟩	04	Tournament Winner
🟩	05	Non Constructible Change
🟩	06	Palindrome Check
🟩	07	Caesar Cipher Encryptor
🟩	08	Run Length Encoding
🟩	09	Generate Document
🟩	10	First Non Repeating Character
🟩	11	Remove Duplicates From Linked List
🟩	12	Bubble Sort
🟩	13	Insertion Sort
🟩	14	Selection Sort
🟩	15	Binary Search
🟩	16	Find Three Largest Numbers
🟩	17	Nth Fibonacci
🟩	18	Product Sum
🟩	19	Branch Sums
🟩	20	Node Depths
🟩	21	Find Closest Value In BST
🟩	22	Class Photos
🟩	23	Tandem Bicycle
🟩	24	Minimum Waiting Time
🟩	25	Depth first Search
🟦	26	Three Number Sum
🟦	27	Move Element To End
🟦	28	Smallest Difference
🟦	29	Monotonic Array
🟦	30	Spiral Traverse
🟦	31	Longest Peak
🟦	32	Array Of Products
🟦	33	First Duplicate Value
🟦	34	Longest Palindromic Substring
🟦	35	Group Anagrams
🟦	36	Minimum Characters For Words
🟦	37	Reverse Words In String
🟦	38	Valid IP Addresses
🟦	39	Linked List Construction
🟦	40	Remove Kth Node From End
🟦	41	Sum of Linked Lists
🟦	42	Three Number Sort
🟦	43	Search In Sorted Matrix
🟦	44	Permutations
🟦	45	Powerset
🟦	46	Phone Number Mnemonics
🟦	47	Invert Binary Tree
🟦	48	Binary Tree Diameter
🟦	49	Find Successor
🟦	50	Height Balanced Binary Tree
🟦	51	BST Construction
🟦	52	Kadane's Algorithm
🟦	53	Merge Overlapping Intervals
🟦	54	Next Greater Element
🟦	55	Sort Stack
🟦	56	Validate BST
🟦	57	BST Traversal
🟦	58	Min Height BST
🟦	59	Min Max Stack Construction
🟦	60	Balanced Brackets
🟦	61	Sunset Views
🟦	62	Max Subset Sum No Adjacent
🟦	63	Number Of Ways To Make Change
🟦	64	Min Number Of Coins For Change
🟦	65	Levenshtein Distance
🟦	66	Min Heap Construction
🟦	67	Valid Starting City
🟦	68	Task Assignment
🟦	69	Find Kth Largest Value In BST
🟦	70	Reconstruct BST
🟦	71	Single Cycle Check
🟦	72	Number Of Ways To Traverse Graph
🟦	73	Staircase Traversal
🟦	74	Breadth First Search
🟦	75	River Sizes
🟦	76	Youngest Common Ancestor
🟦	77	Remove Islands
🟦	78	Cycle In Graph
🟦	79	Minimum Passes Of Matrix
🟦	80	Suffix Trie Construction
🟥	81	Largest Range
🟥	82	Quick Sort
🟥	83	Four Number Sum
🟥	84	Subarray Sort
🟥	85	Min Rewards
🟥	86	Zigzag Traverse
🟥	87	Max Path Sum In Binary Tree
🟥	88	Find Nodes Distance K
🟥	89	Heap Sort
🟥	90	Radix Sort
🟥	91	Same BSTs
🟥	92	Validate Three Nodes
🟥	93	Longest Substring Without Duplication
🟥	94	Continuous Median
🟥	95	Dijkstra's Algorithm
🟥	96	Topological Sort
🟥	97	Find Loop
🟥	98	Merge Linked Lists
🟥	99	Reverse Linked List
🟥	100	Max Sum Increasing Subsequence
🟥	101	Shorten Path
🟥	102	Longest Common Subsequence
🟥	103	Min Number Of Jumps
🟥	104	Water Area
🟥	105	Knapsack Problem
🟥	106	Maximize Expression
🟥	107	Sort K-Sorted Array
🟥	108	Shift Linked List
🟥	109	Shifted Binary Search
🟥	110	Search For Range
🟥	111	Quickselect
🟥	112	Index Equals Value
🟥	113	Boggle Board
🟥	114	Underscorify Substring
🟥	115	Pattern Matcher
🟥	116	Solve Sudoku