- 149
- 17 350
Leet's Code
India
เข้าร่วมเมื่อ 11 เม.ย. 2024
Software engineer. I make videos about data structures and algorithms, OOPS, Computer networking, Operating systems, system design, and Lifestyle.
3443. Maximum Manhattan Distance After K Changes | Greedy | LeetCode | Medium
Hi, in this video I have explained LeetCode problem 3443. Maximum Manhattan Distance After K Changes
1. Explained the problem statement.
2. Shared the intuition to use all possible combination to maximize the distance.
3. Shared the C++ code.
Problem Link:- leetcode.com/problems/maximum-manhattan-distance-after-k-changes/
Code Link:- leetcode.com/problems/maximum-manhattan-distance-after-k-changes/submissions/1528234994/
1. Explained the problem statement.
2. Shared the intuition to use all possible combination to maximize the distance.
3. Shared the C++ code.
Problem Link:- leetcode.com/problems/maximum-manhattan-distance-after-k-changes/
Code Link:- leetcode.com/problems/maximum-manhattan-distance-after-k-changes/submissions/1528234994/
มุมมอง: 342
วีดีโอ
3440. Reschedule Meetings for Maximum Free Time II | Prefix and Suffix Array | Easy Logic | LeetCode
มุมมอง 1184 ชั่วโมงที่ผ่านมา
Hi, in this Video I have explained LeetCode problem 3440. Reschedule Meetings for Maximum Free Time II 1. Explained the problem statement with examples. 2. Shared how we can use prefix and suffix arrays here. 3. Shared C code. Problem Link:- leetcode.com/problems/reschedule-meetings-for-maximum-free-time-ii/description/ Code Link:- leetcode.com/problems/reschedule-meetings-for-maximum-free-time...
3439. Reschedule Meetings for Maximum Free Time I | Sliding Window | Easy Logic | LeetCode
มุมมอง 4574 ชั่วโมงที่ผ่านมา
Hi, in this video I have explained LeetCode problem 3439. Reschedule Meetings for Maximum Free Time I 1. Explained the problem statement with examples. 2. Shared how we can use sliding window here, and what the logic behind it explained in depth. 3. Shared C code. Problem Link:- leetcode.com/problems/reschedule-meetings-for-maximum-free-time-i/description/ Code Link:- leetcode.com/problems/resc...
3434. Maximum Frequency After Subarray Operation | Prefix Sum | LeetCode | Kadane's Algorithm
มุมมอง 19812 ชั่วโมงที่ผ่านมา
Hi, in this video I have discussed LeetCode problem 3434. Maximum Frequency After Subarray Operation. 1. Explained the problem statement with examples. 2. Explained the intuition to solve of finding perfect subarray, also shared the mathematical expression. 3. Shared how we can find max subarray sum. 4. Shared the C code. Problem Link:- leetcode.com/problems/maximum-frequency-after-subarray-ope...
3433. Count Mentions Per User | Sorting | Map | LeetCode | Medium
มุมมอง 14019 ชั่วโมงที่ผ่านมา
Hi, in this video I have explained LeetCode problem 3433. Count Mentions Per User 1. Explained the problem statements with examples. 2. Shared the logic to solve by using map and vector. 3. Shared C code. Problem Link:- leetcode.com/problems/count-mentions-per-user/description/ Code Link:- leetcode.com/problems/count-mentions-per-user/submissions/1520621751/
802. Find Eventual Safe States | Topological Sort | Graph | LeetCode | Medium | BFS
มุมมอง 53วันที่ผ่านมา
Hi, in this video I have explained LeetCode problem 802. Find Eventual Safe States. 1. Explained the problem statement with examples. 2. Shared intuition to use topological sort, how it will help us here, and handling the graph cycle. 3. Shared the C code. Problem Link:- leetcode.com/problems/find-eventual-safe-states Code Link:- leetcode.com/problems/find-eventual-safe-states/submissions/15185...
3428. Maximum and Minimum Sums of at Most Size K Subsequences | Sorting | Combination | nCr
มุมมอง 47614 วันที่ผ่านมา
Hi, in this Video I have discussed LeetCode problem 3428. Maximum and Minimum Sums of at Most Size K Subsequences 1. Explained the problem statement with examples. 2. Shared brute force approach. 3. Shared the intuition to solve by using sorting and combination. 4. Shared C code. Problem Link:- leetcode.com/problems/maximum-and-minimum-sums-of-at-most-size-k-subsequences/description/ Code Link:...
3424. Minimum Cost to Make Arrays Identical | Sorting | LeetCode | Medium | O(NlogN)
มุมมอง 11514 วันที่ผ่านมา
Hi, in this video I have discussed LeetCode problem 3424. Minimum Cost to Make Arrays Identical 1. Explained the problem statement with examples. 2. shared the intuition why we need at most one split. 3. Shared the C code. Problem Link:- leetcode.com/problems/minimum-cost-to-make-arrays-identical/description/ Code Link:- leetcode.com/problems/minimum-cost-to-make-arrays-identical/submissions/15...
2683. Neighboring Bitwise XOR | Bit Manipulation | XOR property | LeetCode | Medium
มุมมอง 6714 วันที่ผ่านมา
Hi, in this video I have explained LeetCode problem 2683. Neighboring Bitwise XOR 1. Explained the problem statement with examples. 2. Shared the intuition to generate the original array by assuming the starting number as 0 and 1 both. 3. Shared the C code. 4. Shared the intuition to check the total xor value of the derived array. 5. Shared the C code. 6. Calculated the time and space complexit...
3418. Maximum Amount of Money Robot Can Earn | Recursion | Memoization | DP | LeetCode | Medium
มุมมอง 23721 วันที่ผ่านมา
Hi, in this video I have explained LeetCode problem 3418. Maximum Amount of Money Robot Can Earn 1. Explained the problem statement with examples. 2. Shared recursive approach. 3. Shared base case and other cases. 4. Then, I shared how memorization can be used on this. 5. Shared C code. Problem Link:- leetcode.com/problems/maximum-amount-of-money-robot-can-earn/ Code Link:- leetcode.com/problem...
3419. Minimize the Maximum Edge Weight of Graph | Binary Search | Graph | O(LogN) | LeetCode | EASY
มุมมอง 10421 วันที่ผ่านมา
Hi, in this video I have explained LeetCode problem 3419. Minimize the Maximum Edge Weight of Graph 1. Explained the problem statement. 2. Shared the logic to use linear search and binary search. 3. Then shared why the threshold value is not influencing this problem. 4. Shared the final steps and algorithm. 5. Shared the C code. Problem Link:- leetcode.com/problems/minimize-the-maximum-edge-wei...
1400. Construct K Palindrome Strings | String | Map | Greedy | Palindrome Logic | O(N) | LeetCode
มุมมอง 4321 วันที่ผ่านมา
Hi, in this video I have explained LeetCode problem 1400. Construct K Palindrome Strings. 1. Explained the problem statements with examples. 2. Explained palindrome string properties of odd length and even length. 3. Shared the algorithm. 4. Shared C code. Also calculated the time and space complexity. Problem Link:- leetcode.com/problems/construct-k-palindrome-strings Code Link:- leetcode.com/...
1769. Minimum Number of Operations to Move All Balls to Each Box | Brute force | Prefix Sum O(N)
มุมมอง 6828 วันที่ผ่านมา
Hi, in this video I have discussed LeetCode problem 1769. Minimum Number of Operations to Move All Balls to Each Box 1. Explained the problem statements with examples. 2. Shared brute force approach. 3. Shared intuition to use prefix sum to optimize 4. Shared C code. Problem Link:- leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/description/ Code Link:- leetcode...
3412. Find Mirror Score of a String | Map | LeetCode | Medium | Set
มุมมอง 14128 วันที่ผ่านมา
Hi, in this video I have explained LeetCode problem 3412. Find Mirror Score of a String 1. Explained the problem statements with examples. 2. Shared intuition to solve this by using set and map. 3. Optimized the space by using the map smartly. 4. Shared the C code. Problem Link:- leetcode.com/problems/find-mirror-score-of-a-string/ Code Link:- leetcode.com/problems/find-mirror-score-of-a-string...
3411. Maximum Subarray With Equal Products | Math | Log property | LeetCode | Easy
มุมมอง 54028 วันที่ผ่านมา
3411. Maximum Subarray With Equal Products | Math | Log property | LeetCode | Easy
3408. Design Task Manager | System Design | LeetCode | Map | Heap
มุมมอง 27628 วันที่ผ่านมา
3408. Design Task Manager | System Design | LeetCode | Map | Heap
3407. Substring Matching Pattern | String | Matching | LeetCode
มุมมอง 30428 วันที่ผ่านมา
3407. Substring Matching Pattern | String | Matching | LeetCode
2825. Make String a Subsequence Using Cyclic Increments | Brute Force Approach |Two Pointer Approach
มุมมอง 48หลายเดือนก่อน
2825. Make String a Subsequence Using Cyclic Increments | Brute Force Approach |Two Pointer Approach
3373. Maximize the Number of Target Nodes After Connecting Trees II |Graph| The Most Simple Approach
มุมมอง 582 หลายเดือนก่อน
3373. Maximize the Number of Target Nodes After Connecting Trees II |Graph| The Most Simple Approach
3372. Maximize the Number of Target Nodes After Connecting Trees I | Graph | DFS | LeetCode | Medium
มุมมอง 622 หลายเดือนก่อน
3372. Maximize the Number of Target Nodes After Connecting Trees I | Graph | DFS | LeetCode | Medium
3371. Identify the Largest Outlier in an Array | Medium | Math | LeetCode | Map
มุมมอง 1762 หลายเดือนก่อน
3371. Identify the Largest Outlier in an Array | Medium | Math | LeetCode | Map
3366. Minimum Array Sum | Recursion | Memoization | LeetCode | Medium
มุมมอง 992 หลายเดือนก่อน
3366. Minimum Array Sum | Recursion | Memoization | LeetCode | Medium
3365. Rearrange K Substrings to Form Target String | String | Map | LeetCode | Medium
มุมมอง 492 หลายเดือนก่อน
3365. Rearrange K Substrings to Form Target String | String | Map | LeetCode | Medium
3361. Shift Distance Between Two Strings | Medium | Iteration | LeetCode | Module Operation
มุมมอง 1912 หลายเดือนก่อน
3361. Shift Distance Between Two Strings | Medium | Iteration | LeetCode | Module Operation
3356. Zero Array Transformation II | O(NlogQ) | Binary Search | Prefix Sum | Brute Force | LeetCode
มุมมอง 4792 หลายเดือนก่อน
3356. Zero Array Transformation II | O(NlogQ) | Binary Search | Prefix Sum | Brute Force | LeetCode
3355. Zero Array Transformation I | Prefix Sum | LeetCode | Medium | O(N)
มุมมอง 3932 หลายเดือนก่อน
3355. Zero Array Transformation I | Prefix Sum | LeetCode | Medium | O(N)
3351. Sum of Good Subsequences | DP | Math | LeetCode | Hard
มุมมอง 2912 หลายเดือนก่อน
3351. Sum of Good Subsequences | DP | Math | LeetCode | Hard
3350. Adjacent Increasing Subarrays Detection II | Binary Search | Prefix Sum | LeetCode | Medium
มุมมอง 892 หลายเดือนก่อน
3350. Adjacent Increasing Subarrays Detection II | Binary Search | Prefix Sum | LeetCode | Medium
3346. Maximum Frequency of an Element After Performing Operations I | Sorting | Binary Search
มุมมอง 2582 หลายเดือนก่อน
3346. Maximum Frequency of an Element After Performing Operations I | Sorting | Binary Search
3335. Total Characters in String After Transformations I | Math | Frequency Map | LeetCode | Medium
มุมมอง 2363 หลายเดือนก่อน
3335. Total Characters in String After Transformations I | Math | Frequency Map | LeetCode | Medium
Nice explanation
Super Explantion anna❤
Good 😊
Thank you for your videos!!! It's very useful for me and also so easy explanation ❤️
Thank you so much for your kind words! 😊 I'm glad you found the videos helpful and easy to follow. Your support means a lot! ❤️ Stay tuned for more content. 🚀
awesome explanation can you please explain rest of the problems as well
Thank you so much! I'm really happy to hear that you found my explanation easy to understand. 😊 Keep following, as I'll definitely be making videos for the other problems as well. Stay tuned!
Keep it up
very good explanation sir
Thank you so much! I'm glad you found the explanation helpful! Don't forget to like, share, and subscribe for more content!
Wowww 😊😊
😊😊
nice explanation 🥰
Thank you so much for your kind words! 🥰 Keep coding, keep learning, and let’s grow together! Don’t forget to share this video with your friends and help them learn too. 💻✨
😊😊
great use of log , got to learn something new. thanks a lot.
You're most welcome! I'm really glad you found the explanation helpful and learned something new. Learning and sharing knowledge is always a two-way street, and comments like yours make it even more rewarding. Thank you for your kind words! 😊
Good
Good
volume bhai
😊
Good 😊
good explanation
IT will give TLE
😊😊
❤
😊😊
voice jra dekh lete bhai
Hi, I've fixed all the setup issues. Check out the recent videos and share your feedback! Thanks, keep coding!!!
Impressive teaching I've subscribed your channel bhai.
Nice ❤
this code will give TLE, try prefix sum array
Why do you think this will give TLE? Could you point out which part of the code leads to repeated calculations or inefficiency? I’d like to understand your perspective better.
@@LeetS_Code i will solve in my free time and paste the code here meanwhile you might search about prefix sum and how to use it i am not sure if this code will give TLE or not but this is not an efficient way
😊
Good
First of all thank you so much for explaining this. I liked your explanation and code walk through. Couple of suggestions: 1) Please write neatly on the screen if possible. So that audience can understand the logic better. 2) Come prepared with an example to explain the approach. This will better help in understanding the concept (answer) 3) Use youtube video chapters to segment your video into: 1) question 2) Logic explanation using example 3) code walk through, etc. All the best and once again thanks
Thank you for your feedback! In my latest video, I’ve made an effort to write neatly on the screen using a clear pen color for better readability. I’ve also included a detailed example to explain the approach, ensuring the concept is easy to understand. Let me know if it helped or if there’s anything else I can improve!
@@LeetS_Code Thanks for listening to your audience man!! You are doing a really good job. Keep going.💪
Keep it up ❤
Good job bro..provide solutions on next weekly test at same time i have to copy and paste. Even chatGPT is not able to answer these fucking contest questions
❤
💯💯
bakwaas
❤
Keep it up ❤
Good
Good
Wahhhh😮
Impressive video, Leet's Code. Looking forward to your next upload from you. I smashed the thumbs up icon on your content. Keep up the great work! Your explanation of the smallest range problem was really insightful. Have you considered discussing potential optimizations for the algorithm, especially in terms of time complexity when dealing with larger datasets?
Thank you so much for the support! I'm really glad you found the explanation of the smallest range problem insightful. 😊 I appreciate the suggestion about discussing potential optimizations-I'll definitely consider diving into time complexity and efficiency improvements, especially for larger datasets, in a future video. Stay tuned for more content, and thanks again for smashing that thumbs up! 🚀
Good
Sir voice was not clear little bit
Yes, I’m working on my audio quality
understood. carry on.
Thanks. Keep Coding !!!
Good
Good 😊
😊😊
Problem Link -> leetcode.com/problems/design-a-stack-with-increment-operation/ Code Link 1 -> leetcode.com/submissions/detail/312735443/ Code Link 2 -> leetcode.com/submissions/detail/1406611735/
plz make the iterations step by step for clear understanding
Work on your writing skills man
Sure, i will work on it.
Improvements you can make --> - remove the background grid and keep a clean board. - please improve your writing - we already know the question so no need to explain it for half of the video - please decrease the "actually" count(just joking).
Thanks for the feedback, @Nutrino259! I really appreciate your suggestions. I'll definitely work on simplifying the background and improving my writing style. I'll also try to keep the explanations more concise.