Everybody should learn to program a computer, because it teaches you how to think.”

- Steve Jobs

Codechef Starters 157 (A-D) || Not-too-far Repl. || Small, Smaller || Unmedian || Normal is Good
34:59
Codechef Starters 157 (A-D) || Not-too-far Repl. || Small, Smaller || Unmedian || Normal is Good
Difference Array Technique used in Competitive Programming || Multiple Range Updates in O(q + n)
12:20
Difference Array Technique used in Competitive Programming || Multiple Range Updates in O(q + n)
B. Make Majority - Codeforces Round 958 (Div. 2)
6:55
B. Make Majority - Codeforces Round 958 (Div. 2)
Amphibian Escape (Explanation) Codechef Starters 141
11:24
Amphibian Escape (Explanation) Codechef Starters 141
L2 - DFS Algorithm (Depth First Search) Dry run of recursive calls, Time and Space complexity, C++
32:43
L2 - DFS Algorithm (Depth First Search) Dry run of recursive calls, Time and Space complexity, C++
B. Substring and Subsequence - Educational Codeforces Round 167
8:09
B. Substring and Subsequence - Educational Codeforces Round 167
3187. Peaks in Array (Segment Tree Approach) Leetcode Weekly contest 402
19:04
3187. Peaks in Array (Segment Tree Approach) Leetcode Weekly contest 402
Distinct Substring - Codechef Starters 138
8:43
Distinct Substring - Codechef Starters 138
L1 - Graph Basics, Representation, Code for Reading Input and Making Adjacency List
31:55
L1 - Graph Basics, Representation, Code for Reading Input and Making Adjacency List
Large Differences (Explanation) Codechef Starters 137
3:00
Large Differences (Explanation) Codechef Starters 137
Introduction to GRAPH Series - Everything you need to know
15:40
Introduction to GRAPH Series - Everything you need to know
3171. Find Subarray With Bitwise AND Closest to K - Leetcode Weekly contest 400 (Hard)
16:12
3171. Find Subarray With Bitwise AND Closest to K - Leetcode Weekly contest 400 (Hard)
3170. Lexicographically Minimum String After Removing Stars - Leetcode weekly contest 400
9:33
3170. Lexicographically Minimum String After Removing Stars - Leetcode weekly contest 400
Sum of Modes (Explanation) - Codechef Starters 136
10:28
Sum of Modes (Explanation) - Codechef Starters 136
Codeforces Round 947 (Div. 1 + Div. 2) A-C Explanation
22:54
Codeforces Round 947 (Div. 1 + Div. 2) A-C Explanation
B. Symmetric Encoding (Explanation) - Codeforces Round 946 (Div. 3)
3:09
B. Symmetric Encoding (Explanation) - Codeforces Round 946 (Div. 3)
A. Phone Desktop (Explanation) - Codeforces Round 946 (Div. 3)
2:34
A. Phone Desktop (Explanation) - Codeforces Round 946 (Div. 3)
A- C (Explanation) Leetcode Weekly Contest 398
27:20
A- C (Explanation) Leetcode Weekly Contest 398
C. Cat, Fox and Double Maximum (Explanation) - Codeforces Round 945 (Div. 2)
33:56
C. Cat, Fox and Double Maximum (Explanation) - Codeforces Round 945 (Div. 2)
A. Chess For Three (Explanation) - Codeforces Round 945 (Div. 2)
7:35
A. Chess For Three (Explanation) - Codeforces Round 945 (Div. 2)
A - D Explanation (GFG Weekly contest 154)
13:58
A - D Explanation (GFG Weekly contest 154)
3143. Maximum Points Inside the Square - Leetcode Biweekly Contest 130
14:20
3143. Maximum Points Inside the Square - Leetcode Biweekly Contest 130
A - D (Explanation) Codeforces Round 944 (Div. 4)
19:30
A - D (Explanation) Codeforces Round 944 (Div. 4)
Taking Array input in C++ when size is not given
18:09
Taking Array input in C++ when size is not given
Codechef Starters 132 Solutions (A - C) || Game 11 , ALIEN-OR , Optimal Flip
25:37
Codechef Starters 132 Solutions (A - C) || Game 11 , ALIEN-OR , Optimal Flip
3132. Find the Integer Added to Array II - Bruteforce O(n^3) to Optimal O(nlogn) Weekly contest 395
21:03
3132. Find the Integer Added to Array II - Bruteforce O(n^3) to Optimal O(nlogn) Weekly contest 395
F. Minimum Maximum Distance (Graph Theory -1700) || Codeforces Round 903
29:53
F. Minimum Maximum Distance (Graph Theory -1700) || Codeforces Round 903
Segment Tree - (Episode-2) UPDATE, Time complexity of Update fxn || Advanced Data Structure
12:35
Segment Tree - (Episode-2) UPDATE, Time complexity of Update fxn || Advanced Data Structure
Segment Tree - (Episode 1) INTRO, BUILD, Time Complexity of Build fxn || Advanced Data Structure
36:45
Segment Tree - (Episode 1) INTRO, BUILD, Time Complexity of Build fxn || Advanced Data Structure
Superincreasing (Explanation) || Ad-hoc || Codechef Starters 127
3:16
Superincreasing (Explanation) || Ad-hoc || Codechef Starters 127