Longest Consecutive Sequence - Leetcode 128 | Sorting and Hashset

Non-overlapping Intervals - Leetcode 435 | Greedy

Meeting Rooms 2 - Leetcode 253 | Using Sorting and Two Pointers

Insert Interval - Leetcode 57 | Greedy

Merge Intervals - Leetcode 56 | by Sorting

Meeting Rooms - Leetcode 252

Find Median from Data Stream - Leetcode 295 | Two Heaps

Top K Frequent Elements - Leetcode 347 | 4 Approaches including Min Heap and Bucket Sort

Word Search II - Leetcode 212

Design Add and Search Words Data Structure - Leetcode 211 | Using Trie

Implement Trie - Leetcode 208

Serialize and Deserialize Binary Tree - Leetcode 297 | Using Preorder Traversal

Binary Tree Maximum Path Sum - Leetcode 124 | From naive to optimal DFS

Kth Smallest Element in a BST - Leetcode 230 | 3 Inorder Traversal Approaches

Construct Binary Tree from Inorder and Preorder Traversal - Leetcode 105 - From O(n^2) to O(n)

Validate Binary Search Tree - Leetcode 98 | The Wrong, the Bad and the Optimal DFS

Subtree of Another Tree - Leetcode 572 | Using Same Tree and Tree Serialization

Maximum Depth of Binary Tree - Leetcode 104 | Recursive and Iterative DFS, BFS

Same Tree - Leetcode 100 | Recursive DFS

Encode and Decode Strings - Leetcode 271 | Using Length Prefixing

Minimum Window Substring - Leetcode 76 | Sliding Window

Palindromic Substrings - Leetcode 647 | Expand Around Center

Longest Repeating Character Replacement - Leetcode 424 | Sliding Window

Group Anagrams - Leetcode 49 | Two Approaches - Sorting and Frequency Array

Rotate Image - Leetcode 48 | 3 Approaches Explained

Longest Substring Without Repeating Characters - Leetcode 3 | Sliding Window

Longest Palindromic Substring - Leetcode 5 | From naive to expanding two pointers

Leetcode 125 - Valid Palindrome | Preprocessing and Two-Pointer Approach (Without Built-Ins)

Word Search 1 - Leetcode 79 | Backtracking

Set Matrix Zeros - Leetcode 73 | 4 Intuitive approaches following matrix iteration

Spiral Matrix II - Leetcode 59 | Using 4 boundaries

Spiral Matrix - Leetcode 54 | Check the boundary conditions

Reorder List - Leetcode 143 | Using two pointers

Middle of the linked list - Leetcode 876 | From 2 Pass to 1 Pass using 2 Pointers

Merge K Sorted Lists - Leetcode 23 | Naive, Merge sort and Minheap

Remove Nth Node From End of List - Leetcode 19 | Using 2 pointers

Reverse Linked List - Leetcode 206 | Iterative & Recursive Approaches

House Robber II - Leetcode 213 | Using Dynamic Programming solution from House Robber 1

House Robber - Leetcode 198 | From Naive to space efficient DP

Word Break - Leetcode 139 | Using Dynamic Programming

Longest Increasing Subsequence - Leetcode 300 | Using Binary Search

Longest Increasing Subsequence - Leetcode 300 | Using Dynamic Programming

Coin Change - Leetcode 322 | Using Dynamic Programming

Decode Ways - Leetcode 91 | From Naive to Dynamic Programming

Unique Paths in Grid - Leetcode 62 | 5 Approaches including DP and Combinatorics

Jump Game - Leetcode 55 | Using DP and Greedy Approach

Combination Sum 1 - Leetcode 39 | Using Backtracking

Climbing Stairs - Leetcode 70 | Using Dynamic Programming

Fibonacci Number - Leetcode 509 | Using Dynamic Programming

Sum of Two Integers - Leetcode 371 | Bit manipulation

Counting Bits - Leetcode 338 | From Naive to Optimal Using Dynamic Programming and Bit patterns

Missing Number - Leetcode 268 | Intuitive 7 Methods

Why 0.1 Isn’t Stored Accurately in Binary (And 0.125 Is) #java #k5kc #interviewpreparation #binary

Reverse Bits - Leetcode 190 | Bitwise manipulation

Maximum Product Subarray - Leetcode 152 | Using Kadane's Algorithm

Find Minimum in Rotated Sorted Array - Leetcode 153 | Using Binary Search

Search in Rotated Sorted Array - Leetcode 33 | Using Binary Search

Binary Search - Leetcode 704

Three Sum - Leetcode 15 - Java

Two Sum II - Leetcode 167 | 3 Approaches (Naive, Binary Search, Two Pointers)