#leetcodehard risultati di ricerca

Chandan Kumar

23 ago 2022

Happiness is this🥳 @LeetCode #leetcodeHard

We maintain a deque of decreasing elements. When a new element is greater than the back of the deque, we pop elements from the back until we find the correct position to insert the new element. #dsa #leetcodehard

TejasMundhe17's tweet image. We maintain a deque of decreasing elements. When a new element is greater than the back of the deque, we pop elements from the back until we find the correct position to insert the new element. #dsa #leetcodehard

Subhankar👽

@devnshankar

9 lug 2023

Whenever I think about skipping a day this comes to my mind 😂 #leetcode #LeetCodeHard #CompetitiveProgramming #CP #CodingInterview #FAANG #Tech #consistency #programming

devnshankar's tweet image. Whenever I think about skipping a day this comes to my mind 😂

#leetcode #LeetCodeHard #CompetitiveProgramming #CP #CodingInterview #FAANG #Tech #consistency #programming

Vantage

@the_vantage_

18 lug

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

Himanshu Trivedi

@Himanshu_tb

7 set

🚀 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

Sayantan Banerjee

@bijansayantan

20 lug

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 —&gt; feels normal.
Just merged arrays, sorted them, and gave it a final touch with a little median formula.

#100DaysOfCode #LeetCodeHard #BuildingInPublic

THE CODE CLUB

@the_code_club

19 apr

After going through some YouTube videos multiple times, I was able to come up with a solution which is intuitive. Leetcode 84: Largest rectangle in histogram - Solution in Golang. #LeetcodeHard #Golang #DSA

the_code_club's tweet image. After going through some YouTube videos multiple times, I was able to come up with a solution which is intuitive.

Leetcode 84: Largest rectangle in histogram - Solution in Golang.

#LeetcodeHard #Golang #DSA

Himanshu Trivedi

@Himanshu_tb

4 set

🚀 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

Himanshu Trivedi

@Himanshu_tb

6 set

🚀 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

hackpoint

@hackp0int1980

31 lug

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

Sanjay (eNinja-in)

@eninjain

26 set

📝 #76 Minimum Window Substring Find the smallest substring in s containing all chars of t. Use sliding window + char count array, expand right, shrink left to minimize. Ex: s='ADOBECODEBANC', t='ABC' → 'BANC' O(n+m) time, O(128) space #SlidingWindow #LeetCodeHard

eninjain's tweet image. 📝 #76 Minimum Window Substring
Find the smallest substring in s containing all chars of t. Use sliding window + char count array, expand right, shrink left to minimize.
Ex: s='ADOBECODEBANC', t='ABC' → 'BANC'
O(n+m) time, O(128) space #SlidingWindow #LeetCodeHard

Sanjay (eNinja-in)

@eninjain

2 set

🔢 #65 Valid Number Check if a string is a valid number: int, decimal, or scientific (e/E), with optional +/-. Ex: "0"✅ "0.1"✅ "abc"❌ "1e10"✅ "e3"❌ 💡 Trim spaces, handle sign, split num & exponent, validate parts. ⏱ O(n), 🗂 O(1). #StringParsing #LeetCodeHard

eninjain's tweet image. 🔢 #65 Valid Number
Check if a string is a valid number: int, decimal, or scientific (e/E), with optional +/-.
Ex: "0"✅ "0.1"✅ "abc"❌ "1e10"✅ "e3"❌
💡 Trim spaces, handle sign, split num &amp; exponent, validate parts.
⏱ O(n), 🗂 O(1).
#StringParsing #LeetCodeHard

Satyajit Redekar

@SatyajitRedekar

8 lug

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

eshaan.eth

@DabasiyaEshaan

22 ago 2022

I feel leetcode hard questions are not hard its just that the test cases are heavier and resource consuming. so coming up with a brute force approach does not work in most cases. They need efficient algorithms #leetcode #leetcodehard #DSA #100DaysOfCode #Java

DabasiyaEshaan's tweet image. I feel leetcode hard questions are not hard its just that the test cases are heavier and resource consuming. so coming up with a brute force approach does not work in most cases. They need efficient algorithms

#leetcode #leetcodehard #DSA #100DaysOfCode #Java

Sanjay (eNinja-in)

@eninjain

31 lug

🔢 #52 N-Queens II How many ways can you place 👑 N queens on an NxN ♟️ board with no attacks? 💡 Use backtracking + smart pruning (no board needed!) ✅ Track cols & diagonals 🧠 Time: O(n!) | Space: O(n) #NQueens #LeetCodeHard #RecursiveDFS #ChessLogic #CodeSmart

eninjain's tweet image. 🔢 #52 N-Queens II
How many ways can you place 👑 N queens on an NxN ♟️ board with no attacks?
💡 Use backtracking + smart pruning (no board needed!)
✅ Track cols &amp; diagonals
🧠 Time: O(n!) | Space: O(n)
#NQueens #LeetCodeHard #RecursiveDFS #ChessLogic #CodeSmart

Sanjay (eNinja-in)

@eninjain

4 ago

🔢 #60 Permutation Sequence Given n & k, find the k-th lexicographic permutation of numbers 1 to n! 🔁 💡 Use math + logic: total perms = n!, pick digits by (k-1)/block, remove used, repeat! ⏱ O(n²) time #GreedyMath #LeetCodeHard #PermutationGame

eninjain's tweet image. 🔢 #60 Permutation Sequence
Given n &amp; k, find the k-th lexicographic permutation of numbers 1 to n! 🔁
💡 Use math + logic: total perms = n!, pick digits by (k-1)/block, remove used, repeat!
⏱ O(n²) time
#GreedyMath #LeetCodeHard #PermutationGame

Sanjay (eNinja-in)

@eninjain

30 lug

🔢 #51 N-Queens: Place n queens on an n×n board so none attack each other (no same row, column, or diagonal). 💡 Use backtracking: place row by row, skip unsafe spots, backtrack if stuck. ⏱ Time: O(n!), 📦 Space: O(n) #NQueens #Backtracking #LeetCodeHard ♟️