Sandeep Vaid

Hi! 👋 I’m Sandeep vaid, a Software Development Engineer (SDE) with 3+ years of experience working on diverse and exciting projects in the tech world.
This channel is a hub for coding tutorials, engineering courses, and a touch of personal life through **vlogs**. My aim is to share my knowledge, help you grow as a developer, and make the world of software engineering accessible and fun.

What You’ll Find Here
- 💻 Coding Tutorials
- 🏗️ System Design:
- 🎥 Vlogs
- 🚀 Career Advice
Whether you're a beginner or an experienced developer, this channel offers something for everyone:
- Hands-on content from real-world projects.
- Clear explanations of complex topics.
- Insights from an SDE working on scalable and impactful systems.
Subscribe now, and let’s code, learn, and grow together!

790 Domino and Tromino Tiling || Leetcode 75 || Python
790 Domino and Tromino Tiling || Leetcode 75 || Python
Vaishno devi trip with freinds
Vaishno devi trip with freinds
437. Path Sum III | Amazon | Hindi
437. Path Sum III | Amazon | Hindi
AI Uprising? Will Devin & Gen AI Conquer Software Engineering?
AI Uprising? Will Devin & Gen AI Conquer Software Engineering?
1996. The Number of Weak Characters in the Game || Python || Leetcode
1996. The Number of Weak Characters in the Game || Python || Leetcode
606. Construct String from Binary Tree || Leetcode || Python
606. Construct String from Binary Tree || Leetcode || Python
814. Binary Tree Pruning || Python || Leetcode
814. Binary Tree Pruning || Python || Leetcode
N-ary Tree Level Order Traversal || Python || Leetcode
N-ary Tree Level Order Traversal || Python || Leetcode
Maximum Product of Word Lengths || Python ||Leetcode
Maximum Product of Word Lengths || Python ||Leetcode
32. Longest Valid Parentheses || Python || Leetcode
32. Longest Valid Parentheses || Python || Leetcode
647. Palindromic Substrings || Python || Leetcode
647. Palindromic Substrings || Python || Leetcode
322. Coin Change || Python || Leetcode
322. Coin Change || Python || Leetcode
63. Unique Paths II Python || Leetcode
63. Unique Paths II Python || Leetcode
1192. Critical Connections in a Network || Python ||Leetcode
1192. Critical Connections in a Network || Python ||Leetcode
1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree || Python || Leetcode
1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree || Python || Leetcode
1091. Shortest Path in Binary Matrix || Python || Leetcode
1091. Shortest Path in Binary Matrix || Python || Leetcode
Deepest Leaves Sum || Leetcode || Python
Deepest Leaves Sum || Leetcode || Python
Network Delay Time || Python || Leetcode
Network Delay Time || Python || Leetcode
Populating Next Right Pointers in Each Node II Leetcode || Python
Populating Next Right Pointers in Each Node II Leetcode || Python
47. Permutations II Leetcode || Python
47. Permutations II Leetcode || Python
1641. Count Sorted Vowel Strings || Python || Leetcode
1641. Count Sorted Vowel Strings || Python || Leetcode
216. Combination Sum III || Python || Leetcode
216. Combination Sum III || Python || Leetcode
17. Letter Combinations of a Phone Number || Python || Leetcode
17. Letter Combinations of a Phone Number || Python || Leetcode
Flatten Nested List Iterator || Python || leetcode
Flatten Nested List Iterator || Python || leetcode
456. 132 Pattern
456. 132 Pattern
1209. Remove All Adjacent Duplicates in String II Python || Leetcode
1209. Remove All Adjacent Duplicates in String II Python || Leetcode
225. Implement Stack using Queues || Leetcode || Python
225. Implement Stack using Queues || Leetcode || Python
1679. Max Number of K-Sum Pairs ||Leetcode ||Python
1679. Max Number of K-Sum Pairs ||Leetcode ||Python
581. Shortest Unsorted Continuous Subarray || Python || Leetcode
581. Shortest Unsorted Continuous Subarray || Python || Leetcode
905. Sort Array By Parity || Python || Leetcode
905. Sort Array By Parity || Python || Leetcode