Here we will discuss the most important data structures and algorithms questions which are usually asked in the top rated product based companies.
About me - My name is Anurag Gupta. I have done my B.Tech. from IIT Roorkee. I have done software engineer internship at Amazon and I have 3 years of work experience as a Senior Software Engineer.
https://www.youtube.com/channel/UCvc0ZHLfgFjNyt_RmvJ5Y3A?sub_confirmation=1

Flatten Binary Tree To Linked List | Leetcode Top Interview 150
5:35
Flatten Binary Tree To Linked List | Leetcode Top Interview 150
Populating Next Right Pointers in Each Node II | Leetcode Top Interview 150
5:21
Populating Next Right Pointers in Each Node II | Leetcode Top Interview 150
Construct Binary Tree From Inorder and Postorder Traversal | Leetcode Top Interview 150
8:05
Construct Binary Tree From Inorder and Postorder Traversal | Leetcode Top Interview 150
Construct Binary Tree From Preorder and Inorder Traversal | Leetcode Top Interview 150
8:30
Construct Binary Tree From Preorder and Inorder Traversal | Leetcode Top Interview 150
Symmetric Tree | Leetcode Top Interview 150
4:41
Symmetric Tree | Leetcode Top Interview 150
Invert Binary Tree | Leetcode Top Interview 150
4:29
Invert Binary Tree | Leetcode Top Interview 150
Same Tree | Leetcode Top Interview 150
4:38
Same Tree | Leetcode Top Interview 150
Maximum Depth of Binary Tree | Leetcode Top Interview 150
3:37
Maximum Depth of Binary Tree | Leetcode Top Interview 150
LRU Cache | Leetcode Top Interview 150
7:21
LRU Cache | Leetcode Top Interview 150
Partition List | Leetcode Top Interview 150
4:59
Partition List | Leetcode Top Interview 150
Rotate List | Leetcode Top Interview 150
5:38
Rotate List | Leetcode Top Interview 150
Remove Duplicates From Sorted List II | Leetcode Top Interview 150
5:27
Remove Duplicates From Sorted List II | Leetcode Top Interview 150
Remove Nth Node From End | Leetcode Top Interview 150
5:19
Remove Nth Node From End | Leetcode Top Interview 150
Reverse Nodes in K Group | Leetcode Top Interview 150
5:26
Reverse Nodes in K Group | Leetcode Top Interview 150
Reverse Linked List II | Leetcode Top Interview 150
5:27
Reverse Linked List II | Leetcode Top Interview 150
Copy List With Random Pointer | Leetcode Top Interview 150
5:32
Copy List With Random Pointer | Leetcode Top Interview 150
Merge Two Sorted Lists | Leetcode Top Interview 150
5:08
Merge Two Sorted Lists | Leetcode Top Interview 150
Add Two Numbers | Leetcode Top Interview 150
4:47
Add Two Numbers | Leetcode Top Interview 150
Linked List Cycle | Leetcode Top Interview 150
4:11
Linked List Cycle | Leetcode Top Interview 150
Basic Calculator | Leetcode Top Interview 150
6:27
Basic Calculator | Leetcode Top Interview 150
Evaluate Reverse Polish Notation | Leetcode Top Interview 150
4:59
Evaluate Reverse Polish Notation | Leetcode Top Interview 150
Min Stack | Leetcode Top Interview 150
5:24
Min Stack | Leetcode Top Interview 150
Simplify Path | Leetcode Top Interview 150
7:26
Simplify Path | Leetcode Top Interview 150
Valid Parentheses | Leetcode Top Interview 150
4:54
Valid Parentheses | Leetcode Top Interview 150
Minimum Number of Arrows to Burst Balloons | Leetcode Top Interview 150
6:04
Minimum Number of Arrows to Burst Balloons | Leetcode Top Interview 150
Insert Interval | Leetcode Top Interview 150
6:30
Insert Interval | Leetcode Top Interview 150
Merge Intervals | Leetcode Top Interview 150
4:28
Merge Intervals | Leetcode Top Interview 150
Summary Ranges | Leetcode Top Interview 150
5:29
Summary Ranges | Leetcode Top Interview 150
Longest Consecutive Sequence | Leetcode Top Interview 150
3:42
Longest Consecutive Sequence | Leetcode Top Interview 150
Contains Duplicate II | Leetcode Top Interview 150
5:01
Contains Duplicate II | Leetcode Top Interview 150