Amazon | SDE1 | Bangalore | May 2022 [Offer]
Anonymous User
6281

About Me: 1 year experienced backend dev in a product based company
In this process of interview, each and every round was an elimination round and it took approx. 4 months 😅 .(this was my third attempt got rejected twice at college time first for SDE intern then for SDE 2021 Grad)

Round 1: OA (1.5 hours)

  • it was conducted on the hackerank platform and it had two questions the questions were a bit like puzzles but I was able to solve both of them using basic logic only and the level was leetcode medium. (don't remember the exact questions but it was from array only)

  • then there was work style assessment which was similar to a psychometric test and mostly based on behavioral type questions.

Round 2:DSA Round(50 minutes)

  • it had only one problem: A movie  🍿 dataset table was given with fields movie_name, genre, and trend_score and there were two use cases :

     1. find the movie having the highest trend score in a given genre -> getMovieWithMaxTrendScoreByGenre(string genre) : string
    
     2. update the trend score of any movie by a new score -> updateMovieTrendScore(string movieName,int score): void

    I was able to solve it and wrote the whole code with proper edge case and exception handling and in a modular and extensible way with the most efficient time and space complexity 🙂. 

Round 3:DSA Round:(55 minutes)

  • it also had two questions and some leadership principles-related questions.

  • both the questions were of leetcode medium level :

    1.Find the next greater number using the digits of the given number, e.g: input: 123 output: 132
    
    2.Check if all the below relations of characters are valid or not : input: [a<b<c<d , a<d, c<e, e>d ] output: yes 

Round 4:Bar Raiser Round:(50 minutes)

  • It also had two leetcode easy-medium level questions and some LP questions.

  • the questions are :

       1.Find the Kth smallest number from a row and column-wise sorted matrix. (binary search or priority queue)
    
       2.Find all the Unique Subsets for a given array. (recursion with backtracking)

Result: Got selected for 👨🏻‍💻 SDE 1 role at Amazon 😁 .

Comments (25)