لا توجد نتائج لـ "#leetcodehard"

🚀 Day 9 of #100DaysOfLeetCodeHard 📌 Problem: 3677. Count Binary Palindromic Numbers ✨ Since n ≤ 1e15 ⇒ binary length ≤ 50, brute-force DFS works fine. ⚡ Passed with “better than 0% runtime” 🤣 . still counts ✅ #LeetCodeHard #100DaysChallenge #DSA #CompetitiveProgramming

Himanshu_tb's tweet image. 🚀 Day 9 of #100DaysOfLeetCodeHard
📌 Problem: 3677. Count Binary Palindromic Numbers
✨ Since n ≤ 1e15 ⇒ binary length ≤ 50, brute-force DFS works fine.
⚡ Passed with “better than 0% runtime” 🤣 . still counts ✅
#LeetCodeHard #100DaysChallenge #DSA #CompetitiveProgramming

🚀 Day 8 of #100DaysOfLeetCodeHard 📌 Problem: 3495. Minimum Operations to Make Array Elements Zero ✨ Pure observation + pattern finding problem — no fancy DS/algorithms, just careful math to crack it! #LeetCodeHard #100DaysChallenge #DSA #CompetitiveProgramming

Himanshu_tb's tweet image. 🚀 Day 8 of #100DaysOfLeetCodeHard
📌 Problem: 3495. Minimum Operations to Make Array Elements Zero
✨ Pure observation + pattern finding problem — no fancy DS/algorithms, just careful math to crack it!

#LeetCodeHard #100DaysChallenge #DSA #CompetitiveProgramming

🚀 Day 7 of #100DaysOfLeetCodeHard 📌 Problem: 952. Largest Component Size by Common Factor ✨ One of the coolest DSU problems I’ve solved so far! ⏱ TC: ~O(n · log(maxA)) with DSU + factorization #LeetCodeHard #100DaysChallenge #DSA #CompetitiveProgramming

Himanshu_tb's tweet image. 🚀 Day 7 of #100DaysOfLeetCodeHard

📌 Problem: 952. Largest Component Size by Common Factor

✨ One of the coolest DSU problems I’ve solved so far!

⏱ TC: ~O(n · log(maxA)) with DSU + factorization

#LeetCodeHard #100DaysChallenge #DSA #CompetitiveProgramming

🚀 LeetCode 987 - Vertical Order Traversal ✔️ Built tree from inorder and preorder ✔️ Nailed vertical grouping with row and value sort ✔️ Solved range query problems Feeling sharper with every node 💪 #LeetCodeHard #BinaryTree #DSAinJava #CodingJourney #100DaysOfCode


Task: “Sum of Prefix Scores of Strings” Me: “Oh cool, sounds like a sliding window or hashmap thing.” Problem: “Nope. It’s TRIE time 😈.” #LeetcodeHard #DSA #CodingInterview #DevHumor #TechLife #SystemDesign #CSharp #CleanCode #CodingMeme #Blind75 #GoogleInterview #MetaInterview

hackp0int1980's tweet image. Task: “Sum of Prefix Scores of Strings”
Me: “Oh cool, sounds like a sliding window or hashmap thing.”
Problem: “Nope. It’s TRIE time 😈.”
#LeetcodeHard #DSA #CodingInterview #DevHumor #TechLife #SystemDesign #CSharp #CleanCode #CodingMeme #Blind75 #GoogleInterview #MetaInterview

Started Graphs in #DSA 📊 (basics, matrix & list), solved Maximal Rectangle from #LeetCodeHard 💪 (stack), and worked on basic #HTML projects—great for tag fundamentals! #100DaysOfCode #Coding #WebDev #CodeNewbie #Frontend #DevLife #DSAChallenge #BuildInPublic #GraphTheory


Day 04: Grinded some hard LeetCode today. Tackled Median of Two Sorted Arrays —> feels normal. Just merged arrays, sorted them, and gave it a final touch with a little median formula. #100DaysOfCode #LeetCodeHard #BuildingInPublic

bijansayantan's tweet image. Day 04: Grinded some hard LeetCode today.
Tackled Median of Two Sorted Arrays —> feels normal.
Just merged arrays, sorted them, and gave it a final touch with a little median formula.  

#100DaysOfCode #LeetCodeHard #BuildingInPublic

Max on the left, Min on the right Heaps keep it lean like code in flight Store running sums, no brute in sight Slide through the middle with logic tight Balance the halves, get that diff just right #DevLife #DSA #leetcodehard

the_vantage_'s tweet image. Max on the left, Min on the right
Heaps keep it lean like code in flight
Store running sums, no brute in sight
Slide through the middle with logic tight
Balance the halves, get that diff just right

#DevLife  #DSA #leetcodehard

day 23 of #100DaysOfCode Solved LeetCode 1751: Max Events You Can Attend II 🧠🎯 Used DP + Binary Search to find the optimal combination of non-overlapping events with max value. Efficient O(n·k·log n) solution! #LeetCodeHard #DynamicProgramming #Python #CodingChallenge

SatyajitRedekar's tweet image. day 23 of #100DaysOfCode 
Solved LeetCode 1751: Max Events You Can Attend II 🧠🎯
Used DP + Binary Search to find the optimal combination of non-overlapping events with max value.
Efficient O(n·k·log n) solution!
#LeetCodeHard #DynamicProgramming #Python #CodingChallenge

لا توجد نتائج لـ "#leetcodehard"
لا توجد نتائج لـ "#leetcodehard"
Loading...

Something went wrong.


Something went wrong.


United States Trends