Hi Everyone,
I am a software developer from Delhi.
I did my Post graduation from Delhi Technological University

Merge Sort | Sorting Algorithm | Most Detailed Video on Merge Sort | Kapil Yadav
51:22
Merge Sort | Sorting Algorithm | Most Detailed Video on Merge Sort | Kapil Yadav
Insertion Sort | Sorting Algorithm | Most Detailed Video on Insertion Sort | Kapil Yadav
18:28
Insertion Sort | Sorting Algorithm | Most Detailed Video on Insertion Sort | Kapil Yadav
Selection Sort | Sorting Algorithm | Most Detailed Video on SelectionSort Sort | Kapil Yadav
15:30
Selection Sort | Sorting Algorithm | Most Detailed Video on SelectionSort Sort | Kapil Yadav
Bubble Sort | Sorting Algorithm | Most Detailed Video on Bubble Sort | Kapil Yadav
18:50
Bubble Sort | Sorting Algorithm | Most Detailed Video on Bubble Sort | Kapil Yadav
Sliding Window Maximum | Leetcode 239 | C++
22:20
Sliding Window Maximum | Leetcode 239 | C++
Find K Closest Elements | Leetcode 658 | Multiple Approaches | Heap Series | C++
19:44
Find K Closest Elements | Leetcode 658 | Multiple Approaches | Heap Series | C++
Minimum Cost of Ropes | Connect N Ropes with Min Cost | Heap Series |
13:40
Minimum Cost of Ropes | Connect N Ropes with Min Cost | Heap Series |
Top K Frequent Elements | Leetcode 347 | Multiple Approaches | C++
19:41
Top K Frequent Elements | Leetcode 347 | Multiple Approaches | C++
Kth Largest Element in a Stream | C++
15:48
Kth Largest Element in a Stream | C++
Task Scheduler | Leetcode 621 | Priority Queue | Heaps | C++
36:53
Task Scheduler | Leetcode 621 | Priority Queue | Heaps | C++
Kth Largest Element in an Array | Leetcode 215 | Priority Queue | Max Heap | Min Heap | C++
14:28
Kth Largest Element in an Array | Leetcode 215 | Priority Queue | Max Heap | Min Heap | C++
Heap Sort, Insertion/Deletion in Heap | Heapify | Complete Binary Tree | Priority Queue | C++
1:03:11
Heap Sort, Insertion/Deletion in Heap | Heapify | Complete Binary Tree | Priority Queue | C++
C++ STL in 1 Hour | Vector | Map | Priority Queue | Stack | Queue | Set | Pair
1:18:35
C++ STL in 1 Hour | Vector | Map | Priority Queue | Stack | Queue | Set | Pair
22. Count Number of bits to be flipped to convert A to B || Bit Manipulation Series || XOR
6:10
22. Count Number of bits to be flipped to convert A to B || Bit Manipulation Series || XOR
23. Leetcode - 268 Missing Number || Bit Manipulation Series || XOR
15:51
23. Leetcode - 268 Missing Number || Bit Manipulation Series || XOR
21. Xor in range From Left to Right || Bit Manipulation Series || XOR
6:19
21. Xor in range From Left to Right || Bit Manipulation Series || XOR
20 Find Xor From 1 to N || Bit Manipulation Series || XOR || O(1) Time
7:16
20 Find Xor From 1 to N || Bit Manipulation Series || XOR || O(1) Time
19 Single Number 3 | leetcode 260 | Multiple Approaches | brute force | XOR | Map
47:34
19 Single Number 3 | leetcode 260 | Multiple Approaches | brute force | XOR | Map
18. Single Number | leetcode 136 | Multiple Approaches | brute force | XOR | Map
24:56
18. Single Number | leetcode 136 | Multiple Approaches | brute force | XOR | Map
3. Star Pyramid (Star Pattern) || Must do Pattern Problem Series
19:49
3. Star Pyramid (Star Pattern) || Must do Pattern Problem Series
2. Right-Angled Triangle Pattern || Must do Pattern Problem Series || Programming Basics
17:44
2. Right-Angled Triangle Pattern || Must do Pattern Problem Series || Programming Basics
1. Rectangular Star Pattern || Must do Pattern Problem Series || Programming Basics
5:09
1. Rectangular Star Pattern || Must do Pattern Problem Series || Programming Basics
17. Find letter position in alphabet || Bit Manipulation Series || Kapil yadav
10:02
17. Find letter position in alphabet || Bit Manipulation Series || Kapil yadav
16. Invert Character Case (Uppercase to lower or vice versa ) || Bit Manipulation || Kapil yadav
10:48
16. Invert Character Case (Uppercase to lower or vice versa ) || Bit Manipulation || Kapil yadav
15. Convert Lowercase character to Uppercase character || Bit Manipulation Series
11:18
15. Convert Lowercase character to Uppercase character || Bit Manipulation Series
Quick Sort | Sorting Algorithms | Most Detailed Video on Quick Sort
48:30
Quick Sort | Sorting Algorithms | Most Detailed Video on Quick Sort
Tower of Hanoi | Recursion | Time and Space Complexity | Recursive Tree | DSA
32:49
Tower of Hanoi | Recursion | Time and Space Complexity | Recursive Tree | DSA
14 . Convert Uppercase to Lowercase || Bit Manipulation || Kapil yadav
14:35
14 . Convert Uppercase to Lowercase || Bit Manipulation || Kapil yadav
13. Check whether the number is Power of 8 or Not | Multiple Approaches | Bit Manipulation Series
17:14
13. Check whether the number is Power of 8 or Not | Multiple Approaches | Bit Manipulation Series
12 Power of 4 | Multiple Approaches | Bit Manipulation Series
20:10
12 Power of 4 | Multiple Approaches | Bit Manipulation Series