#leetcode75 search results

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 54 of #LeetCode75 — Problem2336: Smallest Number in Infinite Set This one was tricky, learned it with help and understood the logic behind maintaining: A pointer (cur) to the next smallest number A min-heap to store numbers that were added back #Day54 #LeetCode #DSA #CPP

ANNISH_SEN's tweet image. Day 54 of #LeetCode75 — Problem2336: Smallest Number in Infinite Set

This one was tricky, learned it with help and understood the logic behind maintaining:

A pointer (cur) to the next smallest number
A min-heap to store numbers that were added back

#Day54 #LeetCode #DSA #CPP

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 75 of #LeetCode75 Solved 739. Daily Temperatures Using a Monotonic Stack Track index of temperatures in a stack. Whenever we find a warmer day → pop & compute the wait time. Time:O(n) Space:O(n) #Day75 #LeetCode #DSA #Stack #MonotonicStack #CPlusPlus #CodingJourney

ANNISH_SEN's tweet image. Day 75 of #LeetCode75 Solved 739. Daily Temperatures Using a Monotonic Stack
Track index of temperatures in a stack.
Whenever we find a warmer day → pop & compute the wait time.
Time:O(n)
Space:O(n)
#Day75 #LeetCode #DSA #Stack #MonotonicStack #CPlusPlus #CodingJourney

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 74 of #LeetCode75 Learned to Solved 72. Edit Distance Used recursion + memoization to handle: Time: O(n*m) Space: O(n*m)#Day74 #LeetCode #DSA #DynamicProgramming #Recursion #CPlusPlus #CodingJourney #100DaysOfCode

ANNISH_SEN's tweet image. Day 74 of #LeetCode75 Learned to Solved 72. Edit Distance 
Used recursion + memoization to handle:
Time: O(n*m)
 Space: O(n*m)#Day74 #LeetCode #DSA #DynamicProgramming #Recursion #CPlusPlus #CodingJourney #100DaysOfCode
ANNISH_SEN's tweet image. Day 74 of #LeetCode75 Learned to Solved 72. Edit Distance 
Used recursion + memoization to handle:
Time: O(n*m)
 Space: O(n*m)#Day74 #LeetCode #DSA #DynamicProgramming #Recursion #CPlusPlus #CodingJourney #100DaysOfCode

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

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 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 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

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

“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

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

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 105 of #GfG160 Problem: Get Min from Stack @geeksforgeeks #GeekStreak2025 #LeetCode75 Also solved #LeetCode 75 in C++ & JS: 🔸 Product of Array Except Self 🔸 Increasing Triplet Subsequence

xosmoss's tweet image. ✅ Day 105 of #GfG160
Problem: Get Min from Stack
@geeksforgeeks
#GeekStreak2025 #LeetCode75
Also solved #LeetCode 75 in C++ & JS:
🔸 Product of Array Except Self
🔸 Increasing Triplet Subsequence

✅ 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

Understood intuition behind solution after going through solutions submitted by others 🤓 #Leetcode #Leetcode75

the_code_club's tweet image. Understood intuition behind solution after going through solutions submitted by others 🤓
#Leetcode #Leetcode75

Just solved another Leetcode Problem. Leetcode 724 - Find Pivot Index - C++ #Leetcode #LeetcodeSolutions #Leetcode75

the_code_club's tweet image. Just solved another Leetcode Problem.

Leetcode 724 - Find Pivot Index - C++

#Leetcode #LeetcodeSolutions #Leetcode75

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

No results for "#leetcode75"
No results for "#leetcode75"

Day 75 of #LeetCode75 Solved 739. Daily Temperatures Using a Monotonic Stack Track index of temperatures in a stack. Whenever we find a warmer day → pop & compute the wait time. Time:O(n) Space:O(n) #Day75 #LeetCode #DSA #Stack #MonotonicStack #CPlusPlus #CodingJourney

ANNISH_SEN's tweet image. Day 75 of #LeetCode75 Solved 739. Daily Temperatures Using a Monotonic Stack
Track index of temperatures in a stack.
Whenever we find a warmer day → pop & compute the wait time.
Time:O(n)
Space:O(n)
#Day75 #LeetCode #DSA #Stack #MonotonicStack #CPlusPlus #CodingJourney

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 54 of #LeetCode75 — Problem2336: Smallest Number in Infinite Set This one was tricky, learned it with help and understood the logic behind maintaining: A pointer (cur) to the next smallest number A min-heap to store numbers that were added back #Day54 #LeetCode #DSA #CPP

ANNISH_SEN's tweet image. Day 54 of #LeetCode75 — Problem2336: Smallest Number in Infinite Set

This one was tricky, learned it with help and understood the logic behind maintaining:

A pointer (cur) to the next smallest number
A min-heap to store numbers that were added back

#Day54 #LeetCode #DSA #CPP

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 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

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

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 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 74 of #LeetCode75 Learned to Solved 72. Edit Distance Used recursion + memoization to handle: Time: O(n*m) Space: O(n*m)#Day74 #LeetCode #DSA #DynamicProgramming #Recursion #CPlusPlus #CodingJourney #100DaysOfCode

ANNISH_SEN's tweet image. Day 74 of #LeetCode75 Learned to Solved 72. Edit Distance 
Used recursion + memoization to handle:
Time: O(n*m)
 Space: O(n*m)#Day74 #LeetCode #DSA #DynamicProgramming #Recursion #CPlusPlus #CodingJourney #100DaysOfCode
ANNISH_SEN's tweet image. Day 74 of #LeetCode75 Learned to Solved 72. Edit Distance 
Used recursion + memoization to handle:
Time: O(n*m)
 Space: O(n*m)#Day74 #LeetCode #DSA #DynamicProgramming #Recursion #CPlusPlus #CodingJourney #100DaysOfCode

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

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

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

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

Binary Tree - DFS Maximum Depth of Binary Tree #LeetCode75 33/75 #Python #DSA #100DaysOfCode #LeetCode

Priyansh0310's tweet image. Binary Tree - DFS 
Maximum Depth of Binary Tree #LeetCode75      

33/75     

#Python #DSA #100DaysOfCode #LeetCode
Priyansh0310's tweet image. Binary Tree - DFS 
Maximum Depth of Binary Tree #LeetCode75      

33/75     

#Python #DSA #100DaysOfCode #LeetCode

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

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

“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

Loading...

Something went wrong.


Something went wrong.


United States Trends