- Introduction
- Pair with Target Sum (easy) LeetCode
- Remove Duplicates (easy) LeetCode LeetCode LeetCode LeetCode LeetCode
- Squaring a Sorted Array (easy) LeetCode
- Triplet Sum to Zero (medium) LeetCode
- Triplet Sum Close to Target (medium) LeetCode
- Triplets with Smaller Sum (medium) LintCode
- Subarrays with Product Less than a Target (medium) LeetCode
- Dutch National Flag Problem (medium) CoderByte
- Problem Challenge 1: Quadruple Sum to Target (medium) Leetcode
- Problem Challenge 2: Comparing Strings containing Backspaces (medium) Leetcode
- Problem Challenge 3: Minimum Window Sort (medium) Leetcode Ideserve
- Introduction emre.me
- LinkedList Cycle (easy) Leetcode
- Start of LinkedList Cycle (medium) Leetcode
- Happy Number (medium) Leetcode
- Middle of the LinkedList (easy) Leetcode
- Problem Challenge 1: Palindrome LinkedList (medium) Leetcode
- Problem Challenge 2: Rearrange a LinkedList (medium) Leetcode
- Problem Challenge 3: Cycle in a Circular Array (hard) Leetcode
- Introduction
- Maximum Sum Subarray of Size K (easy)
- Smallest Subarray with a given sum (easy) Educative.io
- Longest Substring with K Distinct Characters (medium) Educative.io
- Fruits into Baskets (medium) LeetCode
- No-repeat Substring (hard) LeetCode
- Longest Substring with Same Letters after Replacement (hard) LeetCode
- Longest Subarray with Ones after Replacement (hard) LeetCode
- Problem Challenge 1: Permutation in a String (hard) Leetcode
- Problem Challenge 2: String Anagrams (hard) Leetcode
- Problem Challenge 3: Smallest Window containing Substring (hard) Leetcode
- Problem Challenge 4: Words Concatenation (hard) Leetcode
- Introduction Educative.io
- Merge Intervals (medium) Educative.io
- Insert Interval (medium) Educative.io
- Intervals Intersection (medium) Educative.io
- Conflicting Appointments (medium) Geeksforgeeks
- Problem Challenge 1: Minimum Meeting Rooms (hard) Lintcode
- Problem Challenge 2: Maximum CPU Load (hard) Geeksforgeeks
- Problem Challenge 3: Employee Free Time (hard) CoderTrain
- Introduction emre.me
- Cyclic Sort (easy) Geeksforgeeks
- Find the Missing Number (easy) Leetcode
- Find all Missing Numbers (easy) Leetcode
- Find the Duplicate Number (easy) Leetcode
- Find all Duplicate Numbers (easy) Leetcode
- Problem Challenge 1: Find the Corrupt Pair (easy) TheCodingSimplified
- Problem Challenge 2: Find the Smallest Missing Positive Number (medium) Leetcode
- Problem Challenge 3: Find the First K Missing Positive Numbers (hard) TheCodingSimplified
- Introduction emre.me
- Reverse a LinkedList (easy) Leetcode
- Reverse a Sub-list (medium) Leetcode
- Reverse every K-element Sub-list (medium) Leetcode
- Problem Challenge 1: Reverse alternating K-element Sub-list (medium) Geeksforgeeks
- Problem Challenge 2: Rotate a LinkedList (medium) Leetcode
- Introduction to Stack (Operations, Implementation, Applications)
- Balanced Parentheses
- Reverse a String
- Decimal to Binary Conversion
- Next Greater Element
- Sorting a Stack
- Simplify Path
- Introduction to Monotonic Stack
- Next Greater Element (easy)
- Daily Temperatures (easy)
- Remove Nodes From Linked List (easy)
- Remove All Adjacent Duplicates In String (easy)
- Remove All Adjacent Duplicates in String II (medium)
- Remove K Digits (hard)
- Introduction (Hashing, Hash Tables, Issues)
- First Non-repeating Character (easy)
- Largest Unique Number (easy)
- Maximum Number of Balloons (easy)
- Longest Palindrome(easy)
- Ransom Note (easy)
- Introduction
- Binary Tree Level Order Traversal (easy) Leetcode
- Reverse Level Order Traversal (easy) Leetcode
- Zigzag Traversal (medium) Leetcode
- Level Averages in a Binary Tree (easy) Leetcode
- Minimum Depth of a Binary Tree (easy) Leetcode
- Maximum Depth of a Binary Tree (easy) Leetcode
- Level Order Successor (easy) Geeksforgeeks
- Connect Level Order Siblings (medium) Leetcode
- Problem Challenge 1: Connect All Level Order Siblings (medium) Educative
- Problem Challenge 2: Right View of a Binary Tree (easy) Leetcode
- Introduction
- Binary Tree Path Sum (easy) Leetcode
- All Paths for a Sum (medium) Leetcode
- Sum of Path Numbers (medium) Leetcode
- Path With Given Sequence (medium) Geeksforgeeks
- Count Paths for a Sum (medium) Leetcode
- Problem Challenge 1: Tree Diameter (medium) Leetcode
- Problem Challenge 2: Path with Maximum Sum (hard) Leetcode
- Introduction to Graph (Representations, Abstract Data Type (ADT))
- Graph Traversal: Depth First Search(DFS)
- Graph Traversal: Breadth First Search (BFS)
- Find if Path Exists in Graph(easy
- Number of Provinces (medium)
- Minimum Number of Vertices to Reach All Nodes(medium)
- Introduction to Island Pattern
- Number of Islands (easy)
- Biggest Island (easy)
- Flood Fill (easy)
- Number of Closed Islands (easy)
- Problem Challenge 1 (easy)
- Problem Challenge 2 (medium)
- Problem Challenge 3 (medium)
-
Introduction
-
Find the Median of a Number Stream (medium) Leetcode
-
Sliding Window Median (hard) Leetcode
-
Maximize Capital (hard) Leetcode
-
*Maximum Sum Combinations (medium) InterviewBit
- Introduction Educative.io
- Subsets (easy) Educative.io
- Subsets With Duplicates (easy) Educative.io
- Permutations (medium) Educative.io
- String Permutations by changing case (medium)
- Balanced Parentheses (hard)
- Unique Generalized Abbreviations (hard)
- Introduction Complete Pattern Theory and Solutions
- Order-agnostic Binary Search (easy) Geeksforgeeks
- Ceiling of a Number (medium) Geeksforgeeks-Ceil Geeksforgeeks-Floor
- Next Letter (medium) Leetcode
- Number Range (medium) Leetcode
- Search in a Sorted Infinite Array (medium) Leetcode
- Minimum Difference Element (medium): Find the floor & ceil take the difference, minimum would be the ans
- Bitonic Array Maximum (easy) Geeksforgeeks
- Problem Challenge 1: Search Bitonic Array (medium) Leetcode
- Problem Challenge 2: Search in Rotated Array (medium) Leetcode
- Problem Challenge 3: Rotation Count (medium) Geeksforgeeks
- *Search a 2D Matrix (medium) Leetcode
- *Minimum Number of Days to Make m Bouquets (medium) Leetcode
- *Koko Eating Bananas (medium) Leetcode
- *Capacity To Ship Packages Within D Days (medium) Leetcode
- *Median of Two Sorted Arrays (hard) Leetcode
- Introduction
- Single Number (easy)
- Two Single Numbers (medium)
- Complement of Base 10 Number (medium)
- Problem Challenge 1: Flip and Invert an Image (hard)
-
Top 'K' Numbers (easy) Solution
-
Kth Smallest Number (easy)
-
'K' Closest Points to the Origin (easy) Leetcode
-
Connect Ropes (easy)
-
Top 'K' Frequent Numbers (medium)
-
Frequency Sort (medium)
-
Kth Largest Number in a Stream (medium) Leetcode
-
'K' Closest Numbers (medium)
-
Maximum Distinct Elements (medium)
-
Sum of Elements (medium)
-
Rearrange String (hard)
-
Problem Challenge 1: Rearrange String K Distance Apart (hard)
-
Problem Challenge 2: Scheduling Tasks (hard)
-
Problem Challenge 3: Frequency Stack (hard)
- Introduction
- Merge K Sorted Lists (medium)
- Kth Smallest Number in M Sorted Lists (Medium)
- Kth Smallest Number in a Sorted Matrix (Hard) Educative.io
- Smallest Number Range (Hard)
- Problem Challenge 1: K Pairs with Largest Sums (hard)
- Introduction to Greedy Algorithm
- Valid Palindrome II (easy)
- Maximum Length of Pair Chain (medium)
- Minimum Add to Make Parentheses Valid (medium)
- Remove Duplicate Letters (medium)
- Largest Palindromic Number (Medium)
- Removing Minimum and Maximum From Array (medium)
- Introduction
- 0/1 Knapsack (medium) Geeksforgeeks
- Equal Subset Sum Partition (medium) Leetcode
- Subset Sum (medium) Geeksforgeeks
- Minimum Subset Sum Difference (hard) Geeksforgeeks
- Problem Challenge 1: Count of Subset Sum (hard)
- Problem Challenge 2: Target Sum (hard)
- Introduction to Backtracking Pattern
- Combination Sum (medium)
- Word Search (medium)
- Sudoku Solver (hard)
- Factor Combinations (medium)
- Split a String Into the Max Number of Unique Substrings (medium)
- Introduction to Trie
- Implement Trie (Prefix Tree) (medium)
- Index Pairs of a String (easy)
- Design Add and Search Words Data Structure (medium)
- Extra Characters in a String (medium)
- Search Suggestions System (medium)
- Introduction
- Topological Sort (medium) Youtube
- Tasks Scheduling (medium) Leetcode-Similar
- Tasks Scheduling Order (medium) Leetcode-Similar
- All Tasks Scheduling Orders (hard) Leetcode-Similar
- Alien Dictionary (hard) Leetcode
- Problem Challenge 1: Reconstructing a Sequence (hard) Leetcode
- Problem Challenge 2: Minimum Height Trees (hard) Leetcode
- Introduction to Union Find Pattern
- Redundant Connection (medium)
- Number of Provinces (medium)
- Is Graph Bipartite? (medium)
- Path With Minimum Effort (medium)
- Introduction to Ordered Set Pattern
- Merge Similar Items (easy)
- 132 Pattern (medium)
- My Calendar I (medium)
- Longest Continuous Subarray (medium)
- Introduction to Multi-threaded Pattern
- Same Tree (medium)
- Invert Binary Tree (medium)
- Binary Search Tree Iterator (medium)
- Kth Smallest Number (hard)
Note: Problems marked with
*
are added as per my recommendations.