Day 100 of #100DaysOfDSA 🎯 Continued with recursion and practised a backtracking problem 1️⃣ LC 46 : Permutations Tried two approaches: 1. Frequency Array 2. Swapping Technique Recursion + Backtracking = Magic Feeling great to hit 100 days! 🚀 #DSA #LeetCode #CodingJourney

90% backend devs are afraid of this mf 90% backend devs are afraid of this mf 90% backend devs are afraid of this mf 90% backend devs are afraid of this mf 90% backend devs are afraid of this mf

Just A Reminder 💪

Wtf is this 🥲 Wtf is this 🥲 Wtf is this 🥲

Can we reach 250 , before 10 nov 🤔 If you are in tech, lets #CONNECT

🗓️ Day 99 of #100DaysOfDSA Practiced a backtracking problem: 1️⃣ LeetCode 77 : Combinations Generate all combinations of k numbers from 1 to n , a classic recursion example! It helped me grasp how backtracking efficiently makes and undoes choices. 💡 #DSA #Backtracking

Mujhe bhe apne saath kaam pe rakhlo 🥲 @striver_79

🗓️ Day 98 of #100DaysOfDSA Continued my Recursion journey and solved 2 LinkedList problems : 1️⃣ LC 203 – Remove Linked List Elements Time: O(n) Space : O(n) (recursive stack) 2️⃣ LC 21 – Merge Two Sorted Lists Time: O(n + m) Space: O(n + m) (recursive stack) #DSA #Recursion

My mid sems are in 2 weeks ... And I haven't started preparing 🥲 Am I cooked ?? Or I'm gonna cook the exam 😈😏

#5 Do you know ? You can reopen your last closed browser tabs using: > Ctrl + Shift + T Works on every modern browsers like Chrome, Edge , Brave, etc Truly a life saver for every dev 😇

Backend is intresting 👨‍💻 Backend is intresting 👨‍💻 Backend is intresting 👨‍💻 Backend is intresting 👨‍💻 Backend is intresting 👨‍💻 Backend is intresting 👨‍💻 Backend is intresting 👨‍💻

🗓️ Day 97 of #100DaysOfDSA I restarted my Recursion journey from scratch to fully understand it. Today, I revised: 1️⃣ Basics of Recursion 2️⃣ Parameterized & Functional Recursion 3️⃣ Multiple Recursive Calls Practiced foundational problems to build confidence in recursion. #DSA

Frontend Errors = 🤡 Backend Errors = ☠️

🗓️ Day 96 of #100DaysOfDSA Explored LeetCode 50 – Pow(x, n) Instead of using C++ STL’s pow(), I learned the optimized approach using - Binary Exponentiation. Simple, elegant & super-efficient! Time: O(log₂n) Space: O(1) #DSA #LeetCode #ProblemSolving #Learning