Welcome to AlgorithmAdventures! This is my personal coding journal where I solve algorithmic challenges on LeetCode and sharpen my problem-solving skills daily.
Join me as I explore different algorithms and techniques to crack challenging problems! 💻✨
🔥 Dynamic Programming ×14
⚔️ Divide and Conquer ×6
🎯 Quickselect ×3
📚 Monotonic Stack ×8
🧩 Union Find ×7
🌀 Monotonic Queue ×3
📈 Topological Sort ×3
🚀 Shortest Path ×3
🗄️ Hash Table ×56
➗ Math ×30
🔍 Binary Search ×27
🌊 Breadth-First Search (BFS) ×19
🎯 Sliding Window ×16
💡 Bit Manipulation ×15
⚡ Greedy ×14
🌲 Depth-First Search (DFS) ×14
🧩 Array ×140
📜 String ×70
🏃♂️🏃♀️ Two Pointers ×37
📊 Sorting ×28
🧮 Matrix ×21
🔗 Linked List ×18
🥞 Stack ×17
🎮 Simulation ×15
Every day, I pick a new problem from LeetCode, solve it, and commit the solution here.
This is part of my commitment to improving my algorithmic thinking and coding proficiency, while also maintaining a streak of consistent progress.
- Each folder is named after the problem solved for that day.
- Inside each folder, you'll find:
- 📝 Code Solution
- 💡 Problem Explanation (in some cases)
- ✅ Test Cases
Feel free to explore the repository and see how I approach various problems.
Let's learn together and continue to grow as problem-solvers! 🌟
- 1652. Defuse the Bomb → 🕑 O(n*k)
- 1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence → 🕑 O(N)
- 3151. Special Array I → 🕑 O(N)
- 2558. Take Gifts From the Richest Pile → 🕑 O(N)
- 1752. Check if Array Is Sorted and Rotated → 🕑 O(N)
- 3105. Longest Strictly Increasing or Strictly Decreasing Subarray → 🕑 O(N)
- 1800. Maximum Ascending Subarray Sum → 🕑 O(N)
- 1790. Check if One String Swap Can Make Strings Equal → 🕑 O(N)
- 3174. Clear Digits → 🕑 O(N)
- 2460. Apply Operations to an Array → 🕑 O(N)
- 2570. Merge Two 2D Arrays by Summing Values → 🕑 O(N)
- 2379. Minimum Recolors to Get K Consecutive Black Blocks → 🕑 O(N)
- 2914. Minimum Number of Changes to Make Binary String Beautiful → 🕑 O(n)
- 3011. Find if Array Can Be Sorted → 🕑 O(n²)
- 2275. Largest Combination With Bitwise AND Greater Than Zero → 🕑 O(n)
- 1829. Maximum XOR for Each Query → 🕑 O(n)
- 3133. Minimum Array End → 🕑 O(n * 2^b)
- 3097. Shortest Subarray With OR at Least K II → 🕑 O(n)
- 2601. Prime Subtraction Operation → 🕑 O(n * m * sqrt(m))
- 2563. Count the Number of Fair Pairs → Brute force & Optimized
- 2257. Count Unguarded Cells in the Grid → 🕑 O(k * (m+n))
- 2516. Take K of Each Character From Left and Right → 🕑 O(n)
- 1861. Rotating the Box → 🕑 O(n*m)
- 438. Find All Anagrams in a String → 🕑 O(N)
- 54. Spiral Matrix → 🕑 O(N*M)
- 2109. Adding Spaces to a String → 🕑 O(N)
- 2981. Find Longest Special Substring That Occurs Thrice I → 🕑 O(N²)
- 2779. Maximum Beauty of an Array After Applying Operation → 🕑 O(N log N)
- 1726. Tuple with Same Product → 🕑 O(N²)
- 3160. Find the Number of Distinct Colors Among the Balls → 🕑 O(N)
- 2349. Design a Number Container System → 🕑 O(1)
- 2364. Count Number of Bad Pairs → 🕑 O(N)
- 1910. Remove All Occurrences of a Substring → 🕑 O(N)
- 2342. Max Sum of a Pair With Equal Sum of Digits → Brute Force Approach
- 2342. Max Sum of a Pair With Equal Sum of Digits → 🕑 O(N)
- 3066. Minimum Operations to Exceed Threshold Value II → 🕑 O(N Log(N))
- 1352. Product of the Last K Numbers → 🕑 O(1)
- 2698. Find the Punishment Number of an Integer → 🕑 O(N(log(N)))
- 1415. The k-th Lexicographical String of All Happy Strings of Length n → 🕑O(n*2^n)
- 1980. Find Unique Binary String → 🕑 O(2^n)
- 3208. Alternating Groups II → 🕑 O(N)
- 2206. Divide Array Into Equal Pairs → 🕑 O(N)
- ✅ TCS CodeVita PYQ: Rotate String and Anagram
- ✅ TCS CodeVita PYQ: SamBrideHunt
- ✅ TCS Chakravyuha Matrix Traversal