繁體中文
English Indonesia Türkçe Deutsch Español Português Pусский Français Italiano Nederlands Polski العربية ไทย Tiếng Việt 繁體中文 简体中文 日本語 한국어

#monotonicstack 搜尋結果

udevstack's profile picture.
udevstack
 @udevstack
年11月7日

Solved the Stock Span Problem using a Monotonic Decreasing Stack 💪. Efficiently computed spans in O(n) by storing indices instead of values! 📈🔥 #DSA #Stack #MonotonicStack #CodingJourney @harshbhaiyaa @ankurdotio @sheryians_

udevstack's tweet image. Solved the Stock Span Problem using a Monotonic Decreasing Stack 💪. Efficiently computed spans in O(n) by storing indices instead of values! 📈🔥 #DSA #Stack #MonotonicStack #CodingJourney @harshbhaiyaa @ankurdotio @sheryians_
0
0
2
0
41
ajeetkrup401's profile picture. Gen AI Engineer | Learning and building | 1% better every day
Ajeet Kumar Upadhyay
 @ajeetkrup401
年8月4日

Solved Next Greater Element I using a 🔁 monotonic decreasing stack! Preprocessed nums2 in O(n), mapped next greater, and answered nums1 in O(1) lookups. From brute to beauty. 😎 #JavaScript #LeetCode #MonotonicStack #DSA #100DaysOfCode

ajeetkrup401's tweet image. Solved Next Greater Element I using a 🔁 monotonic decreasing stack! Preprocessed nums2 in O(n), mapped next greater, and answered nums1 in O(1) lookups. From brute to beauty. 😎 #JavaScript #LeetCode #MonotonicStack #DSA #100DaysOfCode
0
0
2
0
33
AdhayanJ's profile picture. Logic before Code|| CS-Undergrad || Web-dev || Leetcode
Adhyan Jha
 @AdhayanJ
年11月13日

LeetCode 84: Largest Rectangle in Histogram 📊 Each bar’s height × its width = possible rectangle area. Track the max area while popping from the stack 🔥 ⏱️ O(n) time — elegant and efficient! #LeetCode #DSA #MonotonicStack #Coding

AdhayanJ's tweet image. LeetCode 84: Largest Rectangle in Histogram 📊 Each bar’s height × its width = possible rectangle area. Track the max area while popping from the stack 🔥 ⏱️ O(n) time — elegant and efficient! #LeetCode #DSA #MonotonicStack #Coding
AdhayanJ's tweet image. LeetCode 84: Largest Rectangle in Histogram 📊 Each bar’s height × its width = possible rectangle area. Track the max area while popping from the stack 🔥 ⏱️ O(n) time — elegant and efficient! #LeetCode #DSA #MonotonicStack #Coding
0
0
1
0
11
DedIntrntTheory's profile picture. Pull Stack Dev | Building SaaS 🚀 Applying chaos theory to both code and social interactions
Dead Internet Theory
 @DedIntrntTheory
2024年8月17日

Surprise triple header today! Adding: 3. Next Greater Element 📈 The monotonic stack trifecta is complete! Key points: Stack to track elements Pop when we find a greater element Efficient O(n) solution 💪 #CodingChallenge #DSA #MonotonicStack #ProblemSolving

DedIntrntTheory's tweet image. Surprise triple header today! Adding: 3. Next Greater Element 📈 The monotonic stack trifecta is complete! Key points: Stack to track elements Pop when we find a greater element Efficient O(n) solution 💪 #CodingChallenge #DSA #MonotonicStack #ProblemSolving
0
0
1
0
18
msanthoshhh's profile picture. Full Developer | {Mern|Pern} Stack Dev | DSA | Mathematics & Problem-Solving Lover
MSANTHOSH✨
 @msanthoshhh
年2月24日

🔥 Day 21 | Stock Span Problem 🚀 Used Stack to efficiently track previous greater elements, achieving O(N) time. Learned how to handle stock price comparisons smartly. #ProblemSolving #Stack #MonotonicStack #CodingJourney #KeepGrinding

msanthoshhh's tweet image. 🔥 Day 21 | Stock Span Problem 🚀 Used Stack to efficiently track previous greater elements, achieving O(N) time. Learned how to handle stock price comparisons smartly. #ProblemSolving #Stack #MonotonicStack #CodingJourney #KeepGrinding
0
0
1
0
17
SumitKumar9128's profile picture. Backend developer with a passion for solving real-world problems. Maintaining my streak on GeeksforGeeks and LeetCode, one challenge at a time!
Sumit Kumar
 @SumitKumar9128
年7月9日

🧵 Day 301 of #geekstreak2025 ✅ GFG POTD: Sum of Subarray Minimums 🧠 Used monotonic stack to find previous and next smaller elements. Each element’s contribution = val × (# of subarrays where it’s the min). Clean math, powerful stack. 🔁 #dsa #monotonicstack #array #math

SumitKumar9128's tweet image. 🧵 Day 301 of #geekstreak2025 ✅ GFG POTD: Sum of Subarray Minimums 🧠 Used monotonic stack to find previous and next smaller elements. Each element’s contribution = val × (# of subarrays where it’s the min). Clean math, powerful stack. 🔁 #dsa #monotonicstack #array #math
0
0
8
0
69
Dawn_of_Death's profile picture. Drinks water daily
Stranger
 @Dawn_of_Death
年12月11日

Day 82: 365 Days of DSA Challenge 💡 Problem: Sum of Subarray Minimums - Time Complexity: O(N), where N is the length of the array. - Space Complexity: O(N) for the stack and result storage. #365DaysOfDSA #MonotonicStack #ProblemSolving

Dawn_of_Death's tweet image. Day 82: 365 Days of DSA Challenge 💡 Problem: Sum of Subarray Minimums - Time Complexity: O(N), where N is the length of the array. - Space Complexity: O(N) for the stack and result storage. #365DaysOfDSA #MonotonicStack #ProblemSolving
0
0
0
0
30
AdhayanJ's profile picture. Logic before Code|| CS-Undergrad || Web-dev || Leetcode
Adhyan Jha
 @AdhayanJ
年11月13日

LeetCode 84: Largest Rectangle in Histogram 📊 Each bar’s height × its width = possible rectangle area. Track the max area while popping from the stack 🔥 ⏱️ O(n) time — elegant and efficient! #LeetCode #DSA #MonotonicStack #Coding

AdhayanJ's tweet image. LeetCode 84: Largest Rectangle in Histogram 📊 Each bar’s height × its width = possible rectangle area. Track the max area while popping from the stack 🔥 ⏱️ O(n) time — elegant and efficient! #LeetCode #DSA #MonotonicStack #Coding
AdhayanJ's tweet image. LeetCode 84: Largest Rectangle in Histogram 📊 Each bar’s height × its width = possible rectangle area. Track the max area while popping from the stack 🔥 ⏱️ O(n) time — elegant and efficient! #LeetCode #DSA #MonotonicStack #Coding
0
0
1
0
11
Atharva76678467's profile picture. Documenting my journey : dev projects & fun #100DaysOfWeb | #BuildInPublic https://t.co/bdOadH1sXF | https://t.co/zmh52dk5FC
Atharva Sonar
 @Atharva76678467
年8月5日

1️⃣ DSA – Stack Problems 🔸 Next Greater Element I 🔗 leetcode.com/problems/next-… 📌 Approach: • Use stack + map • Traverse from right → track next greater using stack • Map results for nums1 #DSA #Stack #MonotonicStack

Atharva76678467's tweet card. Can you solve this real interview question? Next Greater Element I - The next greater element of some element x in an array is the first greater element that is to the right of x in the same array....
Next Greater Element I - LeetCode
來源: leetcode.com
1
0
1
0
6
ajeetkrup401's profile picture. Gen AI Engineer | Learning and building | 1% better every day
Ajeet Kumar Upadhyay
 @ajeetkrup401
年8月4日

Solved Next Greater Element I using a 🔁 monotonic decreasing stack! Preprocessed nums2 in O(n), mapped next greater, and answered nums1 in O(1) lookups. From brute to beauty. 😎 #JavaScript #LeetCode #MonotonicStack #DSA #100DaysOfCode

ajeetkrup401's tweet image. Solved Next Greater Element I using a 🔁 monotonic decreasing stack! Preprocessed nums2 in O(n), mapped next greater, and answered nums1 in O(1) lookups. From brute to beauty. 😎 #JavaScript #LeetCode #MonotonicStack #DSA #100DaysOfCode
0
0
2
0
33
saransh_dutta's profile picture. 18-year-old coder | Learning C ++ | Sharing my coding journey and projects 💻| Instagram- https://t.co/RPnaqenCiu
Saransh Dutta
 @saransh_dutta
年7月21日

📉 Previous Smaller Element — Solved optimally in O(n) using a Monotonic Stack. A foundational pattern for problems like Histogram, Stack Span (in reverse), and more. 🔗LeetCode-style approach #MonotonicStack #Leetcode #DSAinCPP #LearningJourney

0
0
1
0
8
未找到 "#monotonicstack" 的結果
udevstack's profile picture.
udevstack
 @udevstack
年11月7日

Solved the Stock Span Problem using a Monotonic Decreasing Stack 💪. Efficiently computed spans in O(n) by storing indices instead of values! 📈🔥 #DSA #Stack #MonotonicStack #CodingJourney @harshbhaiyaa @ankurdotio @sheryians_

udevstack's tweet image. Solved the Stock Span Problem using a Monotonic Decreasing Stack 💪. Efficiently computed spans in O(n) by storing indices instead of values! 📈🔥 #DSA #Stack #MonotonicStack #CodingJourney @harshbhaiyaa @ankurdotio @sheryians_
0
0
2
0
41
SumitKumar9128's profile picture. Backend developer with a passion for solving real-world problems. Maintaining my streak on GeeksforGeeks and LeetCode, one challenge at a time!
Sumit Kumar
 @SumitKumar9128
年7月9日

🧵 Day 301 of #geekstreak2025 ✅ GFG POTD: Sum of Subarray Minimums 🧠 Used monotonic stack to find previous and next smaller elements. Each element’s contribution = val × (# of subarrays where it’s the min). Clean math, powerful stack. 🔁 #dsa #monotonicstack #array #math

SumitKumar9128's tweet image. 🧵 Day 301 of #geekstreak2025 ✅ GFG POTD: Sum of Subarray Minimums 🧠 Used monotonic stack to find previous and next smaller elements. Each element’s contribution = val × (# of subarrays where it’s the min). Clean math, powerful stack. 🔁 #dsa #monotonicstack #array #math
0
0
8
0
69
ajeetkrup401's profile picture. Gen AI Engineer | Learning and building | 1% better every day
Ajeet Kumar Upadhyay
 @ajeetkrup401
年8月4日

Solved Next Greater Element I using a 🔁 monotonic decreasing stack! Preprocessed nums2 in O(n), mapped next greater, and answered nums1 in O(1) lookups. From brute to beauty. 😎 #JavaScript #LeetCode #MonotonicStack #DSA #100DaysOfCode

ajeetkrup401's tweet image. Solved Next Greater Element I using a 🔁 monotonic decreasing stack! Preprocessed nums2 in O(n), mapped next greater, and answered nums1 in O(1) lookups. From brute to beauty. 😎 #JavaScript #LeetCode #MonotonicStack #DSA #100DaysOfCode
0
0
2
0
33
DedIntrntTheory's profile picture. Pull Stack Dev | Building SaaS 🚀 Applying chaos theory to both code and social interactions
Dead Internet Theory
 @DedIntrntTheory
2024年8月17日

Surprise triple header today! Adding: 3. Next Greater Element 📈 The monotonic stack trifecta is complete! Key points: Stack to track elements Pop when we find a greater element Efficient O(n) solution 💪 #CodingChallenge #DSA #MonotonicStack #ProblemSolving

DedIntrntTheory's tweet image. Surprise triple header today! Adding: 3. Next Greater Element 📈 The monotonic stack trifecta is complete! Key points: Stack to track elements Pop when we find a greater element Efficient O(n) solution 💪 #CodingChallenge #DSA #MonotonicStack #ProblemSolving
0
0
1
0
18
AdhayanJ's profile picture. Logic before Code|| CS-Undergrad || Web-dev || Leetcode
Adhyan Jha
 @AdhayanJ
年11月13日

LeetCode 84: Largest Rectangle in Histogram 📊 Each bar’s height × its width = possible rectangle area. Track the max area while popping from the stack 🔥 ⏱️ O(n) time — elegant and efficient! #LeetCode #DSA #MonotonicStack #Coding

AdhayanJ's tweet image. LeetCode 84: Largest Rectangle in Histogram 📊 Each bar’s height × its width = possible rectangle area. Track the max area while popping from the stack 🔥 ⏱️ O(n) time — elegant and efficient! #LeetCode #DSA #MonotonicStack #Coding
AdhayanJ's tweet image. LeetCode 84: Largest Rectangle in Histogram 📊 Each bar’s height × its width = possible rectangle area. Track the max area while popping from the stack 🔥 ⏱️ O(n) time — elegant and efficient! #LeetCode #DSA #MonotonicStack #Coding
0
0
1
0
11
msanthoshhh's profile picture. Full Developer | {Mern|Pern} Stack Dev | DSA | Mathematics & Problem-Solving Lover
MSANTHOSH✨
 @msanthoshhh
年2月24日

🔥 Day 21 | Stock Span Problem 🚀 Used Stack to efficiently track previous greater elements, achieving O(N) time. Learned how to handle stock price comparisons smartly. #ProblemSolving #Stack #MonotonicStack #CodingJourney #KeepGrinding

msanthoshhh's tweet image. 🔥 Day 21 | Stock Span Problem 🚀 Used Stack to efficiently track previous greater elements, achieving O(N) time. Learned how to handle stock price comparisons smartly. #ProblemSolving #Stack #MonotonicStack #CodingJourney #KeepGrinding
0
0
1
0
17
Dawn_of_Death's profile picture. Drinks water daily
Stranger
 @Dawn_of_Death
年12月11日

Day 82: 365 Days of DSA Challenge 💡 Problem: Sum of Subarray Minimums - Time Complexity: O(N), where N is the length of the array. - Space Complexity: O(N) for the stack and result storage. #365DaysOfDSA #MonotonicStack #ProblemSolving

Dawn_of_Death's tweet image. Day 82: 365 Days of DSA Challenge 💡 Problem: Sum of Subarray Minimums - Time Complexity: O(N), where N is the length of the array. - Space Complexity: O(N) for the stack and result storage. #365DaysOfDSA #MonotonicStack #ProblemSolving
0
0
0
0
30
DeepakTyagi626's profile picture.
Deepak Tyagi
 @DeepakTyagi626
年2月23日

💡 Day 92: Next Greater Element 🚀 🔹 Given an array, find the next greater element (NGE) on the right. 🔹 Approaches: ✅ Stack-based (O(N), efficient). ✅ Brute force (O(N²), slow). 🔹 Use Cases: ✔️ Stock span ✔️ #GfG160 #MonotonicStack #DSA #NextGreaterElement

DeepakTyagi626's tweet image. 💡 Day 92: Next Greater Element 🚀 🔹 Given an array, find the next greater element (NGE) on the right. 🔹 Approaches: ✅ Stack-based (O(N), efficient). ✅ Brute force (O(N²), slow). 🔹 Use Cases: ✔️ Stock span ✔️ #GfG160 #MonotonicStack #DSA #NextGreaterElement
DeepakTyagi626's tweet image. 💡 Day 92: Next Greater Element 🚀 🔹 Given an array, find the next greater element (NGE) on the right. 🔹 Approaches: ✅ Stack-based (O(N), efficient). ✅ Brute force (O(N²), slow). 🔹 Use Cases: ✔️ Stock span ✔️ #GfG160 #MonotonicStack #DSA #NextGreaterElement
0
0
1
0
6

Something went wrong.


Something went wrong.


United States Trends