Rahul Meena
Rahul Meena @Kaiser_0912 ·
Day 10/100 Today’s progress: • LeetCode POTD: Find All Possible Stable Binary Arrays II Couldn’t solve it on my own again today — had to look at hints and the editorial. #100DaysOfCode #LeetCod
10
BackSpace
BackSpace @like_backspace ·
🚀 Day 48/100 – LeetCode Daily Challenge Completed! 📌 Problem: Find Lucky Integer in an Array ⚙ Runtime: 5 ms 🧠 Memory: 43.69 MB 🔥 Streak: 48 Days Today’s win isn't just a problem solved—it's a mindset strengthened. #100DaysOfCode #LeetoHDC
1
1
127
Yash Hadade
Yash Hadade @yaashh04 ·
DSA – Day 5 ✅ Solved: 'Check if All Characters Have Equal Number of Occurrences' Hashmaps to the rescue! Loving how frequency-based problems build strong logic. Let’s keep going! 💪 #100DaysOfCode #DSA #LeetCod
8
Jatin
Jatin @JatinRohilla_in ·
✅ LeetCode Daily Challenge: Solved 🔹 Problem: Build Array from Permutation 🔹 Intuition: Since nums is a 0-based permutation, we can safely access nums[nums[i]]. 🔹 Approach: Iterate once and construct a new array. 🧠 Complexity Time: O(n) Space: O(n) #LeetCod #Hmt2
1
20
Vagabond
Vagabond @VagabondBushido ·
Struggled with #leetcod 50 Pow(x, n) at first • Looped through n → too slow (O(n)) • Learned about INT_MIN overflow, switched n to long long • Optimized with Exponentiation by Squaring O(log n) Base: n == 0 → 1 Odd: x * myPow(x, n-1) Even: myPow(x*x, n/2) #100daysofcoding
80
prod42net
prod42net @prod42net ·
🔍 Discover how to sum two integers in Python without using the + operator! By leveraging XOR and AND bitwise operations, you can avoid pitfalls with negative numbers. A must-read for developers tackling binary manipulation! 🐍💻 #Python #Coding #LeetCoift.tt/B7ArUHv63t
13
prod42net
prod42net @prod42net ·
📝 Today, Rishitha Nallapureddy tackled four diverse LeetCode problems! By exploring recursion, two-pointer techniques, logical approaches, and stacks, she highlighted how solving one problem can solidify multiple concepts. Let's keep coding! �� #LeetCodift.tt/Uh4Z0L5fV
12