Round 1: Easy Graph application problem, Optimise it using DP, further optimise space by removing unnecessary data. Easy Data Structures problem using hashmap and a counter. Round 2: Find the kth the smallest element in an array. Binary Search tree problem(GFG medium level) Round 3: RU Cache Implementation Round 4: Implement Hashmap with a function that returns the order of insertion of pairs into it

Question

Round 1:
Easy Graph application problem, Optimise it using DP, further optimise space by removing unnecessary data.
Easy Data Structures problem using hashmap and a counter.

Round 2:
Find the kth the smallest element in an array.
Binary Search tree problem(GFG medium level)

Round 3:
RU Cache Implementation

Round 4:
Implement Hashmap with a function that returns the order of insertion of <key, value> pairs into it

Amazon

Pergunta de entrevista da empresa Amazon

Empresas seguidas

Buscas de vagas