✅Solved Rotten Oranges 🍊 (Leetcode).👨‍💻 Approach:. ♦️Use BFS from all initially rotten oranges.♦️Track time with levels in BFS.♦️Fresh oranges rot if adjacent to rotten ones (up, down, left, right).♦️Return time taken if all oranges rot, else -1. #LeetCode #DSA #BFS

📗One to Many relationship in DBMS. #DBMS

Join millions who have switched to Grok.

✅Solved Insert Interval on LeetCode .#LeetCode #DSA #100DaysOfCode #Blind75 #Java

✅ Leetcode: Minimum Bit Flips to Convert Number.💡 Approach:.Use XOR to find differing bits and count the 1s. 🧠 XOR highlights bit positions that differ (1s), and __builtin_popcount counts them. Quick and optimal! ⚡.#Leetcode #BitManipulation #100DaysOfCode

Hey @X alogorithm👋.I’m looking to #CONNECT with folks interested in: .🧑‍💻 JavaScript .🔯React.🌐 Full Stack Dev .🎨 Frontend .🚀 Backend . 🧠DSA.💻 Leetcode.✅ Software Development .☕️ Java .Let’s grow, share, and #LearnInPublic together!. #letsconnect.

📗 Studying Keys in DBMS today !. #DBMS #Learning

✅ Solved Merge Intervals from LeetCode today!.🧠 Approach:.Sort intervals based on start time. Initialize result with the first interval. For each interval:.If it overlaps with the last one in result, merge them. Else, add it to result as is. Efficient & clean 🚀🚀.#LeetCode

🚀 Just hit a 50-day streak on LeetCode!.Consistency > Motivation 🔁.Every day, one step closer to mastering DSA and cracking those tech interviews. Next stop: 100 days 🔥.#LeetCode #100DaysOfCode #DSA #CodingStreak #TechTwitter

Back again to grind DSA after Fever🚀🚀.

✅ Solved "Word Break" (LeetCode - Blind 75). 🧠Approach: Trie + Memoization (HashMap).Built a Trie from the word dictionary for fast prefix lookup. Used DFS + Memoization to avoid recomputation.⚡ Faster than standard DP in some cases due to pruning redundant paths. #LeetCode

Which course are you currently pursuing and what year are you in?👇 Let’s connect!.

Let's connect. .

Let's watch #SpecialOps2 .#jiohotstar

🚀 Today I solved 2 questions from #Blind75 on LeetCode .✅ Longest Palindromic Substring.✅ Container With Most Water.🧠 Approach:.📌 Palindromic Substring: Expand Around Center (O(n²)).📌 Container With Most Water: Two Pointer Technique (O(n)).Grinding daily !. #LeetCode #DSA

Hey @X alogorithm👋.I’m looking to #CONNECT with folks interested in: .🧑‍💻 JavaScript .🔯React.🌐 Full Stack Dev .🎨 Frontend .🚀 Backend . 🧠DSA.💻 Leetcode.✅ Software Development .☕️ Java .Let’s grow, share, and #LearnInPublic together!. #letsconnect.

🚀Daily DSA Grind 💻 .✅Longest Substring Without Repeating Characters. Approach: Sliding Window + HashMap to track characters and dynamically adjust window size. ✅Longest Palindromic Substring. Approach: Expand Around Center to check palindromes from every index. #LeetCode

🔁 DSA Daily Update – Blind 75. ✅ Two Sum (HashMap).✅ Longest Consecutive Sequence (HashSet).⚡ Time Complexity: O(n).💡 Concepts: Hashing, Optimization. #DSA #Blind75 #LeetCodeHindi #100DaysOfCode #Java #TechTwitter #LeetCode

✅Today, I tackled the Course Schedule problem on LeetCode.📌 Approach Used: Topological Sort using BFS (Kahn’s Algorithm).🚀 Every such problem reinforces my understanding of graph algorithms and boosts my DSA prep!.#LeetCode #DSA #BFS #CodingJourney #100DaysOfCode #Tech

🚀 Solved "Bottom View of Binary Tree" on @geeksforgeeks!.👨‍💻Another day Another Question!.🧠 Approach: BFS + Horizontal Distance Tracking.#geeksforgeeks #DSA #java #binarytree

RT @geeksforgeeks: JAVA is now 30 years old. What is your best memory with it?.