Search results for #LeetCode100Days
Day 95 of #LeetCode100Days ✨ 📌 Today’s Problems: 🔹 Reverse Pairs 🔹 Maximum Product Subarray ⚡ Practiced merge sort–based counting + handling tricky subarray products 🔥 #LeetCode #DSA #100DaysOfCode #Coding
Day 94 of #LeetCode100Days ✨ 📌 Today’s Problems: 🔹 Longest Consecutive Sequence in an Array 🔹 Rotate Matrix by 90° ⚡ Arrays + Matrix patterns getting sharper 💯 #LeetCode #DSA #100DaysOfCode #Coding
Day 93 of #LeetCode100Days ✨ 📌 Today’s Problems: 🔹 Find Missing Number in an Array 🔹 Maximum Consecutive Ones 🔹 Find the Number that Appears Once (others appear twice) ⚡ Focused on classic array & bit manipulation tricks today! #LeetCode #DSA #100DaysOfCode #PlacementPr
Day 92 of #LeetCode100Days ✨ 📌 Today’s Problems: 🔹 Majority Element 🔹 Set Matrix Zeros ⚡ Brushing up on array & matrix tricks after graph grind! #LeetCode #DSA #100DaysOfCode #PlacementPrep
Day 90 of #LeetCode100Days 🔗⚡ 📌 Today’s Problems: 🌉 Bridges in Graph 🎯 Articulation Point 🔄 Kosaraju's Algorithm (SCCs) 💡 Key graph concepts around connectivity & strongly connected components. #LeetCode #DSA #100DaysOfCode #GraphTheory #PlacementPrep
Day 89 of #LeetCode100Days 🌊🏝️ 📌 Today’s Problems: 🏝️ Making a Large Island – maximize island size with DSU / DFS 🌊 Swim in Rising Water – binary search + BFS / Dijkstra 💡 Both problems push the limits of graph + DSU + shortest path thinking! #LeetCode #DSA #100DaysOfCode
Day 88 of #LeetCode100Days 🏝️📂 📌 Today’s Problems: 📂 Accounts Merge – DSU + string mapping 🏝️ Number of Islands II – dynamic island counting with DSU 💡 DSU once again makes tough connectivity problems much easier to crack! ⚡ #LeetCode #DSA #100DaysOfCode #PlacementPrep
Day 87 of #LeetCode100Days 🌐🪨 📌 Today’s Problems: 🌐 Number of Operations to Make Network Connected – DSU + connected components 🪨 Most Stones Removed with Same Row or Column – treat stones as nodes, remove via DSU/DFS #DSA #100DaysOfCode #LeetCode #PlacementPrep #CodingJourn
Day 86 of #LeetCode100Days 🔗🌉 📌 Today’s Problems: 🔗 Disjoint Set (Union by Size) – efficient union-find operations 🌉 Kruskal’s Algorithm – MST using greedy + DSU 💡 Learning how DSU powers Kruskal’s MST — graphs + greedy + union-find all coming together 🔥 #DSA #100Days
Day 84 of #LeetCode100Days 🌆🔗 📌 Today’s Problems: 🧮 Floyd–Warshall Algorithm – All-pairs shortest paths (DP approach) 🏙️ Find the City With the Smallest Number of Neighbors Within Threshold Distance – direct application of APSP 💡 DP + graph problems are clicking well —
Day 83 of #LeetCode100Days ➗🔄 📌 Today’s Problems: 🔢 Minimum Steps to Reach End – using multiplication + mod operations with array elements 🛠️ Bellman-Ford Algorithm – handle graphs with negative weights gracefully. #DSA #100DaysOfCode #LeetCode #Placement
Day 82 of #LeetCode100Days ⏳🛣️ 📌 Today’s Problems: ⏱️ Network Delay Time – single-source shortest path with Dijkstra 🛤️ Number of Ways to Arrive at Destination – count + shortest paths using DP + Dijkstra #DSA #100DaysOfCode #LeetCode #PlacementPrep #CodingJourney
Day 81 of #LeetCode100Days 🛫⛰️ 📌 Today’s Problems: ⛰️ Path With Minimum Effort – Dijkstra variation on grids 💸 Cheapest Flights Within K Stops – modified BFS / Bellman-Ford style #DSA #100DaysOfCode #LeetCode #PlacementPrep #CodingJourney
Day 80 of #LeetCode100Days 🏃♂️🔀 📌 Today’s Topics & Problems: 🧮 Why Priority Queue is used in Dijkstra’s Algorithm – ensure we always pick the next node with the smallest distance efficiently 🎯 🗺️ Shortest Path in a Binary Maze – BFS for minimum steps in a grid 🏁
Day 79 of #LeetCode100Days 🛣️⚡ 📌 Today’s Problems: 1️⃣ Shortest Path in Undirected Graph (Unit Weights) – BFS magic 🏃♂️ 2️⃣ Shortest Path in DAG – Topological ordering approach 🗺️ 3️⃣ Dijkstra’s Algorithm – Priority queue for weighted graphs #DSA #100DaysOfCode #LeetCode #Placemen
Day 78 of #LeetCode100Days 👽🛡️ 📌 Today’s Problems: 🛡️ Find Eventual Safe States – detect nodes that always lead to terminal nodes (graph DFS) 👽 Alien Dictionary – derive lexicographical order via topological sort 💡 More practice with graph traversal + ordering problems —
Day 77 of #LeetCode100Days 🏫📚 📌 Today’s Problems: 📝 Course Schedule – detect if all courses can be finished (cycle detection) 📦 Course Schedule II – find a valid order (BFS / Kahn’s Algorithm) 💡 Getting comfortable with graph cycles, topological sort & BFS-based schedulin
Day 76 of #LeetCode100Days 🏗️📊 📌 Today’s Problems & Concepts: 📚 Course Schedule II – topological ordering in action 🧭 Topological Sort – DFS-based approach ⚙️ Kahn’s Algorithm – BFS-based topo sort #DSA #100DaysOfCode #LeetCode #PlacementPrep #CodingJourney
Day 75 of #LeetCode100Days 🌴🔗 📌 Today’s Problems: 🏝️ Number of Distinct Islands – DFS (multi-source) 🔵 Bipartite Graph – DFS-based check 💡 Practicing graph traversal patterns, shape encoding for islands, and graph coloring logic — each day makes graphs less scary 😄 #DSA
