Bird
Raised Fist0
DSA Typescriptprogramming~3 mins

Why Next Greater Element Using Stack in DSA Typescript?

Choose your learning style10 modes available
The Big Idea

Discover how a simple stack can save you from endless comparisons and speed up your search for the next bigger number!

The Scenario

Imagine you have a list of daily temperatures and you want to know for each day when the next warmer day will be. Doing this by checking each day against all future days manually is like looking through a messy drawer trying to find the next bigger item one by one.

The Problem

Manually comparing each element with all the elements after it takes a lot of time and effort. It's slow because you keep repeating the same checks, and it's easy to make mistakes or miss some comparisons, especially with long lists.

The Solution

Using a stack helps keep track of elements waiting for their next bigger element. We only compare with the most recent elements that haven't found their next bigger one yet. This way, we avoid repeated checks and find the answer quickly and cleanly.

Before vs After
✗ Before
for (let i = 0; i < arr.length; i++) {
  for (let j = i + 1; j < arr.length; j++) {
    if (arr[j] > arr[i]) {
      result[i] = arr[j];
      break;
    }
  }
}
✓ After
const stack: number[] = [];
for (let i = 0; i < arr.length; i++) {
  while (stack.length && arr[i] > arr[stack[stack.length - 1]]) {
    const index = stack.pop()!;
    result[index] = arr[i];
  }
  stack.push(i);
}
What It Enables

This method lets you quickly find the next bigger element for every item in a list, making problems like stock prices, temperatures, or game scores easy to solve.

Real Life Example

Think about checking the weather forecast: for each day, you want to know when a warmer day will come next. Using this stack method, you can instantly find that for every day without checking all future days repeatedly.

Key Takeaways

Manual checking is slow and repetitive.

Stack keeps track of elements waiting for their next bigger one.

Efficiently finds next greater elements in one pass.

Practice

(1/5)
1. What does the Next Greater Element problem using a stack find for each element in an array?
easy
A. The first smaller element to the left of each element
B. The first greater element to the right of each element
C. The last element in the array
D. The sum of all elements greater than the current element

Solution

  1. Step 1: Understand the problem goal

    The Next Greater Element problem aims to find, for each element, the first element to its right that is larger than it.
  2. Step 2: Identify the role of the stack

    A stack helps efficiently track elements for which we haven't found a greater element yet, allowing us to find the next greater element in one pass.
  3. Final Answer:

    The first greater element to the right of each element -> Option B
  4. Quick Check:

    Next Greater Element = first bigger right element [OK]
Hint: Look right for the first bigger number using a stack [OK]
Common Mistakes:
  • Confusing next greater with next smaller element
  • Searching to the left instead of right
  • Thinking it sums elements instead of finding one
2. Which of the following TypeScript code snippets correctly initializes an empty stack to use for Next Greater Element?
easy
A. var stack = null;
B. let stack = {};
C. const stack: number[] = [];
D. const stack = new Map();

Solution

  1. Step 1: Identify correct stack data structure

    For Next Greater Element, a stack is an array used with push/pop. So, an empty array of numbers is correct.
  2. Step 2: Check TypeScript syntax

    const stack: number[] = []; correctly declares an empty number array stack.
  3. Final Answer:

    const stack: number[] = []; -> Option C
  4. Quick Check:

    Stack = number array [] [OK]
Hint: Use number array [] for stack in TypeScript [OK]
Common Mistakes:
  • Using object {} instead of array for stack
  • Initializing stack as null
  • Using Map which is not a stack
3. What is the output of the Next Greater Element function for the input array [4, 5, 2, 25]?
medium
A. [5, 25, 25, -1]
B. [25, -1, 5, -1]
C. [5, -1, 25, -1]
D. [-1, 25, 25, -1]

Solution

  1. Step 1: Process each element to find next greater

    4's next greater is 5, 5's next greater is 25, 2's next greater is 25, 25 has none so -1.
  2. Step 2: Form the output array

    Output array is [5, 25, 25, -1].
  3. Final Answer:

    [5, 25, 25, -1] -> Option A
  4. Quick Check:

    Next Greater Element for [4,5,2,25] = [5,25,25,-1] [OK]
Hint: Check each element's right side for first bigger number [OK]
Common Mistakes:
  • Assigning -1 too early
  • Mixing up order of elements
  • Confusing next greater with next smaller
4. Identify the bug in this Next Greater Element TypeScript code snippet:
function nextGreater(arr: number[]): number[] {
  const stack: number[] = [];
  const result: number[] = new Array(arr.length).fill(-1);
  for (let i = 0; i < arr.length; i++) {
    while (stack.length && arr[stack[stack.length]] < arr[i]) {
      const index = stack.pop();
      result[index] = arr[i];
    }
    stack.push(i);
  }
  return result;
}
medium
A. Stack should store values, not indices
B. Result array initialized with zeros instead of -1
C. Loop should run backwards from end to start
D. Incorrect stack top access: should be stack[stack.length - 1]

Solution

  1. Step 1: Check stack top element access

    stack[stack.length] is undefined because array indices go from 0 to length-1. Correct is stack[stack.length - 1].
  2. Step 2: Confirm other parts are correct

    Result array initialization and loop direction are correct. Stack stores indices as expected.
  3. Final Answer:

    Incorrect stack top access: should be stack[stack.length - 1] -> Option D
  4. Quick Check:

    Stack top index = stack[stack.length - 1] [OK]
Hint: Stack top index is length-1, not length [OK]
Common Mistakes:
  • Using stack[stack.length] which is undefined
  • Initializing result with wrong default
  • Reversing loop unnecessarily
5. Given the array [13, 7, 6, 12], what is the Next Greater Element array using a stack approach?
hard
A. [ -1, 12, 12, -1 ]
B. [ -1, 13, 7, -1 ]
C. [ 7, 12, 13, -1 ]
D. [ 12, -1, -1, 13 ]

Solution

  1. Step 1: Find next greater for each element

    13 has no greater element to right, so -1. 7's next greater is 12. 6's next greater is 12. 12 has none, so -1.
  2. Step 2: Write the output array

    The result is [-1, 12, 12, -1].
  3. Final Answer:

    [-1, 12, 12, -1] -> Option A
  4. Quick Check:

    Next Greater Element for [13,7,6,12] = [-1,12,12,-1] [OK]
Hint: Check right side elements for first bigger number [OK]
Common Mistakes:
  • Assigning wrong next greater for 13
  • Mixing up indices and values
  • Confusing next greater with previous greater
Recommended

Ready to prove it?

Pass the test and this pattern moves unknown strong while earning +1 Grip toward your certificate.

10 questions~5 mineasy hard