2. Peripheral traversal of binary tree -
Software Development Engineer Amazon Interview Questions
44 software development engineer amazon interview questions shared by candidates
Given a soduku problem, how would you solve it with programming.
what is external merge sort
Leadership principles and one LC medium
2.Code Question 2: Amazon Engineering maintains a large number of logs of operations across all products. A software engineer is debugging an issue in product. An efficient wat yo analyze logs is to write automated scripts to check for patterns. The engineer wants to find the maximum number of times a target word can be obtained by rearranging a subset of characters in a log entry. Given a log entry s and target word t, the target word can be obtained by selecting some subset of characters from s that can be rearranged to form string t and removing them from s. Determine the maximum number of times the target word can be removed from the given log entry. Note: both strings s and t consist only of lowercase English letters
hands on with an app and test the app
Solve a linked lists
Basic leet code questions
My questions are 1) In given Binary search tree removes all nodes which are not in range [-10,13] 2)Given an array and set with length k return max values in array with k as size. example :array={1,2,7,3,,1} k=2; output : {2,7,7,3}
1. Rotten oranges question from gfg
Viewing 31 - 40 interview questions