- Видео 58
- Просмотров 2 812
doiknowthisthing
Добавлен 13 авг 2024
Welcome to DoIknowThisThing! Here, we dive deep into coding, algorithms, data structures, and problem-solving techniques to help you master the art of programming. Whether you're preparing for coding interviews or just enhancing your skills, my tutorials simplify complex topics, ensuring you understand the 'why' and 'how' behind every solution. Join me on this learning journey as we tackle challenging problems and grow together as developers!
LeetCode 1752 | Check if Array Is Sorted and Rotated | Python Solution Explained #coding #python
🚀 LeetCode 1752 - Check if Array Is Sorted and Rotated | Python Solution 🔥
In this video, we solve LeetCode 1752: Check if Array Is Sorted and Rotated using Python. This problem tests your ability to determine if an array, originally sorted in non-decreasing order, has been rotated some number of positions. We go through an optimized approach, breaking it down step by step.
📌 Topics Covered:
✔️ Problem explanation
✔️ Edge cases & constraints
✔️ Optimized Python solution
✔️ Time complexity analysis
💡 Problem Statement:
Given an array nums, return True if it was originally sorted in non-decreasing order and then rotated some number of positions (including zero). Otherwise, return False.
🔗 LeetCode P...
In this video, we solve LeetCode 1752: Check if Array Is Sorted and Rotated using Python. This problem tests your ability to determine if an array, originally sorted in non-decreasing order, has been rotated some number of positions. We go through an optimized approach, breaking it down step by step.
📌 Topics Covered:
✔️ Problem explanation
✔️ Edge cases & constraints
✔️ Optimized Python solution
✔️ Time complexity analysis
💡 Problem Statement:
Given an array nums, return True if it was originally sorted in non-decreasing order and then rotated some number of positions (including zero). Otherwise, return False.
🔗 LeetCode P...
Просмотров: 4
Видео
🚀 LeetCode 3151: Special Array I | Python Solution 🔥for Coding Interview
Просмотров 232 часа назад
In this video, we solve LeetCode 3151 (Special Array I) with an efficient Python solution. The problem is simple but tricky! We check if every adjacent pair has different parity (odd/even). ✅ What You’ll Learn: What makes an array special? How to efficiently check parity in Python Optimized code walkthrough with examples 📌 Example Inputs & Outputs: 🔹 [1] → ✅ True 🔹 [2,1,4] → ✅ True 🔹 [4,3,1,6] ...
🔥 Leetcode 827 - Making A Large Island | Coding Interview Solution with DFS #coding #827
Просмотров 314 часа назад
📌 Leetcode 827 - Making A Large Island (Hard) In this video, we solve Leetcode 827 - Making A Large Island, a highly asked coding interview question using Graph & DFS. This problem requires efficient island merging and grid traversal to maximize the largest island size by flipping just one 0 to 1. Solution Link: leetcode.com/problems/making-a-large-island/solutions/6351244/using-dfs-by-sanjoli_...
Divide Nodes into Maximum Groups | Hard Graph BFS Problem | LeetCode 2493 #coding #programming #2493
Просмотров 177 часов назад
Solve LeetCode 2493 (Hard) - Divide Nodes Into the Maximum Number of Groups using Graph Coloring BFS! 🚀 Solution Link: leetcode.com/problems/divide-nodes-into-the-maximum-number-of-groups/solutions/6347631/using-map-coloring-and-bfs-by-sanjoli_12-4nww Learn how to determine the maximum number of groups while maintaining adjacency constraints in an undirected graph. This problem involves biparti...
Leetcode 684. Redundant Connection 🔥 | Graph Cycle Detection | Union-Find Explained 🚀 #684
Просмотров 367 часов назад
🚀 Leetcode 684: Redundant Connection | Graph Cycle Detection with Union-Find (Disjoint Set)! In this video, we solve Leetcode 684 - Redundant Connection, a graph theory problem where we detect and remove an extra edge to form a valid tree. 💡 Topics Covered: ✅ Graph Cycle Detection using Union-Find ✅ Path Compression & Union by Rank for efficiency ✅ Step-by-Step Explanation with dry-run & visual...
Leetcode #2658: Maximum Number of Fish in a Grid | Python DFS Solution Explained
Просмотров 3512 часов назад
In this video, we tackle Leetcode problem #2658, "Maximum Number of Fish in a Grid." This medium-level problem focuses on grid traversal to find the optimal starting point for a fisher to catch the maximum number of fish. We use Depth First Search (DFS) to explore connected water cells and calculate the total fish count for each connected component in the grid. The solution is explained step-by...
Course Schedule IV | DFS Solution Explained | LeetCode #1462 #codinginterviews
Просмотров 4314 часов назад
🚀 Leetcode Problem #1462: Course Schedule IV In this video, we solve the Leetcode Medium problem "Course Schedule IV" using Depth First Search (DFS). This problem revolves around determining if one course is a prerequisite for another, given a list of prerequisites and queries. Problem Overview: You're tasked with verifying direct and indirect prerequisites between courses, utilizing efficient...
Leetcode #802 | Find Eventual Safe States Explained with BFS + Code | January Daily Challenge
Просмотров 2619 часов назад
Welcome to today's Leetcode Daily Challenge! In this video, we dive into Leetcode #802 - Find Eventual Safe States, an interesting problem on directed graphs. Learn how to efficiently determine safe nodes using BFS (Breadth-First Search) and reverse graph techniques. Problem link: leetcode.com/problems/find-eventual-safe-states/solutions/6324499/using-topological-sorting-by-sanjoli_121-axii In ...
Shifting Letters II | LeetCode 2381 | Efficient Solution Explained! #CodingInterviews #2381
Просмотров 26День назад
Struggling with Time Limit Exceeded (TLE) on the 'Shifting Letters II' problem? Don't worry! 🚀 In this video, we break down LeetCode Problem 2381 step-by-step, providing you with a highly optimized solution to tackle this coding challenge efficiently. Problem Overview: The 'Shifting Letters II' problem requires modifying a string based on a series of shift operations, moving characters forward ...
#3407 | Substring Matching Pattern | #147 Solution Explained! #biweekly
Просмотров 55День назад
Welcome to this step-by-step guide on solving LeetCode Problem #3407, "Substring Matching Pattern," from #BiweeklyContest147. 🚀 In this video, we’ll tackle a pattern-matching problem where you’re given a string s and a pattern p containing exactly one *. The goal is to determine if p can become a substring of s by replacing * with any sequence of characters. Let’s dive into the logic and soluti...
🚀 Optimized Solution for LeetCode 2657 | Find the Prefix Common Array | Python Explained! #2657
Просмотров 2714 дней назад
Looking for an efficient solution to LeetCode Problem 2657: Find the Prefix Common Array? 🤔 This video is here to help! We tackle the problem with an optimized O(n) approach that simplifies and speeds up the computation of the prefix common array. No need for complex sorting or nested loops! Instead, we use a clever set-based strategy to track elements efficiently and count common values betwee...
Leetcode 3152: Special Array II | Efficient Python Solution with Binary Search & Parity Check #3152
Просмотров 3214 дней назад
🚀 Solving Leetcode 3152: Special Array II using Python with an optimized approach! Learn how to handle queries efficiently using binary search and parity checks. 💡 Perfect for those preparing for coding interviews or tackling daily Leetcode challenges. 🔑 Topics Covered: Binary search implementation Handling parity in arrays Efficient query processing 💻 Watch now to master advanced problem-solvi...
Leetcode 2559: Count Vowel Strings in Ranges | Coding Interview Solution with Prefix Sums #2559
Просмотров 8214 дней назад
🚀 Solving Leetcode 2559: Count Vowel Strings in Ranges step-by-step using Python and prefix sums! 💻 This video is perfect for anyone preparing for coding interviews or practicing competitive programming. 🔑 Topics Covered: Prefix sums explanation Efficient query handling Problem logic and input examples 🕒 Video Chapters: 0:00 Introduction 0:07 Approach 0:25 Example Explanation 1:13 Code Walkthro...
LEFT JOIN vs RIGHT JOIN SQL Explained with Examples | Outer Joins Simplified for Beginners
Просмотров 28Месяц назад
LEFT JOIN vs RIGHT JOIN SQL Explained with Examples | Outer Joins Simplified for Beginners
Unlock Maximum Chunks to Sort in Python! 🔥 | LeetCode Solution Explained
Просмотров 51Месяц назад
Unlock Maximum Chunks to Sort in Python! 🔥 | LeetCode Solution Explained
Find First and Last Position in Sorted Array | Optimized Binary Search Solution (Python)
Просмотров 65Месяц назад
Find First and Last Position in Sorted Array | Optimized Binary Search Solution (Python)
Merge K Sorted Lists - Fastest Way to Master This Coding Problem!
Просмотров 50Месяц назад
Merge K Sorted Lists - Fastest Way to Master This Coding Problem!
Unlock the Secret: Solve 'Find Score of an Array After Marking All Elements' in Minutes!
Просмотров 37Месяц назад
Unlock the Secret: Solve 'Find Score of an Array After Marking All Elements' in Minutes!
Crack the Code: Master the 'Take Gifts from Richest Pile' LeetCode Puzzle!
Просмотров 58Месяц назад
Crack the Code: Master the 'Take Gifts from Richest Pile' LeetCode Puzzle!
Master the Sliding Window Algorithm: Maximize Array Beauty for Coding Interviews!
Просмотров 105Месяц назад
Master the Sliding Window Algorithm: Maximize Array Beauty for Coding Interviews!
Maximum Beauty LeetCode Solution | Step-by-Step Python Tutorial for Coding Interviews
Просмотров 197Месяц назад
Maximum Beauty LeetCode Solution | Step-by-Step Python Tutorial for Coding Interviews
Unlock the Secrets of Longest Substring - LeetCode Solution Simplified!
Просмотров 96Месяц назад
Unlock the Secrets of Longest Substring - LeetCode Solution Simplified!
LeetCode 1760: Minimize Penalty After Bag Operations | Binary Search Optimization Explained
Просмотров 29Месяц назад
LeetCode 1760: Minimize Penalty After Bag Operations | Binary Search Optimization Explained
LeetCode Problem: Maximize Count of Non-Banned Numbers in Python | Binary Search & Logic Explained!
Просмотров 20Месяц назад
LeetCode Problem: Maximize Count of Non-Banned Numbers in Python | Binary Search & Logic Explained!
LeetCode: Number After Double Reversal | Easy Explanation with Python Code
Просмотров 40Месяц назад
LeetCode: Number After Double Reversal | Easy Explanation with Python Code
Build a Simple Function with OpenAI Proxy | Add Two Numbers in Python
Просмотров 36Месяц назад
Build a Simple Function with OpenAI Proxy | Add Two Numbers in Python
Efficient Solution to 'Add Space in Strings' | LeetCode Problem Explained with Code
Просмотров 29Месяц назад
Efficient Solution to 'Add Space in Strings' | LeetCode Problem Explained with Code
Check If N and Its Double Exist | LeetCode Problem Solution Explained | Python DSA Tutorial
Просмотров 29Месяц назад
Check If N and Its Double Exist | LeetCode Problem Solution Explained | Python DSA Tutorial
Reverse Integer LeetCode Solution | Python Tutorial for Coding Interviews
Просмотров 412 месяца назад
Reverse Integer LeetCode Solution | Python Tutorial for Coding Interviews
Merge Two Sorted Linked Lists - LeetCode Solution Explained | Linked List Coding Interview Question
Просмотров 412 месяца назад
Merge Two Sorted Linked Lists - LeetCode Solution Explained | Linked List Coding Interview Question
🔥🔥🔥🔥
Thanks
Good video and great thumbnail
Thankyou so much dear 🥰
awesome videooo
Thankyou so much dear 🥰
Good video and explanation
Glad you liked it
Good thumbail and great explanation😊
Thank you so much dear 🥰 Your comment makes my day.
Nice work❤
@@Prache_Naresh_Vats Thanks bro 🥰
Well, I want all to find out my mistake can you??
Keep up ma'am you are doing great.
Thanks dear ❤️
Animation is good this time😅
Thankyou bro
keep going mam ...
For sure dear
Good
Thankyou So much bro 🥰
niceee
Thankyou Bro
awesome
Thanks Dear
I am excited
Thanks dear
Keep it up
Thanks Dear
Mast video thi didi
Thanks
Awesome
Thanku.........Bahut Thanku aaye haaye
Keep it up
Thanks Dear
Good coding improve while you can
I will try my best
❤
This is good dut to your solution i was able to do mine
Thanks Dear
Good
Thanks
Good
Thanks Dear
Is it efficent for sorting??
Yes, dear since it is O(n) to return the maximum chunks in which we should distribute the array so after if we sort those chunks and concatenate those chunks it will give a sorted list. Also, very happy to help you 😇✨💫.
😂
Superb my dear
Thanks My Dear☺️
❤❤
ACha h
❤
thank you for this <3
You go gurll 🤩🤩
Thanks ❤️
Wow! Look at you teaching Python! You really came a long way! So happy... ☺☺☺ Congratulations and Speedy Success, Prakhar Arora
Thank you so much 😀 Sir ji...Arrey mujhe bahut acha laga aapne meri video pe comment kiya
Very gud
Thanks <3
I have done a mistake at 2:29 . What is the mistake?
Very gud This was amazing
Thanks
Keep up the great work on the channel 🔥 Always learning something new here👍
Thanks for this great comment.
Tell me do you also forget to return answer or some silly mistake like this ???
It is so good now i have a good understanding of SQL Commands
Thanks