Hello everyone, I make videos related to data structures and algorithms. I love to code as well as teach . I hope you find these coding videos helpful and fall in love with your coding journey.😁

Search Pattern | C++ | GFG POTD | Geeks for Geeks | Problem of the day
4:46
Search Pattern | C++ | GFG POTD | Geeks for Geeks | Problem of the day
Maximum index | C++ | GFG POTD | Geeks for Geeks | Problem of the day
6:48
Maximum index | C++ | GFG POTD | Geeks for Geeks | Problem of the day
Swap the array elements | C ++ | GFG POTD | Geeks For Geeks | Problem Of The Day
5:22
Swap the array elements | C ++ | GFG POTD | Geeks For Geeks | Problem Of The Day
Largest Number formed from an Array | C ++ | GFG POTD | Geeks For Geeks | Problem Of The Day
5:08
Largest Number formed from an Array | C ++ | GFG POTD | Geeks For Geeks | Problem Of The Day
First element to occur K times | C++ | GFG POTD | Geeks For Geeks | Problem Of The Day
3:21
First element to occur K times | C++ | GFG POTD | Geeks For Geeks | Problem Of The Day
Peak Element | C++ | GFG POTD | Geeks For Geeks | Problem Of The Day
3:30
Peak Element | C++ | GFG POTD | Geeks For Geeks | Problem Of The Day
Sum Of Bit Differences | C++ | GFG POTD | Bit Manipulation
6:06
Sum Of Bit Differences | C++ | GFG POTD | Bit Manipulation
Check if a number is divisible by 8 | C++ | String | GFG POTD | Code Adore
2:16
Check if a number is divisible by 8 | C++ | String | GFG POTD | Code Adore
3015. Count the Number of Houses at a Certain Distance I | Weekly 381 | C++
7:20
3015. Count the Number of Houses at a Certain Distance I | Weekly 381 | C++
3014. Minimum Number of Pushes to Type Word I | Weekly 381 | C++
6:13
3014. Minimum Number of Pushes to Type Word I | Weekly 381 | C++
1496. Path Crossing | Hashing | C ++ | Leetcode
5:27
1496. Path Crossing | Hashing | C ++ | Leetcode
Intersection of two sorted Linked lists | Linked Lists |GFG | C++ | POTD | Day 21 | Amazon
7:37
Intersection of two sorted Linked lists | Linked Lists |GFG | C++ | POTD | Day 21 | Amazon
Reverse a Doubly Linked List | GFG | C++ | Problem Of The Day | Day 20
5:10
Reverse a Doubly Linked List | GFG | C++ | Problem Of The Day | Day 20
Binary Tree to CDLL | GeeksForGeeks | Medium | C++ | Problem Of The Day | Day 19 | GFG
11:38
Binary Tree to CDLL | GeeksForGeeks | Medium | C++ | Problem Of The Day | Day 19 | GFG
Better String | GFG | HARD | C++ | Problem Of The Day | Day 18
10:10
Better String | GFG | HARD | C++ | Problem Of The Day | Day 18
Check if strings are rotations of each other or not | GFG | C++ | Problem Of The Day | Day 17
5:15
Check if strings are rotations of each other or not | GFG | C++ | Problem Of The Day | Day 17
Shortest Common Supersequence | Medium | GFG | C++ | Problem Of The Day | Day 16
13:01
Shortest Common Supersequence | Medium | GFG | C++ | Problem Of The Day | Day 16
Isomorphic Strings | Easy | GFG | C++ | Problem Of The Day | Day 15
7:47
Isomorphic Strings | Easy | GFG | C++ | Problem Of The Day | Day 15
Number following a pattern | Medium | GFG | C++ | Problem Of The Day | Day 14
9:49
Number following a pattern | Medium | GFG | C++ | Problem Of The Day | Day 14
Predict the Column | GFG | C++ | Problem Of The Day | Day 13
3:51
Predict the Column | GFG | C++ | Problem Of The Day | Day 13
Print Matrix in snake Pattern | GFG | C++ | Problem Of The Day | Day 12
3:20
Print Matrix in snake Pattern | GFG | C++ | Problem Of The Day | Day 12
Letters Collection | GFG | C++ | Problem Of The Day | Day 11 | Optimized Solution
9:02
Letters Collection | GFG | C++ | Problem Of The Day | Day 11 | Optimized Solution
Find Transition Point | GFG | C++ | Problem Of The Day | Day 9 | Optimized Solution
7:01
Find Transition Point | GFG | C++ | Problem Of The Day | Day 9 | Optimized Solution
Pythagorean Triplet | GFG | C++ | Problem Of The Day | Day 8 | Optimized Solution
8:54
Pythagorean Triplet | GFG | C++ | Problem Of The Day | Day 8 | Optimized Solution
Minimum distance between two numbers | GFG | C++ | Problem Of The Day | Day 7
4:44
Minimum distance between two numbers | GFG | C++ | Problem Of The Day | Day 7
Frequencies of Limited Range Array Elements | Geeks For Geeks | Day 6
2:45
Frequencies of Limited Range Array Elements | Geeks For Geeks | Day 6
Move all zeroes to end of array | Geeks For Geeks | POTD | Day 5
3:05
Move all zeroes to end of array | Geeks For Geeks | POTD | Day 5
Sum of XOR of all pairs | Geeks For Geeks | POTD | Day 4
6:19
Sum of XOR of all pairs | Geeks For Geeks | POTD | Day 4
Check whether K-th bit is set or not | Geeks For Geeks | POTD | DAY 3
4:01
Check whether K-th bit is set or not | Geeks For Geeks | POTD | DAY 3
2914. Minimum Number of Changes to Make Binary String Beautiful | Leetcode Biweekly 116 | C++
3:23
2914. Minimum Number of Changes to Make Binary String Beautiful | Leetcode Biweekly 116 | C++