- 53
- 60 077
Code In Motion
United States
เข้าร่วมเมื่อ 15 ต.ค. 2024
Welcome to Code In Motion!
Are you preparing for software engineering interviews or struggling with complex algorithms on LeetCode? Look no further! At Code In Motion, I break down challenging coding problems and explain them using easy-to-follow animations that bring the solutions to life. My goal is to make even the toughest algorithms understandable, helping you master key concepts and ace your interviews.
Whether you're a beginner coder or a seasoned software engineer, you'll find valuable insights into coding strategies, optimization techniques, and the thought process behind solving problems efficiently.
Subscribe now to join a growing community of learners, and let's put your code in motion!
Are you preparing for software engineering interviews or struggling with complex algorithms on LeetCode? Look no further! At Code In Motion, I break down challenging coding problems and explain them using easy-to-follow animations that bring the solutions to life. My goal is to make even the toughest algorithms understandable, helping you master key concepts and ace your interviews.
Whether you're a beginner coder or a seasoned software engineer, you'll find valuable insights into coding strategies, optimization techniques, and the thought process behind solving problems efficiently.
Subscribe now to join a growing community of learners, and let's put your code in motion!
[Animated] LeetCode 33 Search in Rotated Sorted Array | Blind 75 | Binary Search
📚 14 LeetCode Patterns to ace any interview www.blog.codeinmotion.io/p/leetcode-patterns
🎬 Blind 75 Animated Playlist th-cam.com/play/PLHm8nzcbp3_19DiTlDg8QYvR-hN5jzPCp.html
👍🔔 If you find this tutorial helpful, like and subscribe!
🔗 LeetCode URL: leetcode.com/problems/search-in-rotated-sorted-array/description/
Today, we’re solving LeetCode 33 Search in Rotated Sorted Array in the Blind 75 list using Binary Search
🕒 Timestamps 🕒
0:00 - Problem Statement & Pre-reqs
1:45 - Modified Binary Search Cases
10:03 - Coding Implementation
#BinarySearch #Leetcode #Blind75
🎬 Blind 75 Animated Playlist th-cam.com/play/PLHm8nzcbp3_19DiTlDg8QYvR-hN5jzPCp.html
👍🔔 If you find this tutorial helpful, like and subscribe!
🔗 LeetCode URL: leetcode.com/problems/search-in-rotated-sorted-array/description/
Today, we’re solving LeetCode 33 Search in Rotated Sorted Array in the Blind 75 list using Binary Search
🕒 Timestamps 🕒
0:00 - Problem Statement & Pre-reqs
1:45 - Modified Binary Search Cases
10:03 - Coding Implementation
#BinarySearch #Leetcode #Blind75
มุมมอง: 49
วีดีโอ
![[Animated] LeetCode 153 Find Minimum in Rotated Sorted Array | Blind 75 | Binary Search](http://i.ytimg.com/vi/5AM_xIetqvQ/mqdefault.jpg)
![[Animated] LeetCode 153 Find Minimum in Rotated Sorted Array | Blind 75 | Binary Search](/img/tr.png)
[Animated] LeetCode 153 Find Minimum in Rotated Sorted Array | Blind 75 | Binary Search
มุมมอง 1867 ชั่วโมงที่ผ่านมา
📚 14 LeetCode Patterns to ace any interview www.blog.codeinmotion.io/p/leetcode-patterns 🎬 Blind 75 Animated Playlist th-cam.com/play/PLHm8nzcbp3_19DiTlDg8QYvR-hN5jzPCp.html 👍🔔 If you find this tutorial helpful, like and subscribe! 🔗 LeetCode URL: leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/ Today, we’re solving LeetCode 153: Find Minimum in Rotated Sorted Array in th...
![[Animated] LeetCode 15 3Sum | Blind 75 | Two Pointer Technique](http://i.ytimg.com/vi/_mZgP-Gwkm8/mqdefault.jpg)
[Animated] LeetCode 15 3Sum | Blind 75 | Two Pointer Technique
มุมมอง 1689 ชั่วโมงที่ผ่านมา
📚 14 LeetCode Patterns to ace any interview www.blog.codeinmotion.io/p/leetcode-patterns 🎬 Blind 75 Animated Playlist th-cam.com/play/PLHm8nzcbp3_19DiTlDg8QYvR-hN5jzPCp.html 👍🔔 If you find this tutorial helpful, like and subscribe! 🔗 LeetCode URL: leetcode.com/problems/3sum/description/ Today, we’re solving LeetCode 15 3Sum on the LeetCode Blind 75 list using the Two Pointer Technique 🕒 Timesta...
How to Start LeetCode in 2025
มุมมอง 5K14 ชั่วโมงที่ผ่านมา
How to Start LeetCode www.blog.codeinmotion.io/p/how-to-start-leetcode 📚 14 LeetCode Patterns to ace any interview www.blog.codeinmotion.io/p/leetcode-patterns 🎬 Blind 75 Animated Playlist th-cam.com/play/PLHm8nzcbp3_19DiTlDg8QYvR-hN5jzPCp.html 👍🔔 If you find this tutorial helpful, like and subscribe! In this video I'll show you EXACTLY how to start leetcoding as a beginner and start ACING you...
![[Animated] LeetCode 76 Minimum Window Substring | Blind 75 | Sliding Window](http://i.ytimg.com/vi/OjskLohz_Nw/mqdefault.jpg)
[Animated] LeetCode 76 Minimum Window Substring | Blind 75 | Sliding Window
มุมมอง 331วันที่ผ่านมา
📚 14 LeetCode Patterns to ace any interview www.blog.codeinmotion.io/p/leetcode-patterns 🎬 Blind 75 Animated Playlist th-cam.com/play/PLHm8nzcbp3_19DiTlDg8QYvR-hN5jzPCp.html 👍🔔 If you find this tutorial helpful, like and subscribe! 🔗 LeetCode URL: leetcode.com/problems/minimum-window-substring/description/ Today, we’re solving LeetCode 76 Minimum Window Substring | Blind 75 | Python | Sliding W...
![[Animated] LeetCode 49 Group Anagrams | Blind 75 | Frequency Count | Hashmap](http://i.ytimg.com/vi/oIzkZOMZLxI/mqdefault.jpg)
[Animated] LeetCode 49 Group Anagrams | Blind 75 | Frequency Count | Hashmap
มุมมอง 230วันที่ผ่านมา
[Animated] LeetCode 49 Group Anagrams | Blind 75 | Frequency Count | Hashmap
![[Animated] LeetCode 242 Valid Anagram | Blind 75 | Hashmap](http://i.ytimg.com/vi/C-hRcCGLUak/mqdefault.jpg)
[Animated] LeetCode 242 Valid Anagram | Blind 75 | Hashmap
มุมมอง 18514 วันที่ผ่านมา
[Animated] LeetCode 242 Valid Anagram | Blind 75 | Hashmap
![[Animated] LeetCode 238 Product of Array Except Self | Blind 75 | Python](http://i.ytimg.com/vi/PjZxg3A_4-Y/mqdefault.jpg)
[Animated] LeetCode 238 Product of Array Except Self | Blind 75 | Python
มุมมอง 25414 วันที่ผ่านมา
[Animated] LeetCode 238 Product of Array Except Self | Blind 75 | Python
![[Animated] LeetCode 19 Remove Nth Node From End of List | Blind 75](/img/n.gif)
[Animated] LeetCode 19 Remove Nth Node From End of List | Blind 75
มุมมอง 25014 วันที่ผ่านมา
[Animated] LeetCode 19 Remove Nth Node From End of List | Blind 75
[Animated] LeetCode 23 Merge k Sorted Lists | Blind 75 | Merge Sort & Heap
มุมมอง 33621 วันที่ผ่านมา
[Animated] LeetCode 23 Merge k Sorted Lists | Blind 75 | Merge Sort & Heap
[Animated] LeetCode 124 Binary Tree Maximum Path Sum | Blind 75
มุมมอง 39321 วันที่ผ่านมา
[Animated] LeetCode 124 Binary Tree Maximum Path Sum | Blind 75
[Animated] LeetCode 21 Merge Two Sorted Lists | Blind 75
มุมมอง 69921 วันที่ผ่านมา
[Animated] LeetCode 21 Merge Two Sorted Lists | Blind 75
[Animated] LeetCode 338 Counting Bits | Blind 75 | Dynamic Programming
มุมมอง 23021 วันที่ผ่านมา
[Animated] LeetCode 338 Counting Bits | Blind 75 | Dynamic Programming
[Animated] LeetCode 371 Sum of Two Integers | Blind 75 | Python | Bitwise Operations
มุมมอง 59728 วันที่ผ่านมา
[Animated] LeetCode 371 Sum of Two Integers | Blind 75 | Python | Bitwise Operations
[Animated] LeetCode 190 Reverse Bits | Blind 75
มุมมอง 375หลายเดือนก่อน
[Animated] LeetCode 190 Reverse Bits | Blind 75
[Animated] LeetCode 268 Missing Number | Blind 75
มุมมอง 374หลายเดือนก่อน
[Animated] LeetCode 268 Missing Number | Blind 75
[Animated] LeetCode 48 Rotate Image | Blind 75
มุมมอง 409หลายเดือนก่อน
[Animated] LeetCode 48 Rotate Image | Blind 75
[Animated] LeetCode 191 Number of 1 Bits | Blind 75
มุมมอง 261หลายเดือนก่อน
[Animated] LeetCode 191 Number of 1 Bits | Blind 75
The only LeetCode resource you'll ever need
มุมมอง 3.1Kหลายเดือนก่อน
The only LeetCode resource you'll ever need
[Animated] LeetCode 54 Spiral Matrix | Blind 75
มุมมอง 458หลายเดือนก่อน
[Animated] LeetCode 54 Spiral Matrix | Blind 75
[Animated] LeetCode 206 Reverse Linked List | Blind 75
มุมมอง 415หลายเดือนก่อน
[Animated] LeetCode 206 Reverse Linked List | Blind 75
LeetCode was HARD until I learned these 14 patterns! | Coding Templates and Animations
มุมมอง 29Kหลายเดือนก่อน
LeetCode was HARD until I learned these 14 patterns! | Coding Templates and Animations
[Animated] LeetCode 141 Linked List Cycle | Blind 75 | Slow and Fast Pointers
มุมมอง 305หลายเดือนก่อน
[Animated] LeetCode 141 Linked List Cycle | Blind 75 | Slow and Fast Pointers
[Animated] LeetCode 424 Longest Repeating Character Replacement | Blind 75 | Sliding Window
มุมมอง 791หลายเดือนก่อน
[Animated] LeetCode 424 Longest Repeating Character Replacement | Blind 75 | Sliding Window
[Animated] LeetCode 226 Invert Binary Tree | Blind 75 | Python
มุมมอง 293หลายเดือนก่อน
[Animated] LeetCode 226 Invert Binary Tree | Blind 75 | Python
[Animated] LeetCode 152 Maximum Product Subarray | Blind 75
มุมมอง 466หลายเดือนก่อน
[Animated] LeetCode 152 Maximum Product Subarray | Blind 75
[Animated] LeetCode 104 Maximum Depth of Binary Tree | Blind 75
มุมมอง 330หลายเดือนก่อน
[Animated] LeetCode 104 Maximum Depth of Binary Tree | Blind 75
[Animated] LeetCode 100 Same Tree | Blind 75
มุมมอง 174หลายเดือนก่อน
[Animated] LeetCode 100 Same Tree | Blind 75
[Animated] LeetCode 3 Longest Substring Without Repeating Characters | Blind 75 | Sliding Window
มุมมอง 705หลายเดือนก่อน
[Animated] LeetCode 3 Longest Substring Without Repeating Characters | Blind 75 | Sliding Window
[Animated] LeetCode 1 Two Sum | Blind 75 | Hashmap
มุมมอง 702หลายเดือนก่อน
[Animated] LeetCode 1 Two Sum | Blind 75 | Hashmap
goat
Best
Could u make videos on recursion for beginners. Would be gr8
Best
I found your site on reddit and it brought me to your main video (with bgm) This is very helpful, thanks!
Glad it was helpful!
Bro where is your permutation and combination patterns
Instead of splitting these out into different patterns, I've included them as part of backtracking since they fit under that paradigm of exploring all possible paths and pruning based on specific conditions.
@CodeInMotion-IO oh thnks I should have watched the entire video my bad 😅
Really good explanation!
Glad it was helpful!
My first social platform comment : please don't ever stop your animated solutions. These videos are really encouraging for me to spend more time in coding . Thank you.
I’m happy it’s helpful to you!
Python is great but if you're doing a mobile developer role you will probably have to code in Swift or Kotlin in your interviews. I have to use Swift and it definitely has it's challenges but it works out once you get used to it. Still really great video to help everyone get started this year.
Good point! Though even for mobile roles I think learning python is a net positive for anyone’s career!
Awesome explanation and easy to understand for beginners,.. I really appreciate 🫡
No problem! Welcome to the channel!
I think correct formula would be, interval between max(a'start, b'start) and min(a'end, b'end)
When merging an interval you want to take the minimum start and maximum ends, it helps to see this visually since you want the merged interval to be maximized in size
Leetcode gives me anxiety but the music in the background and presentation in the video really help me chill out. You explain everything so simply, thank you for this! I never seen Dynamic Programming explained so nicely.
Im glad this is helping you! Welcome to the channel!
This video is 100% gold
Im glad its helping you! Welcome to the channel!
Great work man!
Glad you like it!
🔥🙏
Glad it helped!
Great
Thanks!
Nice explanation
Welcome to the channel!
Worth content❤
Glad it helped you!
2:25 Big-Oh (O) notation is implicitly always used for worst case time complexity. For Average case, notation used is Big-Theta not Big-Oh. There are three separate notations for measuring time complexity for this specific purpose (Omega, Theta and Oh). But, today all of that is lost due to half-knowledge or quick studies just for clearing the interviews without understanding something. Ideally, if someone is saying.. something is O(n) that means its worst case performance is linear.
You’re correct with the terminology. Ive kept big oh for the cheat sheets since its widely used and didnt want to steer the video in a different direction. Although technically you can still use big oh for the avg case, theta provides a tighter bound. I wanted to save this topic for a different video, an overview on big oh/theta/omega as a whole. Thanks for your input!
The animation very helpful thank you!!
Glad it was helpful!
Solution available in ALL languages leetcode.com/problems/3sum/solutions/6226543/animated-video-two-pointers-template-vis-smyj/
Bro, do it in cpp if possible 🙏 Also could u make a structured dsa course for beginners.it would b gr8.
I have a written LeetCode solution for all my videos! Check out leetcode.com/problems/3sum/solutions/6226543/animated-video-two-pointers-template-vis-smyj/ for the solution in all languages
You have given me confidence man! Thank you
Awesome, im so glad! Welcome to the channel!
Brother, I trust in YOU !
Welcome to the channel!
Thank you🙏
You’re welcome 😊
im confused, im going through neetcode 150, is backtracking just a form of dp, because it is used to calculate the combinations of things?
Backtracking is not DP. In DP you reuse previous results to formulate your global result. In backtracking, you need to try possible solutions (brute force) and prune paths (reduce the search space efficiently) recursively. Watch my video on backtracking, or better yet my youtube videos on how to start leetcode and leetcode patterns.
amazing solution! thanks!
Glad it helped!
I suggest just doing 10 mediums and after that follow this road up or technique. Minimum 10 mediums.
I would still suggest following this guide before doing 10 mediums since many people can't even solve easy problems when starting out. It's always good to get the fundamentals first.
I started with binary search and now linkedlist. Do I go with data structure wise or with pattern wise ?
I'd suggest following my blog and ordering in this video. Start with refreshing up on data structures and ensuring you understand all operations and time complexities. Then move on to LeetCode Patterns
Feeling confident by your content, that i will master DSA this year 🔥
🙏🙏
Thank you so much
You’re welcome!
3:17 Just wanted to share a fun Fact. My sister had an on call interview with a Google recruiter and the recruiter insisted on using any language other than Python, dONT KNOW WHY?. my sister has a Background in AI-Ml that's why she was habitual with Python.
Interesting, I’ve never heard of this. In fact, many interviewers prefer python too since its more readable and concise.
@@CodeInMotion-IO Yeah, that's a pretty weird case. By the way, I live here in India, and she was being interviewed for an intern position. i guess they wanted to check low level language understanding.
my question is, Are any of these things used in real world applications? Not sure if this is typical for all languages, or just certain types of programming, but I don't think I have ever come anywhere close to having these sorts of problems in my project.
DP is generally not used on the job since its mostly used to optimize complex algorithms. Most of a SWEs day to day is more so feature oriented development rather than improving complex algorithms and efficiency
A lot of things used in competitive programming are not usually used in real life. But a good example of DP used in real life is levenshtein distance, the algorithm used in text auto correction.
@@CodeInMotion-IO i see. I've always been hesitent to even consider any programming jobs, cause although I am personally building a rather large website myself, I still have so much to learn, then I see these leet code things, and I'm like, I don't have a clue. If I had any of that on an interview, id probably get up and walk out. I program with laravel and teaching myself as I go. So perhaps a different skillset.
If your project only involves piecing together different modules and libraries then no, you are not probably using fancy tricks But in my experience even simple automating scripts can use some leetcode level common tricks to speed up things because you intuitively notice patterns and tricks work for that patterns For a repeatedly called function that aren't going to change? You would want to cache/memoize it. Is it DP? You dislike the built-in photo picker come with your NAS and you want to find a photo taken nearest the date you remember, sure you can invoke a system find call for the file name, but if it doesn't exist to find the nearest newer or older one, you could read everything and do a linear search But what if you don't want your little project to stutter every time you press the search button ? A binary search would make it snappy
the given lnks are not working
Which links? Ive tested them all
>Use descriptive variable names Thanks a lot I just failed my Go interview
🤣🤣
but why aren't they asking DP ?
DP has not been a good indicator of how well a SWE would perform and results in many good candidates not getting the roles
@@CodeInMotion-IO In other words, even most decent SWEs don't understand DP? 🤣
@@Sanchuniathon384 You could definitely argue that point! DP is more mathematical, but does not indicate success of a SWE career-wise.
This Channel is going to blow in a couple of days. This is truly amazing and so helpful for leetcode beginners. You are Awesome !
Im glad you find my content helpful! Welcome to the channel!
i just came across randomly wow very nice with animation as a average student i can able to understand top notch !! keep going bro
Thank you! Welcome to the community!
Why is this channel not huge? Massive fan. Please dont stop uploading!
Thank you so much for the kind words! Im glad its helping you!
Many thanks Sir <333
No problem!
Thanks for your efforts. This is a much better approach for sure.
You’re welcome!
Check out the blog with all the studying resources! www.blog.codeinmotion.io/p/how-to-start-leetcode and subscribe for more!
About the prune problem . Can we just sort and stop recursion early?
You could for this specific problem. Im just demonstrating how pruning and backtracking work!
Nice animations! This would be alot more informative if you defined the terms before you used them. For example, i dont know what the current node is!
This
Appreciate the feedback! I have a more in depth longer video that goes through all the patterns more slowly
this is so helpful! thanks a lot!
I'm glad it helped! Welcome to the community!
Subscribe to ACE your interviews!
Subscribe to ace your tech interviews!
I MUST be a monkey here. The problem states "You can choose any character of the string and change it to any other uppercase English character." but you didn't change it with any character at all. If I get this problem statement in an interview I'd never, ever, ever have thought that I wouldn't have to swap any position of the string with any other letter from A-Z. I understand your solution but this problem statement is very confusing with the ask
It's definitely tricky! You want to focus on realizing this is a sliding window pattern due to finding the "max substring" and then figure out the condition to use within the window. I have a video about these patterns you should check out and more content to recognize leetcode patterns