#leetcode75 검색 결과

"#leetcode75"에 대한 결과가 없습니다
"#leetcode75"에 대한 결과가 없습니다
"#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 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

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 53 of #LeetCode75 — Problem 215: Kth Largest Element in an Array Used a max-heap (priority queue) to extract the k-th largest efficiently—no sorting needed. T:O(n log n) SC:O(n) #Day53 #LeetCode #DSA #CPP #100DaysOfCode #CodingJourney

ANNISH_SEN's tweet image. Day 53 of #LeetCode75 — Problem 215: Kth Largest Element in an Array

Used a max-heap (priority queue) to extract the k-th largest efficiently—no sorting needed.

T:O(n log n)
 SC:O(n)

#Day53 #LeetCode #DSA #CPP #100DaysOfCode #CodingJourney
ANNISH_SEN's tweet image. Day 53 of #LeetCode75 — Problem 215: Kth Largest Element in an Array

Used a max-heap (priority queue) to extract the k-th largest efficiently—no sorting needed.

T:O(n log n)
 SC:O(n)

#Day53 #LeetCode #DSA #CPP #100DaysOfCode #CodingJourney

These are My last Contests I am improving gradually but still stucked not able to cross q3 mark please provide some advice how to break this barieer . #leetcode75 #programming #coding #learnInPublic

Rishabh38074426's tweet image. These are My last Contests I am improving gradually but still stucked not able to cross q3 mark please provide some advice how to break this barieer .
#leetcode75 #programming #coding #learnInPublic

Day 52 of #LeetCode75 — Problem 547: Number of Provinces Converted the adjacency matrix into an adjacency list and used DFS to count connected components. Each DFS run = one province. TC: O(n²) SC: O(n) #Day52 #LeetCode #DSA #CPP #CodingJourney

ANNISH_SEN's tweet image. Day 52 of #LeetCode75 — Problem 547: Number of Provinces

Converted the adjacency matrix into an adjacency list and used DFS to count connected components.
Each DFS run = one province.
TC: O(n²)
 SC: O(n)

#Day52 #LeetCode #DSA #CPP #CodingJourney
ANNISH_SEN's tweet image. Day 52 of #LeetCode75 — Problem 547: Number of Provinces

Converted the adjacency matrix into an adjacency list and used DFS to count connected components.
Each DFS run = one province.
TC: O(n²)
 SC: O(n)

#Day52 #LeetCode #DSA #CPP #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 56 of #LeetCode75 — Problem 208: Implement Trie (Prefix Tree) Today I implemented a Trie — a tree-based data structure used for fast word insertions, searches & prefix lookups. Key concepts: Node structure with 26 child pointers Recursion for insert/search Dictionary

ANNISH_SEN's tweet image. Day 56 of #LeetCode75 — Problem 208: Implement Trie (Prefix Tree)

Today I implemented a Trie — a tree-based data structure used for fast word insertions, searches & prefix lookups.

Key concepts:
Node structure with 26 child pointers
Recursion for insert/search
 Dictionary

1207. Unique number of Occurrences. Leetcode problem solution using Golang. #Leetcode75 #Golang

the_code_club's tweet image. 1207. Unique number of Occurrences.

Leetcode problem solution using Golang.

#Leetcode75 #Golang

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 #66 Update: - DevOps - Continuing on the Project - LeetCode: Two Coding Problems from Blind 75 #100DaysOfCode #CodinChallenge #leetcode75 #LeetCode #DSA

_Tharun_G's tweet image. Day #66 Update:
- DevOps - Continuing on the Project
- LeetCode: Two Coding Problems from Blind 75
#100DaysOfCode #CodinChallenge #leetcode75 #LeetCode #DSA

Day 58 of #LeetCode75 Worked on Rotting Oranges (BFS) today. I wrote most of the solution myself (~60%), but needed some guidance to fix the BFS logic and boundary handling. #100DaysOfCode #LeetCode #DSA #codingjourney

ANNISH_SEN's tweet image. Day 58 of  #LeetCode75  Worked on Rotting Oranges (BFS) today. I wrote most of the solution myself (~60%), but needed some guidance to fix the BFS logic and boundary handling.  #100DaysOfCode #LeetCode #DSA #codingjourney
ANNISH_SEN's tweet image. Day 58 of  #LeetCode75  Worked on Rotting Oranges (BFS) today. I wrote most of the solution myself (~60%), but needed some guidance to fix the BFS logic and boundary handling.  #100DaysOfCode #LeetCode #DSA #codingjourney
ANNISH_SEN's tweet image. Day 58 of  #LeetCode75  Worked on Rotting Oranges (BFS) today. I wrote most of the solution myself (~60%), but needed some guidance to fix the BFS logic and boundary handling.  #100DaysOfCode #LeetCode #DSA #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 51 of #LeetCode75 — Problem 162: Find Peak Element Used a binary search approach to find a peak in O(log n) time. Compare mid with mid+1 → move toward the side that must contain a peak. TC: O(log n) SC: O(1) #Day51 #LeetCode #DSA #CPP #CodingJourney

ANNISH_SEN's tweet image. Day 51 of #LeetCode75 — Problem 162: Find Peak Element

Used a binary search approach to find a peak in O(log n) time.
Compare mid with mid+1 → move toward the side that must contain a peak.
TC: O(log n)
 SC: O(1)

#Day51 #LeetCode #DSA #CPP #CodingJourney
ANNISH_SEN's tweet image. Day 51 of #LeetCode75 — Problem 162: Find Peak Element

Used a binary search approach to find a peak in O(log n) time.
Compare mid with mid+1 → move toward the side that must contain a peak.
TC: O(log n)
 SC: O(1)

#Day51 #LeetCode #DSA #CPP #CodingJourney

Binary Tree - DFS Leaf-Similar Trees #LeetCode75 34/75 #Python #DSA #100DaysOfCode #LeetCode

Priyansh0310's tweet image. Binary Tree - DFS  
Leaf-Similar Trees #LeetCode75        

34/75       

#Python #DSA #100DaysOfCode #LeetCode
Priyansh0310's tweet image. Binary Tree - DFS  
Leaf-Similar Trees #LeetCode75        

34/75       

#Python #DSA #100DaysOfCode #LeetCode

Linked List Question. Reverse Linked List #LeetCode75 32/75 #Python #DSA #100DaysOfCode #LeetCode

Priyansh0310's tweet image. Linked List Question.    
Reverse Linked List  #LeetCode75     

32/75   

#Python #DSA #100DaysOfCode #LeetCode
Priyansh0310's tweet image. Linked List Question.    
Reverse Linked List  #LeetCode75     

32/75   

#Python #DSA #100DaysOfCode #LeetCode

✅ Day 111 of #GfG160 Solved: Longest String Chain 🔗 @geeksforgeeks #GeekStreak2025 #LeetCode75 Also knocked out LC: 🔢 Unique Number of Occurrences (C++ & JS) #LeetCode #Tech

xosmoss's tweet image. ✅ Day 111 of #GfG160
Solved: Longest String Chain 🔗
@geeksforgeeks
#GeekStreak2025 #LeetCode75
Also knocked out LC:
🔢 Unique Number of Occurrences (C++ & JS)
 #LeetCode  #Tech

Binary Tree - BFS Binary Tree Right Side View #LeetCode75 39/75 #Python #DSA #100DaysOfCode #LeetCode

Priyansh0310's tweet image. Binary Tree - BFS      
Binary Tree Right Side View #LeetCode75                  

39/75                 

#Python #DSA #100DaysOfCode #LeetCode
Priyansh0310's tweet image. Binary Tree - BFS      
Binary Tree Right Side View #LeetCode75                  

39/75                 

#Python #DSA #100DaysOfCode #LeetCode

Loading...

Something went wrong.


Something went wrong.


United States Trends