Explained what is the problem statement and how to approach to solve this problem on whiteboard. Dry run on whiteboard then live coding session with each step detailed explanation.

Link for other important DS & Algo problems videos:

Number Of Islands | Easy explanation & Code on Whiteboard | LeetCode 200 [ Ссылка ]
Reverse Linked List | Iterative and Recursive | On Whiteboard | LeetCode 206 [ Ссылка ]
Merge Two Sorted Lists | code & explanation on Whiteboard | Leetcode #21 [ Ссылка ]
House Robber | Algorithm | Explanation on WhiteBoard | Leetcode #198 [ Ссылка ]

Jump Game | Algorithm | Explanation on WhiteBoard | Leetcode 55 [ Ссылка ]
Jump Game II | Minimum Jumps to reach end of an array | Explanation on WhiteBoard | Leetcode 45 [ Ссылка ]
Jump Game III | Recursion | Explanation on WhiteBoard | Leetcode 1306 [ Ссылка ]
Jump Game III | Depth First Search | Explanation on WhiteBoard | Leetcode 1306 [ Ссылка ]
Jump Game IV | Explanation on WhiteBoard | Leetcode 1345 [ Ссылка ]
Jump Game V | Explanation on WhiteBoard | Leetcode 1340 [ Ссылка ]

Delete And Earn | Explanation on WhiteBoard | Leetcode 740 | Dynamic Programming [ Ссылка ]
Find Pivot Index | Explanation on WhiteBoard | Leetcode # 724 [ Ссылка ]
Trapping Rain Water | Explanation on WhiteBoard | Leetcode 42 [ Ссылка ]
Wildcard Matching | Explanation on WhiteBoard | Leetcode 44 [ Ссылка ]
Ugly Number | Super Ugly Number | Whiteboard explanation | Leetcode 263 313 [ Ссылка ]

Minimum Window Substring | Sliding Window - Double pointer concept | Leetcode 76 [ Ссылка ]
Reverse Integer | Leetcode 7 | Modulo concept | Integer MAX_VALUE [ Ссылка ]
Roman To Integer | Leetcode 13 | Live Code Explanation [ Ссылка ]
Stepping Numbers | What is Stepping number and how to Generate | Leetcode 1215 | Live Code [ Ссылка ]
Fibonacci Number | Fibonacci Sequence | Simple, Recursive, Dynamic Programming | N-th Tribonacci [ Ссылка ]

Coin Change Problem | Dynamic Programming | Explanation on Whiteboard & Live Coding | Leetcode 322 [ Ссылка ]

Median of Two Sorted Arrays | Binary Search Approach | O(log (m+n)) [ Ссылка ]
Two Sum Problem | Basic and HashMap Approach | Leetcode 1 [ Ссылка ]
Two Sum II Problem | Input Array is Sorted | Two Pointers | Leetcode 167 [ Ссылка ]
3 Sum | Three Sum Problem | Two Pointers Approach | Easy explained on Whiteboard | Live coding [ Ссылка ]
Construct Binary Tree from Preorder and Inorder Traversal | Explained Tree Traversal | Leetcode 105 [ Ссылка ]
Construct Binary Tree from Inorder and Postorder Traversal | Leetcode 106 [ Ссылка ]
Construct Binary Search Tree from Preorder Traversal | BST | Leetcode 1008 [ Ссылка ]
Merge Intervals problem | Whiteboard explanation & Live Coding | Leetcode 56 | Arrays & List [ Ссылка ]
Binary Tree Maximum Path Sum | Whiteboard explanation & Live Coding | Leetcode 124 [ Ссылка ]

If you find this video helpful for you then PLEASE help our channel by SUBSCRIBING and LIKE.

#coding #leetcode #tech #software #faang #binarytree #datastructure #algorithm #java #interview #placement

свернуть