Daily log
#DSA:stack & queue โcoded MinStack from scratch on LeetCode (that 2*val - prevMin trick blew my mind O(1) min queries)
Also solved Peak Index in a Mountain Array. Leg day crushed 10k steps, 2L water
MySQL got delayed for tomorrow. #LeetCode#100DaysOfCode
๐ #day17
3 questions:
- practiced class based stack syntax in js
- solve valid-parentheses
- implemented stack using 2 queues
tom I will implement stack using 1 queue and will solve 4-5 questions including minstack question
#LeetCode
Todayโs learning
๐น Solved 2 LeetCode problems: Valid Parentheses & MinStack (stacks in action!).
๐น Started Operating Systems โ realized without OS, devs would write memory mgmt manually.
The OS is the silent hero behind the scenes.
#DSA#Cplusplus#StriverSheet#LearnInPublic
Day 40/90 #90DayChallenge
Today, I learned arithmetic operations using a stack:
- Infix to Postfix Conversion
- Postfix to Prefix Conversion
- Postfix to Infix Conversion
- Infix to Prefix Conversion
Solved the LeetCode problem "MinStack."
Day 28/90
โ DSA -MinStack
โ Dev - Made progress on Architecture website with ordering of images. Started Computer Networks
#90DaysOfCode#DevJourney#DSA
๐ Day 27 of #100DaysOfCode โ
๐ข Completed internship floor & department tests
๐Revised Monotonic Stack problems:
๐ฆ MinStack
๐ Sum of Subarray Minimums
๐ Sum of Subarray Ranges
โก Staying consistent, even through frustration.
#DSA#InternLife#DevJourney
๐ Day 105 of #GFG160! โ๏ธ๐งฑ
Solved: Get Min from Stack (Optimized)
๐ง Approach:
Used one stack a minEle variable
Encoded value on push if element < minEle
On pop: decoded minEle if encoded value found
@geeksforgeeks#gfg160#GeekStreak2025#DSA#MinStack
Day 47-48-49/100
-implement stack using queue
-implement queue using stack
-implement minStack
did some backend of my new project
wrote some tests
also, web3 seems fun ig, maybe will try rust
should I start a blog or somethin?
twitter limits words man!~
#100DaysOfCode#leetcode
LeetCode Day 62
155. Min Stack
Use two stacks: one for the values and one for the minimum so far.
Each push(val) stores the smaller between val and the top of minStack.
๐ O(1) | ๐พ O(n)
#LeetCode#Java#Stack#100DaysOfCode