A collection of coding interview problems with my solutions. From various sources including Leet-Code, Interview experiences etc. #100DaysOfCode
- LeetCode (Medium) - Design Tic Tac Toe [link]
- LeetCode (Medium) - Longest substring without repeating characters [link]
- Codility (Hard) - Tree Trip [link]
- LeetCode (Medium) - Add Two Numbers [link]
- LeetCode (Hard) - Median of Two Sorted Arrays [link]
- LeetCode (Medium) - Three Sum [link]
- LeetCode(Medium) - Set Matrix Zeroes [link]
- LeetCode (Medium) - Group Anagrams [link]
- LeetCode (Medium) - Longest Palindromic Substring [link] (Manacher's Algorithm)
- LeetCode (Medium) - Increasing Triplet Subsequence [link]
- LeetCode (Medium) - Missing Ranges [link]
- LeetCode (Easy) - Reverse LinkedList [link]
- LeetCode (Hard) - Reverse LinkedList in k groups [link]
- LeetCode (Easy) - Sqrt [link]
- LeetCode (Easy) - Rectangle Overlap [link]
- LeetCode (Hard) - Interleaving String [link]
- LeetCode (Medium) - Merge Intervals [link]
- LeetCode (Medium) - Generate Parentheses [link]
- LeetCode (Hard) - LRU Cache [link]
- LeetCode (Medium) - Search in Rotated Sorted Array [link]
- LeetCode (Medium) - Rotate Image [link]
- LeetCode (Easy) - Maximum Subarray [link]
- LeetCode (Easy) - Two Sum [link]
- LeetCode (Medium) - Kth Largest Element in an Array [link]
- LeetCode (Medium) - UTF-8 Validation [link]
- LeetCode (Easy) - Count Primes [link]
- LeetCode (Easy) - Climbing Stairs [link]
- LeetCode (Hard) - Maximal Rectangle [link]
- LeetCode (Medium) - Product of Array Except Self [link]
- LeetCode (Easy) - Sum of Two Numbers [link]
- LeetCode (Medium) - Validate Binary Search Tree [link]
- LeetCode (Easy) - Add Strings [link]
- LeetCode (Hard) - Trapping Rain Water [link]
- LeetCode (Medium) - Number of Islands [link]
- LeetCode (Medium) - Reverse Words in a String [link]
- LeetCode (Medium) - Binary Tree Zigzag Level Order Traversal [link]
- LeetCode (Medium) - WordBreak [link]
- LeetCode (Hard) - WordBreak II [link]
- LeetCode (Hard) - Concatenated Words [link]
- LeetCode (Medium) - Partition Equal Subset Sum [link]
- LeetCode (Medium) - Partition to K Equal Sum Subset [link] #TODO
- LeetCode (Easy) - Reverse Bits [link]
- LeetCode (Medium) - Subsets [link]
- LeetCode (Easy) - Single Number [link]
- LeetCode (Medium) - Single Number II [link]
Other Resources: