This channel is to provide the viewers a good learning in the field of Computer Science and Software industry.
Our content is to help the candidates i cracking the Software Interviews in terms of Data structure problems and the software Design question and the situational based software engineer Interview questions.

Longest Palindrome by Concatenating Two Letter Words | LeetCode 2131|Daily Leetcode potd |potd TODAY
14:00
Longest Palindrome by Concatenating Two Letter Words | LeetCode 2131|Daily Leetcode potd |potd TODAY
Find Words Containing Character | LeetCode 2942 | leetcode potd TODAY | daily leetcode problem today
3:52
Find Words Containing Character | LeetCode 2942 | leetcode potd TODAY | daily leetcode problem today
Zero Array Transformation III | LeetCode 3362 | Daily Leetcode potd | daily leetcode problem today
17:28
Zero Array Transformation III | LeetCode 3362 | Daily Leetcode potd | daily leetcode problem today
Set Matrix Zeroes | LeetCode 73|Daily Leetcode potd| leetcode potd TODAY | daily l Must do MAANG DSA
16:18
Set Matrix Zeroes | LeetCode 73|Daily Leetcode potd| leetcode potd TODAY | daily l Must do MAANG DSA
Zero Array Transformation I| LeetCode 3355|Daily Leetcode potd| leetcode potd | Line Sweep algorithm
13:13
Zero Array Transformation I| LeetCode 3355|Daily Leetcode potd| leetcode potd | Line Sweep algorithm
Find Minimum Time to Reach Last Room I| LeetCode 3341| Daily Leetcode potd |leetcode potd | Dijkstra
11:42
Find Minimum Time to Reach Last Room I| LeetCode 3341| Daily Leetcode potd |leetcode potd | Dijkstra
Build Array from Permutation| LeetCode 1920 |Daily Leetcode potd| leetcode potd | Permutation
9:37
Build Array from Permutation| LeetCode 1920 |Daily Leetcode potd| leetcode potd | Permutation
Check if Number is a Sum of Powers of Three| LeetCode 1780 |Daily Leetcode potd| leetcode potd | pow
12:57
Check if Number is a Sum of Powers of Three| LeetCode 1780 |Daily Leetcode potd| leetcode potd | pow
Merge Two 2D Arrays by Summing Values|LeetCode 2570 |Daily Leetcode potd| leetcode potd |must do DSA
9:06
Merge Two 2D Arrays by Summing Values|LeetCode 2570 |Daily Leetcode potd| leetcode potd |must do DSA
Shortest Common Supersequence | LeetCode 1092 |Daily Leetcode potd| leetcode potd | must do DP
26:09
Shortest Common Supersequence | LeetCode 1092 |Daily Leetcode potd| leetcode potd | must do DP
Number of Sub-arrays With Odd Sum | LeetCode 1524 | Daily Leetcode potd | leetcode potd | SUBSET SUM
8:54
Number of Sub-arrays With Odd Sum | LeetCode 1524 | Daily Leetcode potd | leetcode potd | SUBSET SUM
Most Profitable Path in a Tree | LeetCode 2467 |Daily Leetcode potd| leetcode potd |must do TREE DSA
20:15
Most Profitable Path in a Tree | LeetCode 2467 |Daily Leetcode potd| leetcode potd |must do TREE DSA
Find Elements in a Contaminated Binary Tree | LeetCode 1261|Daily Leetcode potd |leetcode potd| Tree
8:00
Find Elements in a Contaminated Binary Tree | LeetCode 1261|Daily Leetcode potd |leetcode potd| Tree
Product of the Last K Numbers| LeetCode 1352 |Daily Leetcode potd| leetcode potd | prefix Product
11:55
Product of the Last K Numbers| LeetCode 1352 |Daily Leetcode potd| leetcode potd | prefix Product
Count Number of Bad Pairs| LeetCode 2364 |Daily Leetcode potd| leetcode potd |HashMap
8:35
Count Number of Bad Pairs| LeetCode 2364 |Daily Leetcode potd| leetcode potd |HashMap
Course Schedule IV| LeetCode 1462 |Daily Leetcode potd| leetcode potd |Floyd Warshall |must do Graph
13:32
Course Schedule IV| LeetCode 1462 |Daily Leetcode potd| leetcode potd |Floyd Warshall |must do Graph
Make Lexicographically Smallest Array by Swapping Elements| LeetCode 2948 |Daily Leetcode potd | DSA
18:34
Make Lexicographically Smallest Array by Swapping Elements| LeetCode 2948 |Daily Leetcode potd | DSA
First Completely Painted Row or Column| LeetCode 2661 |Daily Leetcode potd |Leetcode 2d-ARRAY DSA
9:12
First Completely Painted Row or Column| LeetCode 2661 |Daily Leetcode potd |Leetcode 2d-ARRAY DSA
Trapping Rain Water II | LeetCode 407 | Daily Leetcode potd | leetcode potd | Leetcode 2d-ARRAY DSA
20:01
Trapping Rain Water II | LeetCode 407 | Daily Leetcode potd | leetcode potd | Leetcode 2d-ARRAY DSA
Find the Prefix Common Array of Two Arrays | LeetCode 2657 |Daily Leetcode potd | Leetcode ARRAY DSA
10:29
Find the Prefix Common Array of Two Arrays | LeetCode 2657 |Daily Leetcode potd | Leetcode ARRAY DSA
Check if a Parentheses String Can Be Valid| LeetCode 2116 |Daily Leetcode potd| leetcode STRING DSA
12:28
Check if a Parentheses String Can Be Valid| LeetCode 2116 |Daily Leetcode potd| leetcode STRING DSA
Count Prefix and Suffix Pairs I| LeetCode 3042 |Daily Leetcode potd| leetcode potd |Leetcode TOP DSA
8:02
Count Prefix and Suffix Pairs I| LeetCode 3042 |Daily Leetcode potd| leetcode potd |Leetcode TOP DSA
Minimum Number of Operations to Move All Balls to Each Box| LeetCode 1769 |Leetcode potd |today potd
20:08
Minimum Number of Operations to Move All Balls to Each Box| LeetCode 1769 |Leetcode potd |today potd
Shifting Letters II| LeetCode 2381| Line Sweep | leetcode potd| commulative sum |Range based top DSA
17:10
Shifting Letters II| LeetCode 2381| Line Sweep | leetcode potd| commulative sum |Range based top DSA
Unique Length-3 Palindromic Subsequences | LeetCode 1930 | must do String DSA | leetcode potd | potd
20:13
Unique Length-3 Palindromic Subsequences | LeetCode 1930 | must do String DSA | leetcode potd | potd
Number of Ways to Split Array| LeetCode 2270 |Prefix sum|must do Array| leetcode potd | must do DSA
10:05
Number of Ways to Split Array| LeetCode 2270 |Prefix sum|must do Array| leetcode potd | must do DSA
Minimum Cost For Tickets | LeetCode 983 | Dynamic Programming | must do DP | leetcode potd | top DP
17:18
Minimum Cost For Tickets | LeetCode 983 | Dynamic Programming | must do DP | leetcode potd | top DP
Construct String With Repeat Limit| LeetCode 2182| Must do String DSA| Daily Leetcode problem potd
13:37
Construct String With Repeat Limit| LeetCode 2182| Must do String DSA| Daily Leetcode problem potd
Minimum Limit of Balls in a Bag | LeetCode 1760| Must do leetcode DSA| Daily Leetcode |leetcode potd
29:27
Minimum Limit of Balls in a Bag | LeetCode 1760| Must do leetcode DSA| Daily Leetcode |leetcode potd
Maximum Number of Integers to Choose From a Range I | LeetCode 2554 | Daily Leetcode | leetcode potd
6:47
Maximum Number of Integers to Choose From a Range I | LeetCode 2554 | Daily Leetcode | leetcode potd