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.
----------------------------------------------------------------------------------------------------------------------------------------β¦
----------------------------------------------------------------------------------------------------------------------------------------β¦
No Video today (EASY problem)
2843. Count Symmetric Integers
CPP reference code:-
class Solution {
bool checkSymmetric(string no){
int size = no.size();
if(size&1)
return false;
int left_sum = 0;
int right_sum = 0;
for(int i=0;i<(size+1)/2;++i){
left_sum += no[i];
right_sum += no[size-i-1];
}
return left_sum==right_sum;
}
public:
int countSymmetricIntegers(int low, int high) {
int count = 0;
for(int no=low;no<=high;++no){
if(checkSymmetric(to_string(no)))
count++;
}
return count;
}
};
2843. Count Symmetric Integers
CPP reference code:-
class Solution {
bool checkSymmetric(string no){
int size = no.size();
if(size&1)
return false;
int left_sum = 0;
int right_sum = 0;
for(int i=0;i<(size+1)/2;++i){
left_sum += no[i];
right_sum += no[size-i-1];
}
return left_sum==right_sum;
}
public:
int countSymmetricIntegers(int low, int high) {
int count = 0;
for(int no=low;no<=high;++no){
if(checkSymmetric(to_string(no)))
count++;
}
return count;
}
};
Find the Count of Good Integers:
https://youtu.be/dsHmPTHuIkA
https://youtu.be/dsHmPTHuIkA
YouTube
Find the Count of Good Integers | Leetcode 3272
This video explains Find the Count of Good Integers using the most optimal math permutation and recursion DFS algorithm.
-------------------------------------------------------------------------------------------------------------------------------------β¦
-------------------------------------------------------------------------------------------------------------------------------------β¦
Count Good Numbers:
https://youtu.be/ZhLyJpBVU1s
https://youtu.be/ZhLyJpBVU1s
YouTube
Count Good Numbers | Leetcode 1922
This video explains Count Good Numbers using the most optimal Binary Exponentiation math algorithm.
----------------------------------------------------------------------------------------------------------------------------------------------------------β¦
----------------------------------------------------------------------------------------------------------------------------------------------------------β¦
Interview Preparation strategy for META
1. Talk directly with Software Engineer at META
2. Get the study plan
3. Learn the challenges she faced and the effort she put on a daily basis
4. Know the preparation timeline and what worked for her
5. Get to know the difficulty level in the entire interview process for both DSA & System Design
6. Validate your approach for any future interview offer
7. Get to know the common interview preparation pitfalls for META
8. Know how the interview at META is different from other MAANG companies
9. Ask me anything is included with the session
LIVE interactive session
Limited seats only (registration will close soon)
Date: 16th April
TIME: 8 PM IST / 7:30 AM PST
Duration: 1 hour approx
Fee: 99 INR / 10 USD
CONTACT US (Whatsapp): +91 8918633037
1. Talk directly with Software Engineer at META
2. Get the study plan
3. Learn the challenges she faced and the effort she put on a daily basis
4. Know the preparation timeline and what worked for her
5. Get to know the difficulty level in the entire interview process for both DSA & System Design
6. Validate your approach for any future interview offer
7. Get to know the common interview preparation pitfalls for META
8. Know how the interview at META is different from other MAANG companies
9. Ask me anything is included with the session
LIVE interactive session
Limited seats only (registration will close soon)
Date: 16th April
TIME: 8 PM IST / 7:30 AM PST
Duration: 1 hour approx
Fee: 99 INR / 10 USD
CONTACT US (Whatsapp): +91 8918633037
Count Good Triplets in an Array | Leetcode 2179 :
https://youtu.be/QBhfiHswL1Y
https://youtu.be/QBhfiHswL1Y
YouTube
Count Good Triplets in an Array | Leetcode 2179 | Segment Tree
This video explains Count Good Triplets in an Array using the most optimal segment tree hashmap approach.
----------------------------------------------------------------------------------------------------------------------------------------------------β¦
----------------------------------------------------------------------------------------------------------------------------------------------------β¦
Count and Say:
https://youtu.be/htSwmFGdFUI
https://youtu.be/htSwmFGdFUI
YouTube
Count and Say | Leetcode 38
This video explains Count and Say using the simulation approach.
----------------------------------------------------------------------------------------------------------------------------------------------------------------
π£ JOIN our ππππ π’π§πππ«π―π’ππ° ππ«ππ’π§π’π§π β¦
----------------------------------------------------------------------------------------------------------------------------------------------------------------
π£ JOIN our ππππ π’π§πππ«π―π’ππ° ππ«ππ’π§π’π§π β¦
Count the Number of Fair Pairs:
https://youtu.be/xe6y4aEfvDw
https://youtu.be/xe6y4aEfvDw
YouTube
Count the Number of Fair Pairs | Leetcode 2563
This video explains count the number of fair pairs using the most optimal binary search technique using lower bound and upper bound.
-------------------------------------------------------------------------------------------------------------------------β¦
-------------------------------------------------------------------------------------------------------------------------β¦
Rabbits in Forest:
https://youtu.be/Do2coBlSIFo
https://youtu.be/Do2coBlSIFo
YouTube
Rabbits in Forest | Leetcode 781
This video explains Rabbits in Forest using the most optimal group counting approach.
----------------------------------------------------------------------------------------------------------------------------------------------------------------
π£ JOIN ourβ¦
----------------------------------------------------------------------------------------------------------------------------------------------------------------
π£ JOIN ourβ¦
Count the Hidden Sequences:
https://youtu.be/z0cdra6jHs4
https://youtu.be/z0cdra6jHs4
YouTube
Count the Hidden Sequences | Leetcode 2145
This video explains Count the Hidden Sequences using the most optimal single parse counting solution.
--------------------------------------------------------------------------------------------------------------------------------------------------------β¦
--------------------------------------------------------------------------------------------------------------------------------------------------------β¦
Count the Number of Ideal Arrays:
https://youtu.be/FGf2EPyxcWg
https://youtu.be/FGf2EPyxcWg
YouTube
Count the Number of Ideal Arrays | Leetcode 2338
This video explains Count the Number of Ideal Arrays
----------------------------------------------------------------------------------------------------------------------------------------------------------------
π£ JOIN our ππππ π’π§πππ«π―π’ππ° ππ«ππ’π§π’π§π π©π«π¨π π«ππ¦β¦
----------------------------------------------------------------------------------------------------------------------------------------------------------------
π£ JOIN our ππππ π’π§πππ«π―π’ππ° ππ«ππ’π§π’π§π π©π«π¨π π«ππ¦β¦
Which architecture would you choose for read-heavy system ?
Anonymous Quiz
30%
Multi-Master Slave Architecture
49%
Single-Master Multi-Slave Architecture
19%
P2P Architecture
2%
Pipe-Filter Architecture