Blog

Your dream job? Lets Git IT.
Interactive technical interview preparation platform designed for modern developers.

XGitHub

Platform

  • Categories

Resources

  • Blog
  • About the app
  • FAQ
  • Feedback

Legal

  • Privacy Policy
  • Terms of Service

© 2025 LetsGit.IT. All rights reserved.

LetsGit.IT/Categories/Algorithms
Algorithmshard

What is a monotonic stack and what kind of problems does it solve?

Tags
#stack#monotonic-stack#next-greater#big-o
Back to categoryPractice quiz

Answer

A monotonic stack keeps elements in increasing or decreasing order. It’s used for “next greater/smaller element”, stock span, and histogram problems, often in O(n) time by pushing/popping each element at most once.

function nextGreater(nums: number[]): number[] {
  const res = Array(nums.length).fill(-1);
  const st: number[] = []; // stack of indices

  for (let i = 0; i < nums.length; i++) {
    while (st.length && nums[st[st.length - 1]] < nums[i]) {
      res[st.pop()!] = nums[i];
    }
    st.push(i);
  }

  return res;
}

Related questions

Algorithms
Quickselect: what is it used for and what is its expected complexity?
#quickselect#selection#partition
Algorithms
What is a monotonic queue and how does it solve sliding window max in O(n)?
#deque#monotonic-queue#sliding-window
Algorithms
Counting sort: when can it be faster than O(n log n) sorting?
#counting-sort#sorting#stability
Algorithms
Kruskal vs Prim for MST — how do they differ?
#mst#kruskal#prim
Algorithms
Randomized pivot in QuickSort/Quickselect — why does it help?
#randomization#quicksort#quickselect
Algorithms
What is Quickselect and what is its average time complexity?
#quickselect#partition#selection