1462. Course Schedule IV | Topological Sort | Kahn's Algorithm

3433. Count Mentions Per User | Simulation| Code Quality

3434. Maximum Frequency After Subarray Operation | Modified Kadane's Algorithm

2127. Maximum Employees to Be Invited to a Meeting | Length of Cycle in Directed Graph

2948. Make Lexicographically Smallest Array by Swapping Elements | Sorting

802. Find Eventual Safe States | Cycle in Directed Graph | DFS | BFS-Topological Sort

1267. Count Servers that Communicate | Simple Arrays | No Graph Traversal

1765. Map of Highest Peak | 542. 01 Matrix | Multi Source BFS

2017. Grid Game | Prefix & Suffix Sums

2661. First Completely Painted Row or Column | Hash Maps | Arrays

3429. Paint House IV | 2 Way DP | Top Down DP

3428. Maximum and Minimum Sums of at Most Size K Subsequences | nCr | P&C

407. Trapping Rain Water II | BFS | Priority Queue

3424. Minimum Cost to Make Arrays Identical | Sorting | Arrays

3425. Longest Special Path | Sliding Window on Trees | Crash Course | Backtracking | Sliding Window

1368. Minimum Cost to Make at Least One Valid Path in a Grid | 0-1 BFS | Dijkstras

2683. Neighboring Bitwise XOR | Bit Manipulation

2425. Bitwise XOR of All Pairings | Bit Manipulation

2429. Minimize XOR | Bit Manipulation

2657. Find the Prefix Common Array of Two Arrays | Hash Map

3418. Maximum Amount of Money Robot Can Earn | DP on Grids | Top Down Approach

3419. Minimize the Maximum Edge Weight of Graph | Graph | Binary Search | BFS

2116. Check if a Parentheses String Can Be Valid | Stack | Constant Space

1400. Construct K Palindrome Strings | Hash Map

916. Word Subsets | Hash Map | Strings

1408. String Matching in an Array | 3 Approaches | KMP | Rabin Karp

1769. Minimum Number of Operations to Move All Balls to Each Box | Prefix & Suffix Sums

3412. Find Mirror Score of a String | Stack | HashMap

3413. Maximum Coins From K Consecutive Bags | Sliding Interval Hard

2381. Shifting Letters II | Line Sweep | Prefix Sums for Range Sums/Range Impact

3408. Design Task Manager | Priority Queue | Map

Rare but "MUST KNOW" DP Concept 🔥| 3409. Longest Subsequence With Decreasing Adjacent Difference |

2270. Number of Ways to Split Array | Prefix Sums

2559. Count Vowel Strings in Ranges | Prefix Sums | Arrays

3403. Find the Lexicographically Largest String From the Box I | String | Pattern Identification

3404. Count Special Subsequences | HashMap | GCD | Pattern Identification

3405. Count the Number of Arrays with K Matching Adjacent Elements | Math | PnC | nCr | Mod Inverse

689. Maximum Sum of 3 Non-Overlapping Subarrays | O(1) space | 2 Approaches | Sliding Window Hard

1014. Best Sightseeing Pair | One Pass | Prefix Maximum

494. Target Sum | Memoization | Bottom Up Optimized | DP

2471. Minimum Number of Operations to Sort a Binary Tree by Level | Arrays & Tree

3398, 3399. Smallest Substring With Identical Characters I & II | 3398 I | Binary Search | !Greedy

3397. Maximum Number of Distinct Elements After Operations | Greedy

2940. Find Building Where Alice and Bob Can Meet | Monotonic stack | Priority Queue

3393. Count Paths With the Given XOR Value | DP on Grid

3394. Check if Grid can be Cut into Sections | Merge Intervals | Line Sweep | Arrays | Sorting

2872. Maximum Number of K-Divisible Components | Topological Sort | BFS | Graphs

2415. Reverse Odd Levels of Binary Tree | BFS | DFS | Trees

769. Max Chunks To Make Sorted | Prefix Sums | Multiple Approaches

1475. Final Prices With a Special Discount in a Shop | Monotonic Stack | 2 Approaches

2182. Construct String With Repeat Limit | Greedy | Maps | Multiple Approaches

1792. Maximum Average Pass Ratio | Proof - why Greedy | Priority Queue

2762. Continuous Subarrays | 5 Approaches | Map | Deque | 2 Pointers

2779. Maximum Beauty of an Array After Applying Operation | Prefix Sums | Sliding Window

2982. Find Longest Special Substring That Occurs Thrice II | 3 Approaches | HashMap | Arrays

3381. Maximum Subarray Sum With Length Divisible by K | Prefix Sums | Arrays | Handling Mod & Length

3380. Maximum Area Rectangle With Point Constraints I | Array | Sorting | Math

3376. Minimum Time to Break Locks I | Recursion with Bitmasks | Not Greedy | Math

2054. Two Best Non-Overlapping Events | Knapsack DP | Line Sweep + Greedy | 3 Approaches

3377. Digit Operations to Make Two Integers Equal | Dijkstras | Prime Sieve | Graph + Math