New update is available. Click here to update.

Amazon Interview Experience for Fresher SDE - 1, Jan 2019

Posted: 28 Jul 2020

745

Selected

Interview Rounds

Application Process

Round 1

Round 2

Round 3

Round 4

Round 5

Interview Process

Online Coding Test

Easy

Duration:

60 minutes

Interview-Date:

25 Jan 2019

Problems:

Tiling Problem

Given a “2 x n” board and tiles of size “2 x 1”, count the number of ways to tile the given board using the 2 x 1 tiles. A tile can either be placed horizontally i.e., as a 1 x 2 tile or vertically i.e., as 2 x 1 tile.

Examples:

Input n = 3

Output: 3

Explanation:

We need 3 tiles to tile the board of size 2 x 3.

We can tile the board ...

Try Problem

See my Approach

Find k’th character of decrypted string

Given an encoded string where repetitions of substrings are represented as substring followed by count of substrings. For example, if encrypted string is “ab2cd2” and k=4 , so output will be ‘b’ because decrypted string is “ababcdcd” and 4th character is ‘b’.

Note: Frequency of encrypted substring can be of more than one digit. For example, in “ab12c3”, ab is repeated 12 time...

Try Problem

See my Approach

Preparation

Duration:

8 months

Topics:

Data Structures and Algorithms, Operating System, Database Management System, Object-Oriented Programming System

Preparation Tip

Do lot of hard work and practice of Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.

Application Process

Where:

Campus

Eligibility:

7 CGPA

Resume Tip

Make your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.

745 upvotes

Have an interview experience that you want to contribute?

PreviousNext

Join the Discussion

13 replies

Abhishek Rohit |Level 3

7 months ago

#include <unordered_map>

bool isAnagram(string str1, string str2)
{
   unordered_map<char, int>mp;
	if(str1.length()==str2.length())
	{
     for(int i=0;i<str1.length();i++)
	{
		mp[str1[i]]++;
		 mp[str2[i]]++;
	}
		for(auto i:mp)
		{
			if(i.second ...

7 upvotes

0 replies

Gautam Mishra |Level 1

12 Nov 2020

Edited

Thank You So much. For the splitwise question DP something like subset sum will work.

8 upvotes

0 replies

Victim |Level 1

3 Feb 2021

Comment Removed

2 upvotes

0 replies

AkashDebbarma |Level 6

5 months ago

Count special nodes in Generic tree Solution

void dfs(TreeNode<int> *root, unordered_set<int> &pathElements, int &count){
    if(!root){
        return;
    }
    int currVal = root->data;
    if(pathElements.count(currVal) != 0){
        retur...

1 upvote

0 replies