All the tutorial will be explained by two IITian brothers
Follow us on LinkedIn
Kuldeep Kumar Solanki (IIT Kanpur): https://in.linkedin.com/in/kuldeeps5
Neeraj Kumar Solanki (IIT Roorkee): https://in.linkedin.com/in/neeraj-kumar-solanki

Identical Binary Trees | Interview bit | Trees | Interview prep. | IIT Kanpur
3:47
Identical Binary Trees | Interview bit | Trees | Interview prep. | IIT Kanpur
Symmetric Binary Tree | Interview bit | Trees | Interview prep. | IIT Kanpur
8:12
Symmetric Binary Tree | Interview bit | Trees | Interview prep. | IIT Kanpur
Flatten Binary Tree to Linked List | Interview bit | Trees | Interview prep. | IIT Kanpur
11:14
Flatten Binary Tree to Linked List | Interview bit | Trees | Interview prep. | IIT Kanpur
Balanced binary tree | Interview bit | Trees | Interview prep. | IIT Kanpur
5:33
Balanced binary tree | Interview bit | Trees | Interview prep. | IIT Kanpur
Remove half nodes | Interview bit | Trees | Interview prep. | IIT Kanpur
6:25
Remove half nodes | Interview bit | Trees | Interview prep. | IIT Kanpur
Path to given node | Interview bit | Trees | Interview prep. | IIT Kanpur
5:24
Path to given node | Interview bit | Trees | Interview prep. | IIT Kanpur
2-Sum Binary Tree | InterviewBit | Arrays | Interview prep. | IIT Kanpur
6:59
2-Sum Binary Tree | InterviewBit | Arrays | Interview prep. | IIT Kanpur
Kth Row of Pascal's Triangle | InterviewBit | Arrays | Interview prep. | IIT Kanpur
11:39
Kth Row of Pascal's Triangle | InterviewBit | Arrays | Interview prep. | IIT Kanpur
Noble integer | InterviewBit | Arrays | Interview prep. | IIT Kanpur
4:57
Noble integer | InterviewBit | Arrays | Interview prep. | IIT Kanpur
Wave array | InterviewBit | Arrays | Interview prep. | IIT Kanpur
3:40
Wave array | InterviewBit | Arrays | Interview prep. | IIT Kanpur
Repeat and missing number array | InterviewBit | Arrays | Interview prep. | IIT Kanpur
8:53
Repeat and missing number array | InterviewBit | Arrays | Interview prep. | IIT Kanpur
First Missing Integer | InterviewBit | Arrays | Interview prep. | IIT Kanpur
8:57
First Missing Integer | InterviewBit | Arrays | Interview prep. | IIT Kanpur
n/3 repeat number | InterviewBit | Arrays | Interview prep. | IIT Kanpur
10:32
n/3 repeat number | InterviewBit | Arrays | Interview prep. | IIT Kanpur
Largest Number | InterviewBit | Arrays | Interview prep. | IIT Kanpur
9:03
Largest Number | InterviewBit | Arrays | Interview prep. | IIT Kanpur
Caesar cipher | Strings | Interview prep. | IIT Kanpur
4:47
Caesar cipher | Strings | Interview prep. | IIT Kanpur
Check whether a string is palindrome or not | Strings | Interview prep. | IIT Kanpur
3:22
Check whether a string is palindrome or not | Strings | Interview prep. | IIT Kanpur
Find element in sorted matrix | Array | Interview prep. | IIT Kanpur
8:07
Find element in sorted matrix | Array | Interview prep. | IIT Kanpur
Kadane's Algorithm | Max sum subarray problem | Array | Interview prep. | IIT Kanpur
13:14
Kadane's Algorithm | Max sum subarray problem | Array | Interview prep. | IIT Kanpur
Group anagrams | String | Hashing | Interview prep. | IIT Kanpur
9:49
Group anagrams | String | Hashing | Interview prep. | IIT Kanpur
Invert binary tree | Tree | Interview prep. | IIT Kanpur
10:12
Invert binary tree | Tree | Interview prep. | IIT Kanpur
Find the closest element in Binary Search Tree | Binary Search Tree | Interview prep. | IIT Kanpur
10:11
Find the closest element in Binary Search Tree | Binary Search Tree | Interview prep. | IIT Kanpur
Branch sum of Binary tree | Binary Tree | Interview prep. | IIT Kanpur
10:26
Branch sum of Binary tree | Binary Tree | Interview prep. | IIT Kanpur
Binary Search | Binary search iterative approach | Interview prep. | IIT Kanpur
6:34
Binary Search | Binary search iterative approach | Interview prep. | IIT Kanpur
Binary Search | Binary search recursive approach | Interview prep. | IIT Kanpur
13:34
Binary Search | Binary search recursive approach | Interview prep. | IIT Kanpur
Possible bipartition | Check given graph is Bipartite graph or not | Graph | Interview | IIT Kanpur
11:37
Possible bipartition | Check given graph is Bipartite graph or not | Graph | Interview | IIT Kanpur
Coin change problem : Minimum number of coins | Dynamic programming | Interview prep. | IIT Kanpur
11:53
Coin change problem : Minimum number of coins | Dynamic programming | Interview prep. | IIT Kanpur
Coin change problem | Ways to make change | Dynamic programming | Interview Prep. | IIT Kanpur
18:00
Coin change problem | Ways to make change | Dynamic programming | Interview Prep. | IIT Kanpur
Numbers in pi | Dynamic programming | Interview prep. | IIT Kanpur
19:59
Numbers in pi | Dynamic programming | Interview prep. | IIT Kanpur
Process State Diagram | Types of Schedulers | Operating System | Gate | Interview Prep. | IIT Kanpur
7:30
Process State Diagram | Types of Schedulers | Operating System | Gate | Interview Prep. | IIT Kanpur
Disk Stacking Problem | Box Stacking Problem | Dynamic Programming | Interview Prep. | IIT Kanpur
12:00
Disk Stacking Problem | Box Stacking Problem | Dynamic Programming | Interview Prep. | IIT Kanpur