Sort by

Newest

Oldest

Popular

GFG | POTD | Roll Characters of String | Java | Hindi
13:17
GFG | POTD | Adding Ones | Prefix Sum | Java | Hindi
9:38
GFG | POTD | Minimum Squares with Full Cuts | Java | Hindi
8:43
LeetCode 4079 | Prime Subset Selection I | Leetcode weekly contest 523 | Java | Hindi
11:26
LeetCode 4081 | Prime Subset Selection II | Leetcode weekly contest 523 | Java | Hindi
25:21
GFG | POTD | Balancing with Distinct Powers | Java | Hindi
20:30
GFG | POTD | Minimum Operations to Reach n | Java | Hindi
5:39
GFG | POTD | Maximum Frequency with K Increments | Sorting + Sliding Window | Java | Hindi
20:40
GFG | POTD | Max Path Sum Between Two Leaves | DFS | Java | Hindi
13:50
GFG | POTD | Longest Increasing Path in Matrix | DFS + Memoization | Java | Hindi
15:33
GFG | POTD | Your Social Network | Java | Hindi
17:46
LeetCode 4073 | Count Good Strings | Fibonacci | Java | Hindi
24:59
GFG | POTD | Perimeter of Shapes in Binary Matrix | Java | Hindi
9:46
GFG | POTD | Lexicographically Smallest Rotation | Booth's Algorithm | Java | Hindi
19:12
GFG | POTD | Ways to Reach Origin | Java | Hindi
11:18
LeetCode: 4067 | Longest Subarray With Restricted Pair Sums | Java | Hindi
18:07
LeetCode 4068 | Maximize Meeting Earnings with Idle Gaps | Java | Hindi
32:22
LeetCode 4062 | TTransform Array Using Pair Operations | Java | Hindi
9:04
LeetCode 4063 | Longest Subarray Divisible by K with At Most One Negation I  | Java | Hindi
17:41
GFG | POTD | Minimum Cost Pizza Selection | Recursion + Memoization | Java | Hindi
12:41
GFG | POTD | Box Stacking | Recursion + Memoization | Java | Hindi
31:49
GFG | POTD | Maximum Height Disc Stack | DP + Sorting | Java | Hindi
40:27
GFG | POTD | Pyramid Array with Reduce Operations | Java | Hindi
29:59
GFG | POTD | Longest Matching in Dictionary with Removals | Binary Search | Java | Hindi
26:05
LeetCode 3524 |  Find X Value of Array I  | Java | Hindi
27:35
GFG | POTD | Check Level Anagrams in Binary Trees | BFS + HashMap | Java | Hindi
12:22
GFG | POTD | Largest Subsquare Surrounded by X | Java | Hindi
17:50
GFG | POTD | Min Cost To Make Two Strings Identical | Recursion + Memoization | Java | Hindi
11:41
GFG | POTD | Dominant Pairs | Sorting + Two Pointers | Java | Hindi
16:50
GFG | POTD | Visit Leaves with Budget | Java | Hindi
19:20