Amazon Data Structures & Algorithms Interview Questions

Review this list of 43 Amazon Data Structures & Algorithms interview questions and answers verified by hiring managers and candidates.

+ Share interview

Asked at Amazon, Adobe, Apple + 1 more • 2 years ago
Top k frequent elements
Software Engineer
Data Structures & Algorithms
+3 more
1 answer
"Leetcode 347: Heap + Hashtable Follow up question: create heap with the length of K instead of N (more time complexity but less space )"
Chen J. - "Leetcode 347: Heap + Hashtable Follow up question: create heap with the length of K instead of N (more time complexity but less space )"See full answer
Software Engineer
Data Structures & Algorithms
+3 more
Asked at Amazon • 4 years ago
Given an array, print the Next Greater Element (NGE) for each element. The NGE for an element x is the first greater element on the right side of x in the array, or -1 if none exists.
Software Engineer
Data Structures & Algorithms
+1 more
3 answers
"int a_array[10] = {3,6,4,7,2,1,9}; int index = 0; int index2 = 0; for ( index = 0; index < sizeof(a_array); index++ ) { int tmpindex = index + 1; if ( tmpindex <= sizeof(a_array) ) { for ( index2 = tmpindex; index2 < sizeof(a_array); index2++ ) { if ( aarray[index] <= aarray[index2] ) { print( "%d is the NGE of %d" array[index2], array[index]); break; "
Mark S. - "int a_array[10] = {3,6,4,7,2,1,9}; int index = 0; int index2 = 0; for ( index = 0; index < sizeof(a_array); index++ ) { int tmpindex = index + 1; if ( tmpindex <= sizeof(a_array) ) { for ( index2 = tmpindex; index2 < sizeof(a_array); index2++ ) { if ( aarray[index] <= aarray[index2] ) { print( "%d is the NGE of %d" array[index2], array[index]); break; "See full answer
Software Engineer
Data Structures & Algorithms
+1 more
Asked at Amazon • 2 years ago
Given an array of children’s ratings, assign at least one candy to each child so that higher-rated children get more than their neighbors, and return the minimum total candies needed.
Software Engineer
Data Structures & Algorithms
+3 more
Add answer
Software Engineer
Data Structures & Algorithms
+3 more

🧠 Want an expert answer to a question? Saving questions lets us know what content to make next.

Showing 41-43 of 43

Interviewed recently?

Help improve our question database (and earn karma) by telling us about your experience

+ Share interview experience

Trending companies

Amazon Data Structures & Algorithms Interview Questions

Top k frequent elements

Given an array, print the Next Greater Element (NGE) for each element. The NGE for an element x is the first greater element on the right side of x in the array, or -1 if none exists.

Given an array of children’s ratings, assign at least one candy to each child so that higher-rated children get more than their neighbors, and return the minimum total candies needed.

Explore questions by company

Explore questions by role

Follow Us