Hello, my name is Rochak and welcome to my channel codeTips.
Here I make videos related to dsa.

Merge Intervals | LeetCode 56 | Arrays
14:21
Merge Intervals | LeetCode 56 | Arrays
Valid Anagram | LeetCode 242 | HashMaps
14:55
Valid Anagram | LeetCode 242 | HashMaps
Container With Most Water | LeetCode 11 | Two Pointers
13:58
Container With Most Water | LeetCode 11 | Two Pointers
Triplet Family | GFG Problem of the Day | Arrays
10:54
Triplet Family | GFG Problem of the Day | Arrays
Two Smallests in Every Subarray | Brute | Optimized | GFG Problem of the Day | Arrays | gfg potd
19:13
Two Smallests in Every Subarray | Brute | Optimized | GFG Problem of the Day | Arrays | gfg potd
Reorganize The Array | GFG Problem of the Day | Arrays | gfg potd
7:30
Reorganize The Array | GFG Problem of the Day | Arrays | gfg potd
Max distance between same elements | GFG Problem of the Day | Arrays | Map | gfg potd
8:11
Max distance between same elements | GFG Problem of the Day | Arrays | Map | gfg potd
Linked List Matrix | GFG Problem of the Day | Linked List | gfg potd
14:05
Linked List Matrix | GFG Problem of the Day | Linked List | gfg potd
Largest Pair Sum | GFG Problem of the Day | Arrays | gfg potd
10:29
Largest Pair Sum | GFG Problem of the Day | Arrays | gfg potd
XOR Linked List | GFG Problem of the Day | Linked List
22:35
XOR Linked List | GFG Problem of the Day | Linked List
Find the number of islands | GfG Problem of the Day | Graph | DFS | Connected Components
20:55
Find the number of islands | GfG Problem of the Day | Graph | DFS | Connected Components
Not a subset sum | GfG Problem of the Day | Arrays
7:59
Not a subset sum | GfG Problem of the Day | Arrays
Deletion and Reverse in Circular Linked List | GfG Problem of the Day | Linked List
21:27
Deletion and Reverse in Circular Linked List | GfG Problem of the Day | Linked List
Majority Vote | GfG Problem of the Day | Arrays | Moore's Voting Algorithm
14:06
Majority Vote | GfG Problem of the Day | Arrays | Moore's Voting Algorithm
Kadane's Algorithm | GfG Problem of the Day | Arrays
11:56
Kadane's Algorithm | GfG Problem of the Day | Arrays
Count ways to N'th Stair | GfG Problem of the Day | Dynamic Programming
8:11
Count ways to N'th Stair | GfG Problem of the Day | Dynamic Programming
Minimum number of deletions and insertions | GfG Problem of the Day | Dynamic Programming
16:12
Minimum number of deletions and insertions | GfG Problem of the Day | Dynamic Programming
Minimum Cost Path | GfG Problem of the Day | Dijkstra's Algorithm
18:56
Minimum Cost Path | GfG Problem of the Day | Dijkstra's Algorithm
Max sum path in two arrays | GfG Problem of the Day | Arrays
13:39
Max sum path in two arrays | GfG Problem of the Day | Arrays
Sorted subsequence of size 3 | GfG Problem of the Day | Arrays
12:05
Sorted subsequence of size 3 | GfG Problem of the Day | Arrays
0 - 1 Knapsack Problem | GfG Problem of the Day | Dynamic Programming
17:13
0 - 1 Knapsack Problem | GfG Problem of the Day | Dynamic Programming
Left View of Binary Tree | GfG Problem of the Day | Binary Tree
8:15
Left View of Binary Tree | GfG Problem of the Day | Binary Tree
Alien Dictionary | GfG Problem of the Day | Graph | Topological Sort
26:09
Alien Dictionary | GfG Problem of the Day | Graph | Topological Sort
Shortest path in Undirected Graph | GfG Problem of the Day | Graph | Dijkstra's Algorithm
22:20
Shortest path in Undirected Graph | GfG Problem of the Day | Graph | Dijkstra's Algorithm
Burning Tree | GfG Problem of the Day | Binary Tree | BFS
18:19
Burning Tree | GfG Problem of the Day | Binary Tree | BFS
Kth Smallest | GfG Problem of the Day | 2 Approaches | Arrays
19:25
Kth Smallest | GfG Problem of the Day | 2 Approaches | Arrays
Split an array into two equal Sum subarrays | GfG Problem of the Day | Arrays
9:31
Split an array into two equal Sum subarrays | GfG Problem of the Day | Arrays
Remove Nth Node From End of List | LeetCode 19 | Linked List
9:46
Remove Nth Node From End of List | LeetCode 19 | Linked List
Maximum Total Reward Using Operations I | LeetCode 3180 | Dynamic Programming
16:55
Maximum Total Reward Using Operations I | LeetCode 3180 | Dynamic Programming
Linked List Cycle || | LeetCode 142 | Linked List | Fast and Slow Pointers Approach WITH PROOF
11:35
Linked List Cycle || | LeetCode 142 | Linked List | Fast and Slow Pointers Approach WITH PROOF