Không có kết quả nào cho "#leetcode75"

Day 73 of #LeetCode75 452. Minimum Number of Arrows to Burst Balloons Key idea: Shoot one arrow for all overlapping intervals by minimizing the end range. Time: O(n log n) Space: O(1) #Day73 #LeetCode #DSA #GreedyAlgorithm #Intervals #CPlusPlus #CodingJourney #100DaysOfCode

ANNISH_SEN's tweet image. Day 73 of #LeetCode75 

452. Minimum Number of Arrows to Burst Balloons
Key idea:
Shoot one arrow for all overlapping intervals by minimizing the end range.

Time: O(n log n)
 Space: O(1)
#Day73 #LeetCode #DSA #GreedyAlgorithm #Intervals #CPlusPlus #CodingJourney #100DaysOfCode
ANNISH_SEN's tweet image. Day 73 of #LeetCode75 

452. Minimum Number of Arrows to Burst Balloons
Key idea:
Shoot one arrow for all overlapping intervals by minimizing the end range.

Time: O(n log n)
 Space: O(1)
#Day73 #LeetCode #DSA #GreedyAlgorithm #Intervals #CPlusPlus #CodingJourney #100DaysOfCode

Day 72 of #LeetCode75 – Non-overlapping Intervals (Greedy + Sorting) Sort by end time Count non-overlapping intervals Remove the rest Time:O(nlog n) Space:O(1) #LeetCode #100DaysOfCode #DSA #CPlusPlus #CodingJourney

ANNISH_SEN's tweet image. Day 72 of #LeetCode75 – Non-overlapping Intervals (Greedy + Sorting)
Sort by end time
Count non-overlapping intervals
Remove the rest
Time:O(nlog n)
 Space:O(1)
#LeetCode #100DaysOfCode #DSA #CPlusPlus #CodingJourney
ANNISH_SEN's tweet image. Day 72 of #LeetCode75 – Non-overlapping Intervals (Greedy + Sorting)
Sort by end time
Count non-overlapping intervals
Remove the rest
Time:O(nlog n)
 Space:O(1)
#LeetCode #100DaysOfCode #DSA #CPlusPlus #CodingJourney
ANNISH_SEN's tweet image. Day 72 of #LeetCode75 – Non-overlapping Intervals (Greedy + Sorting)
Sort by end time
Count non-overlapping intervals
Remove the rest
Time:O(nlog n)
 Space:O(1)
#LeetCode #100DaysOfCode #DSA #CPlusPlus #CodingJourney

Day 71 of #LeetCode75 Solved Problem 2235 – Add Two Integers. A simple one today Time Complexity:O(max (m,n)) Space Complexity: O(1) #LeetCode #DSA #100DaysOfCode #CodingJourney

ANNISH_SEN's tweet image. Day 71 of #LeetCode75
Solved Problem 2235 – Add Two Integers.
A simple one today 
Time Complexity:O(max (m,n)) 
Space Complexity: O(1)
#LeetCode #DSA #100DaysOfCode #CodingJourney

Day 70 of #LeetCode75 Today’s problem was really tough for me — Evaluate Division. Tried multiple times, got stuck, got frustrated… But didn’t give up. I understood and solved it with the help of YouTube Not my cleanest day, but definitely a learning day. Progress is progress.

ANNISH_SEN's tweet image. Day 70 of #LeetCode75 Today’s problem was really tough for me — Evaluate Division. Tried multiple times, got stuck, got frustrated… But didn’t give up.  I understood and solved it with the help of YouTube Not my cleanest day, but definitely a learning day. Progress is progress.
ANNISH_SEN's tweet image. Day 70 of #LeetCode75 Today’s problem was really tough for me — Evaluate Division. Tried multiple times, got stuck, got frustrated… But didn’t give up.  I understood and solved it with the help of YouTube Not my cleanest day, but definitely a learning day. Progress is progress.

Day 69 of #LeetCode75 – Problem 790 (Domino & Tromino Tiling) Today learned the DP + recurrence relation approach. Interesting formula: T(n) = 2·T(n-1) + T(n-3) Slowly understanding these DP patterns. #DSA #DynamicProgramming #100DaysOfCode #CodingJourney

ANNISH_SEN's tweet image. Day 69 of #LeetCode75 – Problem 790 (Domino & Tromino Tiling)
Today  learned the DP + recurrence relation approach.
Interesting formula:
T(n) = 2·T(n-1) + T(n-3)
Slowly understanding these DP patterns. 
#DSA #DynamicProgramming #100DaysOfCode #CodingJourney

Day 68 of #LeetCode75 – Problem 649: Dota2 Senate Didn’t solve this one on my own today. I explored the queue-based solution to understand how the banning simulation works. Not my solution, but definitely my learning. #LeetCode #DSA #CodingJourney #100DaysOfCode #CPlusPlus

ANNISH_SEN's tweet image. Day 68 of #LeetCode75 – Problem 649: Dota2 Senate 

Didn’t solve this one on my own today.
I explored the queue-based solution to understand how the banning simulation works.
Not my solution, but definitely my learning. 
#LeetCode #DSA #CodingJourney #100DaysOfCode #CPlusPlus

🔥 Problem of the Day: Merge String Alternately Approach: Language: C++ Difficulty: Easy ✅ Passed all testcases #DSA #LeetCode75

SunnyKumar51305's tweet image. 🔥 Problem of the Day:  Merge String Alternately
Approach:  
Language: C++
Difficulty: Easy
✅ Passed all testcases
#DSA #LeetCode75

🔥 Problem of the Day: Simplify Path Approach: Language: C++ Difficulty: Easy ✅ Passed all testcases #DSA #LeetCode75

SunnyKumar51305's tweet image. 🔥 Problem of the Day:  Simplify Path
Approach:  
Language: C++
Difficulty: Easy
✅ Passed all testcases
#DSA #LeetCode75
SunnyKumar51305's tweet image. 🔥 Problem of the Day:  Simplify Path
Approach:  
Language: C++
Difficulty: Easy
✅ Passed all testcases
#DSA #LeetCode75

🔥 Problem of the Day: Find The Middle Index In Array Approach: Language: C++ Difficulty: Easy ✅ Passed all testcases #DSA #LeetCode75

SunnyKumar51305's tweet image. 🔥 Problem of the Day:  Find The Middle Index In Array 
Approach:  
Language: C++
Difficulty: Easy
✅ Passed all testcases
#DSA #LeetCode75

“Today’s LeetCode Blind 75: Container With Most Water. Funny how the whole problem collapses once you realize one thing: Move. The. Shorter. Side. Most of y’all fighting O(n²) demons while I’m out here cruising with two pointers.” #Leetcode #leetcode75

ChibuikemLucas's tweet image. “Today’s LeetCode Blind 75: Container With Most Water.
Funny how the whole problem collapses once you realize one thing:
Move. The. Shorter. Side.

Most of y’all fighting O(n²) demons while I’m out here cruising with two pointers.”

#Leetcode #leetcode75
ChibuikemLucas's tweet image. “Today’s LeetCode Blind 75: Container With Most Water.
Funny how the whole problem collapses once you realize one thing:
Move. The. Shorter. Side.

Most of y’all fighting O(n²) demons while I’m out here cruising with two pointers.”

#Leetcode #leetcode75

🔥 Problem of the Day: Find Pivot Index Approach: Language: C++ Difficulty: Easy ✅ Passed all testcases #DSA #LeetCode75

SunnyKumar51305's tweet image. 🔥 Problem of the Day:  Find Pivot Index
Approach:  
Language: C++
Difficulty: Easy
✅ Passed all testcases
#DSA #LeetCode75

🔥 Problem of the Day: Find The Highest Altitude Approach: Language: C++ Difficulty: Easy ✅ Passed all testcases #DSA #LeetCode75

SunnyKumar51305's tweet image. 🔥 Problem of the Day:  Find The Highest Altitude 
Approach:  
Language: C++
Difficulty: Easy
✅ Passed all testcases
#DSA #LeetCode75

🔥 Problem of the Day: Longest Subarray of 1's After Deleting One Element Approach: Language: C++ Difficulty: Medium ✅ Passed all testcases #DSA #LeetCode75

SunnyKumar51305's tweet image. 🔥 Problem of the Day:  Longest Subarray of 1's After Deleting One Element 
Approach:  
Language: C++
Difficulty: Medium 
✅ Passed all testcases
#DSA #LeetCode75

🔥 Problem of the Day: Max Consecutive Ones 3 Approach: Language: C++ Difficulty: Medium ✅ Passed all testcases #DSA #LeetCode75

SunnyKumar51305's tweet image. 🔥 Problem of the Day:  Max Consecutive Ones 3
Approach:  
Language: C++
Difficulty: Medium 
✅ Passed all testcases
#DSA #LeetCode75

🔥 Problem of the Day: Decode String Approach: Language: C++ Difficulty: Medium ✅ Passed all testcases #DSA #LeetCode75

SunnyKumar51305's tweet image. 🔥 Problem of the Day:  Decode String 
Approach:  
Language: C++
Difficulty: Medium 
✅ Passed all testcases
#DSA #LeetCode75

Day 66 of #LeetCode75 — Problem 55 (Jump Game). Solved with recursion + memoization: try all jumps from each index and cache results. Time O(n²), Space O(n). Getting better at DP — one problem at a time. #100DaysOfCode #DSA #CPlusPlus #CodingJourney p

ANNISH_SEN's tweet image. Day 66 of #LeetCode75 — Problem 55 (Jump Game).
Solved with recursion + memoization: try all jumps from each index and cache results. Time O(n²), Space O(n).
Getting better at DP — one problem at a time.
#100DaysOfCode #DSA #CPlusPlus #CodingJourney p

🔥 Problem of the Day: Evaluate Reverse Polish Notation Approach: Language: C++ Difficulty: Medium ✅ Passed all testcases #DSA #LeetCode75

SunnyKumar51305's tweet image. 🔥 Problem of the Day:  Evaluate Reverse Polish Notation 
Approach:  
Language: C++
Difficulty: Medium 
✅ Passed all testcases
#DSA #LeetCode75

Day 65 of #LeetCode75 – Problem 62 (Unique Paths) Solved Unique Paths using Recursion + Memoization (Top-Down DP) Complexity: Time: O(m × n) Space: O(m × n) #Day64 #LeetCode #DSA #DynamicProgramming #CPlusPlus #100DaysOfCode #CodingJourney

ANNISH_SEN's tweet image. Day 65 of #LeetCode75 – Problem 62 (Unique Paths)

Solved Unique Paths using Recursion + Memoization (Top-Down DP)

Complexity:
Time: O(m × n)
Space: O(m × n)
#Day64 #LeetCode #DSA #DynamicProgramming #CPlusPlus #100DaysOfCode #CodingJourney

🔥 Problem of the Day: Determine if Two String Are Closed Approach: Language: C++ Difficulty: Medium ✅ Passed all testcases #DSA #LeetCode75

SunnyKumar51305's tweet image. 🔥 Problem of the Day:  Determine if Two String Are Closed 
Approach:  
Language: C++
Difficulty: Medium 
✅ Passed all testcases
#DSA #LeetCode75

Day 64 of #LeetCode75 – Problem #1143 (Longest Common Subsequence) Solved using memoized recursion (Top-Down DP) to efficiently compute LCS between two strings. Complexity: Time: O(n × m) Space: O(n × m) #Day64 #LeetCode #DSA #DynamicProgramming #CPlusPlus #CodingJourney

ANNISH_SEN's tweet image. Day 64 of #LeetCode75 – Problem #1143 (Longest Common Subsequence)

Solved using memoized recursion (Top-Down DP) to efficiently compute LCS between two strings.

Complexity:
Time: O(n × m)
Space: O(n × m)
#Day64 #LeetCode #DSA #DynamicProgramming #CPlusPlus #CodingJourney

Không có kết quả nào cho "#leetcode75"
Không có kết quả nào cho "#leetcode75"
Loading...

Something went wrong.


Something went wrong.


United States Trends