Read, Think, Analyze, Proof, and Observe the problems with me.

Also available on Topmate for 1-1 session: https://topmate.io/codewitharb

Minimum Number of Changes to Make Binary String Beautiful (LeetCode 2914) (String)
12:28
Minimum Number of Changes to Make Binary String Beautiful (LeetCode 2914) (String)
String Compression III (LeetCode 3163) (String)
12:39
String Compression III (LeetCode 3163) (String)
Cousins in Binary Tree II (LeetCode 2641) (BFS)
18:20
Cousins in Binary Tree II (LeetCode 2641) (BFS)
Kth Largest Sum in a Binary Tree (LeetCode 2583) (Level Order Traversal, Min Heap)
19:24
Kth Largest Sum in a Binary Tree (LeetCode 2583) (Level Order Traversal, Min Heap)
Parsing A Boolean Expression (LeetCode 1106) (Hard) (String, Stack)
27:51
Parsing A Boolean Expression (LeetCode 1106) (Hard) (String, Stack)
XOR Queries of a Subarray (LeetCode 1310) (Bit Manipulation)
24:20
XOR Queries of a Subarray (LeetCode 1310) (Bit Manipulation)
Insert Greatest Common Divisors in Linked List ( LeetCode 2807 ) (Linked List)
7:25
Insert Greatest Common Divisors in Linked List ( LeetCode 2807 ) (Linked List)
Spiral Matrix IV (LeetCode 2326) (Linked List)
14:35
Spiral Matrix IV (LeetCode 2326) (Linked List)
Split Linked List in Parts (LeetCode 725) (Linked List)
17:10
Split Linked List in Parts (LeetCode 725) (Linked List)
Linked List in Binary Tree (LeetCode 1367) (DFS, Tree)
18:13
Linked List in Binary Tree (LeetCode 1367) (DFS, Tree)
Delete Nodes From Linked List Present in Array (LeetCode 3217) (LinkedList, HashMap)
13:37
Delete Nodes From Linked List Present in Array (LeetCode 3217) (LinkedList, HashMap)
Find Missing Observations (LeetCode 2028) (Array, Maths)
15:45
Find Missing Observations (LeetCode 2028) (Array, Maths)
Walking Robot Simulation (LeetCode 874) (Array, Hashtable)
20:57
Walking Robot Simulation (LeetCode 874) (Array, Hashtable)
Sum of Digits of String After Convert (LeetCode 1945) (Array, Maths)
12:47
Sum of Digits of String After Convert (LeetCode 1945) (Array, Maths)
Find the Student that Will Replace the Chalk (LeetCode 1894) (Maths, Arrray)
12:23
Find the Student that Will Replace the Chalk (LeetCode 1894) (Maths, Arrray)
Find K-th Smallest Pair Distance (LeetCode 719) (Hard) (3 Approaches) (Binary Search,Sliding Window)
35:39
Find K-th Smallest Pair Distance (LeetCode 719) (Hard) (3 Approaches) (Binary Search,Sliding Window)
Combination Sum II (LeetCode 40) (Recursion, Backtracking)
25:29
Combination Sum II (LeetCode 40) (Recursion, Backtracking)
Kth Largest Element in a Stream (LeetCode 703) (2 Approaches) (Heap)
16:36
Kth Largest Element in a Stream (LeetCode 703) (2 Approaches) (Heap)
Minimum Number of Days to Disconnect Island (LeetCode 1568) (HARD) (DFS) (GRAPH)
37:49
Minimum Number of Days to Disconnect Island (LeetCode 1568) (HARD) (DFS) (GRAPH)
Regions Cut By Slashes (LeetCode 959) (DFS) (Graph)
31:24
Regions Cut By Slashes (LeetCode 959) (DFS) (Graph)
Magic Squares In Grid (LeetCode 840) (Simple Explaination)
19:37
Magic Squares In Grid (LeetCode 840) (Simple Explaination)
Spiral Matrix III (LeetCode 885) (Easily Explained)
25:01
Spiral Matrix III (LeetCode 885) (Easily Explained)
Minimum Number of Pushes to Type Word II (LeetCode 3016) (Sorting, Greedy)
19:03
Minimum Number of Pushes to Type Word II (LeetCode 3016) (Sorting, Greedy)
Kth Distinct String in an Array (LeetCode 2053) (2 Approaches) (HashMap)
11:05
Kth Distinct String in an Array (LeetCode 2053) (2 Approaches) (HashMap)
Make Two Arrays Equal by Reversing Subarrays (LeetCode 1460) (Sorting, counter)
12:37
Make Two Arrays Equal by Reversing Subarrays (LeetCode 1460) (Sorting, counter)
Minimum Swaps to Group All 1's Together II (LeetCode 2134) (Sliding Window)
26:03
Minimum Swaps to Group All 1's Together II (LeetCode 2134) (Sliding Window)
Filling Bookcase Shelves (LeetCode 1105) (Recursion + Memoization) (DP)
34:58
Filling Bookcase Shelves (LeetCode 1105) (Recursion + Memoization) (DP)
Minimum Deletions to Make String Balanced (LeetCode 1653) (3 Approaches) (DP)
17:58
Minimum Deletions to Make String Balanced (LeetCode 1653) (3 Approaches) (DP)
Count Number of Teams (LeetCode 1395) (Recursion+Memoization) (DP)
25:40
Count Number of Teams (LeetCode 1395) (Recursion+Memoization) (DP)
Minimum Cost to Convert String I (LeetCode 2976) (Floyd Warshall Algorithm)
22:14
Minimum Cost to Convert String I (LeetCode 2976) (Floyd Warshall Algorithm)