Hello my name is ANUBHAV KALIA and I am incoming Specialist Programmer at Infosys.
I am 5* at CodeChef and Specialist on Codeforces.The main aim of channel is to simplify learning and maximize understanding about Coding questions/concept/Solution to the Contests.

Subscribe to the channel and press the bell 🔔 for the latest updates!!!

For business inquiries: [email protected]

23. Arithmetic Slices | Dynamic Programming Series | LeetCode Medium 413
28:35
23. Arithmetic Slices | Dynamic Programming Series | LeetCode Medium 413
22. Stone Game II | Dynamic Programming Series | LeetCode Medium 1140
30:12
22. Stone Game II | Dynamic Programming Series | LeetCode Medium 1140
B. Odd Subarrays | Codeforces Round #794 (Div. 2)
11:57
B. Odd Subarrays | Codeforces Round #794 (Div. 2)
A. Everything Everywhere All But One | Codeforces Round #794 (Div. 2)
6:51
A. Everything Everywhere All But One | Codeforces Round #794 (Div. 2)
C. Column Swapping | Codeforces Round #792 (Div. 1 + Div. 2)
15:36
C. Column Swapping | Codeforces Round #792 (Div. 1 + Div. 2)
B. Z mod X = C | Codeforces Round #792 (Div. 1 + Div. 2)
6:58
B. Z mod X = C | Codeforces Round #792 (Div. 1 + Div. 2)
A. Digit Minimization | Codeforces Round #792 (Div. 1 + Div. 2)
5:03
A. Digit Minimization | Codeforces Round #792 (Div. 1 + Div. 2)
21. Palindromic Substrings | Dynamic Programming Series | LeetCode Medium 647
26:48
21. Palindromic Substrings | Dynamic Programming Series | LeetCode Medium 647
20. Where Will the Ball Fall | Dynamic Programming Series | LeetCode Medium 1706
15:36
20. Where Will the Ball Fall | Dynamic Programming Series | LeetCode Medium 1706
19. Count Number of Teams | Dynamic Programming Series | LeetCode Medium 1395
22:14
19. Count Number of Teams | Dynamic Programming Series | LeetCode Medium 1395
18. Optimal Game Strategy | 877. Stone Game | Dynamic Programming | LeetCode Medium
24:11
18. Optimal Game Strategy | 877. Stone Game | Dynamic Programming | LeetCode Medium
17. Sort Integers by The Power Value | Dynamic Programming Series | LeetCode Medium 1387
16:44
17. Sort Integers by The Power Value | Dynamic Programming Series | LeetCode Medium 1387
B. I love AAAB | Codeforces Global Round 20 | Rated for All
10:14
B. I love AAAB | Codeforces Global Round 20 | Rated for All
A. Log Chopping | Codeforces Global Round 20 | Rated for All
9:03
A. Log Chopping | Codeforces Global Round 20 | Rated for All
16. Number of Good Ways to Split a String | Dynamic Programming | LeetCode Medium 1525
21:49
16. Number of Good Ways to Split a String | Dynamic Programming | LeetCode Medium 1525
A. Direction Change | Codeforces Round #783 | Div - 2
11:18
A. Direction Change | Codeforces Round #783 | Div - 2
15. Count Substrings That Differ by One Character | 3d-DP | LeetCode Medium 1638
40:43
15. Count Substrings That Differ by One Character | 3d-DP | LeetCode Medium 1638
14. All Possible Full Binary Trees | Dynamic Programming | LeetCode Medium 1043
28:01
14. All Possible Full Binary Trees | Dynamic Programming | LeetCode Medium 1043
2233. Maximum Product After K Increments | LeetCode Weekly Contest 288 | Medium
10:11
2233. Maximum Product After K Increments | LeetCode Weekly Contest 288 | Medium
2231. Largest Number After Digit Swaps by Parity | LeetCode Weekly Contest 288 | Easy
4:21
2231. Largest Number After Digit Swaps by Parity | LeetCode Weekly Contest 288 | Easy
C. Tree Infection | Codeforces Round #781 | Div-2
26:38
C. Tree Infection | Codeforces Round #781 | Div-2
B. Array Cloning Technique | Codeforces Round #781 | Div-2
21:53
B. Array Cloning Technique | Codeforces Round #781 | Div-2
A. GCD vs LCM | Codeforces Round #781 | Div-2
2:37
A. GCD vs LCM | Codeforces Round #781 | Div-2
13. Partition Array for Maximum Sum | Dynamic Programming | LeetCode Medium 1043
24:15
13. Partition Array for Maximum Sum | Dynamic Programming | LeetCode Medium 1043
12. Minimum Falling Path Sum | LeetCode Medium 931| Dynamic Programming
16:59
12. Minimum Falling Path Sum | LeetCode Medium 931| Dynamic Programming
2222. Number of Ways to Select Buildings | LeetCode Biweekly Contest 75 | LeetCode Contest
21:26
2222. Number of Ways to Select Buildings | LeetCode Biweekly Contest 75 | LeetCode Contest
2220. Minimum Bit Flips to Convert Number | LeetCode Biweekly Contest 75 | LeetCode Contest
5:22
2220. Minimum Bit Flips to Convert Number | LeetCode Biweekly Contest 75 | LeetCode Contest
11. Minimum Cost Tree From Leaf Values | (2-D DP) | Dynamic Programming | LeetCode Medium 1130
34:37
11. Minimum Cost Tree From Leaf Values | (2-D DP) | Dynamic Programming | LeetCode Medium 1130
10. Counting Bits | Dynamic Programming | Leetcode Medium 338
14:01
10. Counting Bits | Dynamic Programming | Leetcode Medium 338
9. Count Square Submatrices with All Ones | Dynamic Programming | LeetCode Medium 1277
23:54
9. Count Square Submatrices with All Ones | Dynamic Programming | LeetCode Medium 1277