Number of Ways to Arrive at Destination:
https://youtu.be/kFbJb6cklWo
https://youtu.be/kFbJb6cklWo
YouTube
Number of Ways to Arrive at Destination | Leetcode 1976
This video explains Number of Ways to Arrive at Destination using the most optimal graph dijkstra algorithm with dynamic programming.
------------------------------------------------------------------------------------------------------------------------…
------------------------------------------------------------------------------------------------------------------------…
Count Days Without Meetings:
https://youtu.be/nSSU5c9RYvQ
https://youtu.be/nSSU5c9RYvQ
YouTube
Count Days Without Meetings | Leetcode 3169
This video explains Count Days Without Meetings using the most optimal sorting merging and line sweep 1D approaches.
-----------------------------------------------------------------------------------------------------------------------------------------…
-----------------------------------------------------------------------------------------------------------------------------------------…
Minimum Operations to Make a Uni-Value Grid:
https://youtu.be/JXlM58dalbw
https://youtu.be/JXlM58dalbw
YouTube
Minimum Operations to Make a Uni Value Grid | Leetcode 2033
This video explains Minimum Operations to Make a Uni Value Grid using the most optimal approach.
-------------------------------------------------------------------------------------------------------------------------------------------------------------…
-------------------------------------------------------------------------------------------------------------------------------------------------------------…
Minimum Index of a valid split:
https://youtu.be/VIygRO5dHqQ
https://youtu.be/VIygRO5dHqQ
YouTube
Minimum Index of a Valid Split | Leetcode 2780
This video explains Minimum Index of a Valid Split using the most optimal Moore's voting algorithm.
----------------------------------------------------------------------------------------------------------------------------------------------------------…
----------------------------------------------------------------------------------------------------------------------------------------------------------…
Solving Questions With Brainpower:
https://youtu.be/k2JC9CZ0UGU
https://youtu.be/k2JC9CZ0UGU
YouTube
Solving Questions With Brainpower | Leetcode 2140
This video explains Solving Questions With Brainpower using the most optimal dynamic programming approach using recursion.
-----------------------------------------------------------------------------------------------------------------------------------…
-----------------------------------------------------------------------------------------------------------------------------------…
Maximum Value of an Ordered Triplet I & II:
https://youtu.be/qzJJdIZGjfA
https://youtu.be/qzJJdIZGjfA
YouTube
Maximum Value of an Ordered Triplet I and II | Leetcode 2874 | Leetcode 2873
This video explains Maximum Value of an Ordered Triplet I and II using 2 optimal approaches.
----------------------------------------------------------------------------------------------------------------------------------------------------------------
🟣…
----------------------------------------------------------------------------------------------------------------------------------------------------------------
🟣…
Interview Expectations in 2025
LIVE session
Learn :-
1. The current marking standards of top companies
2. What to expect in changing focus from online to offline (on-site) interviews
3. Interview level from OA to on-site
4. Strategies which works in on-site rounds
5. Difficulty level analysis round-wise
6. How DSA and System Design expectations are different
+MUCH MORE…
We will have a QnA session too, where you can ask any of your questions too.
JOIN us today: https://chat.whatsapp.com/H9Yae2Kjw3J...
Date: 9th April
Day: wednesday
Time: 7:30 PM IST / 7 AM PST
Fee: 99 INR / 2 USD
LIVE session
Learn :-
1. The current marking standards of top companies
2. What to expect in changing focus from online to offline (on-site) interviews
3. Interview level from OA to on-site
4. Strategies which works in on-site rounds
5. Difficulty level analysis round-wise
6. How DSA and System Design expectations are different
+MUCH MORE…
We will have a QnA session too, where you can ask any of your questions too.
JOIN us today: https://chat.whatsapp.com/H9Yae2Kjw3J...
Date: 9th April
Day: wednesday
Time: 7:30 PM IST / 7 AM PST
Fee: 99 INR / 2 USD
Maximum Value of an Ordered Triplet I and II:
https://youtu.be/qzJJdIZGjfA
https://youtu.be/qzJJdIZGjfA
YouTube
Maximum Value of an Ordered Triplet I and II | Leetcode 2874 | Leetcode 2873
This video explains Maximum Value of an Ordered Triplet I and II using 2 optimal approaches.
----------------------------------------------------------------------------------------------------------------------------------------------------------------
🟣…
----------------------------------------------------------------------------------------------------------------------------------------------------------------
🟣…
Lowest Common Ancestor of Deepest Leaves:
https://youtu.be/vXTlRSr-zfY
https://youtu.be/vXTlRSr-zfY
YouTube
Lowest Common Ancestor of Deepest Leaves | Leetcode 1123
This video explains Lowest Common Ancestor of Deepest Leaves using the most optimal lca algorithm.
-----------------------------------------------------------------------------------------------------------------------------------------------------------…
-----------------------------------------------------------------------------------------------------------------------------------------------------------…
Even though I had mentioned not to make EASY problems starting this month, still I see that today's problem is interesting, hence it will be uploaded by afternoon.
Sum of All Subset XOR Totals:
https://youtu.be/TnpowktUe1E
https://youtu.be/TnpowktUe1E
YouTube
Sum of All Subset XOR Totals | Leetcode 1863
This video explains Sum of All Subset XOR Totals using the most optimal bit manipulation with maths.
---------------------------------------------------------------------------------------------------------------------------------------------------------…
---------------------------------------------------------------------------------------------------------------------------------------------------------…
Today's video will be released by 3 PM.
Meanwhile you can watch the prerequisite:
https://youtu.be/mouCn3CFpgg?si=k3jMqD_EzPE41lG3
Meanwhile you can watch the prerequisite:
https://youtu.be/mouCn3CFpgg?si=k3jMqD_EzPE41lG3
YouTube
Longest increasing subsequence
This video explains how to find both the longest increasing subsequence length along with the subsequence itself. This is the simplest explanation along with logic. This is a very frequently asked programming interview question. The code for reference is…
Longest Divisible Subset:
https://youtu.be/q8UcbJDHp3M
https://youtu.be/q8UcbJDHp3M
YouTube
Largest Divisible Subset | Leetcode 368
This video explains Largest Divisible Subset using the most optimal LIS algorithm.
----------------------------------------------------------------------------------------------------------------------------------------------------------------
🟣 JOIN our…
----------------------------------------------------------------------------------------------------------------------------------------------------------------
🟣 JOIN our…
Today's video:
Partition equal subset sum: https://youtu.be/obhWqDfzwQQ
Partition equal subset sum: https://youtu.be/obhWqDfzwQQ
YouTube
Partition equal subset sum | Equal sum partition | Dynamic Programming | Leetcode #416
This video explains a very important 01 knapsack dynamic programming problem which is the equal sum partition problem.In this problem, given a set, we are required to divide it into 2 subsets such that their sum are equal.This is similar to 01 knapsack problem…
Main Problem: https://www.youtube.com/watch?v=34l1kTIQCIA
YouTube
subset sum problem dynamic programming | backtracking sum of subsets
This is a video lecture which explains subset sum problem solving using both backtracking and dynamic programming methods. This explanation is a little long but once you watch it, you won't ever regret about having watched such a long video. Backtracking…
Count the Number of Powerful Integers:
https://youtu.be/pPm3Pf3oh5Q
https://youtu.be/pPm3Pf3oh5Q
YouTube
Count the Number of Powerful Integers | Leetcode 2999
This video explains Count the Number of Powerful Integers using the most optimal digit dynamic programming algorithm.
----------------------------------------------------------------------------------------------------------------------------------------…
----------------------------------------------------------------------------------------------------------------------------------------…