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!

From Recursion to Memoization: Solving the Most Points Question in Minutes! 🚀 | Coding Tutorial
5:30
From Recursion to Memoization: Solving the Most Points Question in Minutes! 🚀 | Coding Tutorial
Business Data Management & Gear Assembly Numericals Explained! 🚀 | Safety Stock Essentials
12:37
Business Data Management & Gear Assembly Numericals Explained! 🚀 | Safety Stock Essentials
Preprocessing Data with Sklearn & Pandas | Machine Learning Tutorial for Beginners
9:24
Preprocessing Data with Sklearn & Pandas | Machine Learning Tutorial for Beginners
Master Tries in Minutes! (The Secret Behind Google’s Autocomplete 🤯)
7:08
Master Tries in Minutes! (The Secret Behind Google’s Autocomplete 🤯)
🔥 Day 30 Streak! 🚀 Master LeetCode 1524 - Odd Sum Subarrays in O(n)!
1:25
🔥 Day 30 Streak! 🚀 Master LeetCode 1524 - Odd Sum Subarrays in O(n)!
Most Profitable Path in a Tree - LeetCode 2467 | Graph + DFS + BFS | Optimal Solution Explained
7:55
Most Profitable Path in a Tree - LeetCode 2467 | Graph + DFS + BFS | Optimal Solution Explained
Construct Binary Tree from Preorder & Postorder | LeetCode 889 | Explained with Intuition & Code!
5:33
Construct Binary Tree from Preorder & Postorder | LeetCode 889 | Explained with Intuition & Code!
🔥 1028. Recover a Tree from Preorder Traversal | The Most Efficient Stack-Based Approach! 🚀 #tree
3:07
🔥 1028. Recover a Tree from Preorder Traversal | The Most Efficient Stack-Based Approach! 🚀 #tree
LeetCode 2375: Construct Smallest Number From DI String | Essential for Coding Interviews!
3:34
LeetCode 2375: Construct Smallest Number From DI String | Essential for Coding Interviews!
Letter Tile Possibilities | LeetCode 1079 | Backtracking Approach For Coding Interviews
2:31
Letter Tile Possibilities | LeetCode 1079 | Backtracking Approach For Coding Interviews
2698. Find the Punishment Number of an Integer | LeetCode Medium | Coding Interview | Memoization
3:06
2698. Find the Punishment Number of an Integer | LeetCode Medium | Coding Interview | Memoization
3066. Minimum Operations to Exceed Threshold Value II | Coding Interviews | Software Engineer
1:28
3066. Minimum Operations to Exceed Threshold Value II | Coding Interviews | Software Engineer
LeetCode 2342 | Max Sum of a Pair With Equal Sum of Digits | Coding Interview #coding
2:02
LeetCode 2342 | Max Sum of a Pair With Equal Sum of Digits | Coding Interview #coding
LeetCode 1910: Remove All Occurrences of a Substring | Python Solution Explained
0:27
LeetCode 1910: Remove All Occurrences of a Substring | Python Solution Explained
LeetCode 3174 Clear Digits | Easy Java Solution Explained #shortvideo #coding #short #programming
1:12
LeetCode 3174 Clear Digits | Easy Java Solution Explained #shortvideo #coding #short #programming
Count Bad Pairs in Arrays | LeetCode 2364 Explained Step-by-Step
1:41
Count Bad Pairs in Arrays | LeetCode 2364 Explained Step-by-Step
LeetCode 2349 | Number Container System - Efficient Solution Explained! #coding #python
2:00
LeetCode 2349 | Number Container System - Efficient Solution Explained! #coding #python
Tuple with Same Product | LeetCode 1726 For Coding Interview | Optimized Solution Explained! #code
3:04
Tuple with Same Product | LeetCode 1726 For Coding Interview | Optimized Solution Explained! #code
Deploying AI Task-Agent API with Docker & Podman (Part 2) | FastAPI & OpenAI #ai #coding #api
13:18
Deploying AI Task-Agent API with Docker & Podman (Part 2) | FastAPI & OpenAI #ai #coding #api
1790. Check if One String Swap Can Make Strings Equal | Python Coding Solution for Interviews
1:46
1790. Check if One String Swap Can Make Strings Equal | Python Coding Solution for Interviews
Building a Task Automation API with FastAPI & OpenAI (Part 1) | AI-Powered Automation! #ai
24:57
Building a Task Automation API with FastAPI & OpenAI (Part 1) | AI-Powered Automation! #ai
Maximum Ascending Subarray Sum | Sliding Window For Coding Interview | LeetCode 1800 #coding #python
2:00
Maximum Ascending Subarray Sum | Sliding Window For Coding Interview | LeetCode 1800 #coding #python
LeetCode 3105 | Longest Strictly Increasing Or Decreasing Subarray | Python| Efficient Solution
0:57
LeetCode 3105 | Longest Strictly Increasing Or Decreasing Subarray | Python| Efficient Solution
LeetCode 1752 | Check if Array Is Sorted and Rotated | Python Solution Explained #coding #python
1:45
LeetCode 1752 | Check if Array Is Sorted and Rotated | Python Solution Explained #coding #python
🚀 LeetCode 3151: Special Array I | Python Solution 🔥for Coding Interview
0:49
🚀 LeetCode 3151: Special Array I | Python Solution 🔥for Coding Interview
🔥 Leetcode 827 - Making A Large Island | Coding Interview Solution with DFS #coding #827
4:28
🔥 Leetcode 827 - Making A Large Island | Coding Interview Solution with DFS #coding #827
Divide Nodes into Maximum Groups | Hard Graph BFS Problem | LeetCode 2493 #coding #programming #2493
3:49
Divide Nodes into Maximum Groups | Hard Graph BFS Problem | LeetCode 2493 #coding #programming #2493
Leetcode 684. Redundant Connection 🔥 | Graph Cycle Detection | Union-Find Explained 🚀 #684
2:35
Leetcode 684. Redundant Connection 🔥 | Graph Cycle Detection | Union-Find Explained 🚀 #684
Leetcode #2658: Maximum Number of Fish in a Grid | Python DFS Solution Explained
2:39
Leetcode #2658: Maximum Number of Fish in a Grid | Python DFS Solution Explained
Course Schedule IV | DFS Solution Explained | LeetCode #1462 #codinginterviews
2:43
Course Schedule IV | DFS Solution Explained | LeetCode #1462 #codinginterviews