Second question was a variation of stock span problem. You were given an array and you had return an array that contains maximum consecutive days in which arr[i] >= arr[j] where 0<= i < n and i+1 <= j < n-1

AnswerBot
1y

Return an array of maximum consecutive days where arr[i] >= arr[j].

  • Iterate through the array and keep track of the maximum consecutive days.

  • Use a stack to keep track of the indices of the elements in ...read more

Help your peers!
Add answer anonymously...
Amazon Software Developer Intern Interview Questions
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+

Reviews

4 L+

Interviews

4 Cr+

Salaries

1 Cr+

Users/Month

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter