New update is available. Click here to update.

Posted: 28 Jul 2020

745

Selected

Interview Rounds

Application Process

Round 1

Round 2

Round 3

Round 4

Round 5

Easy

Duration:

60 minutes

Interview-Date:

25 Jan 2019

Problems:

2

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 ...

View more

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...

View more

Amazon Mock Interviews

For college students & professionals looking to get into Amazon

Categories:

Popular Courses:

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

Comment RemovedCount special nodes in Generic tree Solution

Comment Removed