Hey everyone! I’m Shouvik, a Software Engineer 3 at Walmart and an ex-Amazonian.

Passionate about technology, software development, and engineering, I love solving complex problems and building scalable solutions. On this channel, I’ll share my journey from a Tier-3 college (KGEC) to MAANG, insights into coding, system design, and industry experiences—along with some travel vlogs! Stay tuned for exciting content.

Maximize the Number of Target Nodes After Connecting Trees I | Leetcode 3372 | Graph | Tree | BFS
41:57
Maximize the Number of Target Nodes After Connecting Trees I | Leetcode 3372 | Graph | Tree | BFS
Divisible and Non-divisible Sums Difference || Leetcode 2894 || Math || Brute to Best
20:41
Divisible and Non-divisible Sums Difference || Leetcode 2894 || Math || Brute to Best
Largest Color Value in a Directed Graph || Leetcode 1857 || Cycle on Directed Graph || DP on Graph
42:52
Largest Color Value in a Directed Graph || Leetcode 1857 || Cycle on Directed Graph || DP on Graph
Longest Palindrome by Concatenating Two Letter Words || Leetcode 2131 || Math || Palindrome pattern
23:02
Longest Palindrome by Concatenating Two Letter Words || Leetcode 2131 || Math || Palindrome pattern
Find the Maximum Sum of Node Values | Leetcode 3068 | Graph | Tree | Intuitions | Bit Manipulations
30:52
Find the Maximum Sum of Node Values | Leetcode 3068 | Graph | Tree | Intuitions | Bit Manipulations
Find Words Containing Character || Leetcode 2942 || Brute is the Best
4:41
Find Words Containing Character || Leetcode 2942 || Brute is the Best
Set Matrix Zeroes || Leetcode 73 || Grid || Matrix || Intuitions || 3 Approaches || Brute to Best
28:55
Set Matrix Zeroes || Leetcode 73 || Grid || Matrix || Intuitions || 3 Approaches || Brute to Best
Zero Array Transformation I || Leetcode 3355 || Prefix Sum || Range Update || Point Update
28:22
Zero Array Transformation I || Leetcode 3355 || Prefix Sum || Range Update || Point Update
Type of Triangle || Leetcode 3024 || Maths
9:08
Type of Triangle || Leetcode 3024 || Maths
My Honest Software Engineer Interview Experience at Uber || Software Engineer || SDE-2 || SDE-1
21:24
My Honest Software Engineer Interview Experience at Uber || Software Engineer || SDE-2 || SDE-1
Longest Unequal Adjacent Groups Subsequence II || Leetcode 2901 || Dynamic Programming || Tabular DP
19:32
Longest Unequal Adjacent Groups Subsequence II || Leetcode 2901 || Dynamic Programming || Tabular DP
Longest Unequal Adjacent Groups Subsequence I || Leetcode 2900 || Dynamic Programming || Tabular DP
23:23
Longest Unequal Adjacent Groups Subsequence I || Leetcode 2900 || Dynamic Programming || Tabular DP
Sort Colors || Leetcode 75 || Maths || Dutch National Flag Algorithm || Intuition
25:44
Sort Colors || Leetcode 75 || Maths || Dutch National Flag Algorithm || Intuition
Total Characters in String After Transformations I || Leetcode 3335 || Maths || Intuition
41:35
Total Characters in String After Transformations I || Leetcode 3335 || Maths || Intuition
Finding 3-Digit Even Numbers || Leetcode 2094 || Maths
26:17
Finding 3-Digit Even Numbers || Leetcode 2094 || Maths
Three Consecutive Odds || Leetcode 1550 || Brute is the Best
3:19
Three Consecutive Odds || Leetcode 1550 || Brute is the Best
Minimum Equal Sum of Two Arrays After Replacing Zeros || Leetcode 2918 || Math
13:21
Minimum Equal Sum of Two Arrays After Replacing Zeros || Leetcode 2918 || Math
Find Minimum Time to Reach Last Room II || Leetcode 3342 || Graph || Grid || Dijkstra’s Algorithm
8:23
Find Minimum Time to Reach Last Room II || Leetcode 3342 || Graph || Grid || Dijkstra’s Algorithm
Find Minimum Time to Reach Last Room I || Leetcode 3341 || Graph || Grid || Dijkstra’s Algorithm
26:15
Find Minimum Time to Reach Last Room I || Leetcode 3341 || Graph || Grid || Dijkstra’s Algorithm
Domino and Tromino Tiling || Leetcode 790 || Dynamic Programming || DP
36:22
Domino and Tromino Tiling || Leetcode 790 || Dynamic Programming || DP
Build Array from Permutation || Leetcode 1920 || Brute is the Best
4:33
Build Array from Permutation || Leetcode 1920 || Brute is the Best
Number of Equivalent Domino Pairs || Leetcode 1128 || Maths
17:54
Number of Equivalent Domino Pairs || Leetcode 1128 || Maths
Minimum Domino Rotations For Equal Row || Leetcode 1007 || Maths
20:25
Minimum Domino Rotations For Equal Row || Leetcode 1007 || Maths
Maximum Number of Tasks You Can Assign || Leetcode 2701 || Binary Search || Sorting
37:34
Maximum Number of Tasks You Can Assign || Leetcode 2701 || Binary Search || Sorting
Push Dominoes || Leetcode 838 || BFS || Multi-source
27:40
Push Dominoes || Leetcode 838 || BFS || Multi-source
Find Numbers with Even Number of Digits || Leetcode 1295 || Brute is the Best
5:10
Find Numbers with Even Number of Digits || Leetcode 1295 || Brute is the Best
Count Subarrays Where Max Element Appears at Least K Times || Leetcode 2962 || Sliding Window
15:37
Count Subarrays Where Max Element Appears at Least K Times || Leetcode 2962 || Sliding Window
Count Subarrays With Score Less Than K || Leetcode 2302 || Sliding Window
12:03
Count Subarrays With Score Less Than K || Leetcode 2302 || Sliding Window
My Honest Software Engineer Interview Experience at Amazon|| SDE-1 || SDE-Intern || Fresher || MAANG
19:02
My Honest Software Engineer Interview Experience at Amazon|| SDE-1 || SDE-Intern || Fresher || MAANG
Count Subarrays of Length Three With a Condition || Leetcode 3392 || Sliding Window
5:15
Count Subarrays of Length Three With a Condition || Leetcode 3392 || Sliding Window