## Recent Interview Questions

- 0of 0 votes
You are using a Webmail UI like GMail. You have to send a "Hello" mail to a person.

1. Write all the scenarios which you would cover in an automated test framework.

2. If you have to test it for 50 different users, what are the challenges you might face in writing your test scripts?

It seems like a pretty easy solution. But at the end he said I need to answer based on the amount of experience I have. I have 9 years of experience as a QA. And he wanted me to give a solution like I actually have 9 years of experience. In short, I blew this question.

- 0of 0 votes
You have been given a map which holds book name and book author. One author might have several different books. But books are unique. Now, write a function which will return you a Map which will have the author name as unique and all the books he has written as values.

`Book Map=["Java"-->"John", "C#"-->"Rob", "Ruby"-->"John", "Rails"-->"Rob"]`

This should return a Map which has the following:

`["John"-->{"Java","Ruby"} "Rob"--{"C#","Rails"}]`

- 0of 0 votes
Multi -level cache system design with different storage in each level.

Read Operation : – Minimum time to read a particular key from cache system. This should be followed by writing the key in all levels above it. Eg. if “key” is found at level ‘i’, add this key to cache present at 1 to i-1 level.

b. Write Operation: – Any write Operation should write in cache of all levels.

You can choose any algorithm for cache management like LRU, MRU.

- 1of 1 vote
Given a map represented as a 2d array with only 0’s and 1’s. An island is a group of connected 1’s. Find out how many distinct islands(can be rotated).

eg:

1 1 0 0

1 0 0 0

0 0 0 1

0 0 1 1

return 2.

- -3of 3 votes
Psychic healer | Spiritual Rats | amagundane | money spells | Sangoma +27634299958 Baba Messe

Sangoma in Cape town charge R.5000 as an upfront fee.“

Am called Sangoma baba Messe and i specialize mainly in amagundwane/spiritual rats together with my great fathers and i perform the ritual which is a mixture of magic and muthi and we send rats steal money.“A person must state how much he wants. You can state R.500,000 to R.10 millions – the rats will deliver it for you wherever you are! No one sees them because it’s magic,”

I Baba Messe from Gauteng i can assure you that this is the only legit way rats can make you rich.

“The person who requests the money is allowed to spend it on anything he or she wants for the rest of their life. But he or she can go back again and request for another ritual its fine. If you're not completely satisfied, we'll refund your money, period, no questions asked,” My Potential money Spells Can Help You Attract Cash & Strike it Rich. Get the Wealth You Deserve!

If you're not completely satisfied, we'll refund your money, period, no questions asked,”

Baba Messe;

spiritualratsandmoneyspell@gmail.com

https://spiritualrats.wordpress.com/

https://www.youtube.com/watch?v=2_cnbcIp_u4

https://www.youtube.com/watch?v=3kfDMKwevro

https://www.youtube.com/watch?v=BuvsNSQXQWA

https://www.youtube.com/watch?v=NGQAM-sGiDo

https://twitter.com/amagudwane

https://za.pinterest.com/babamesse/

http://spiritualrats.altervista.org

- 0of 0 votes
Design a system like HackerRank/Codechef.

- -1of 1 vote
How is code review done?

- -1of 1 vote
How is design review done?

- 0of 0 votes
Given disjoint set of intervals and a new interval.Merge them and generate the resultant intervals, Write Code

E.g input is input1=(1,5)(10,20)(25,100) and input2=(6,8)

- 0of 0 votes
you have a function to set particular pixel to black set_pixel(x,y) will set x,y to black Now, given center of circle(a,b) and its radius r, all integral you need to set suitable pixels black

- 0of 0 votes
Because Ethereum smart contracts are deployed publicly, anyone with the right tooling can read their contents.

Furthermore, people can access any state the contract specifies. Knowing that people have access to your

validation code, how do you write the contract so that somebody *must solve the problem. (*it should be near

impossible or significantly computationally expensive to derive the answer from your contract code)

- 0of 0 votes
Ethereum is a blockchain that can run arbitrary programs. Write an ethereum program (i.e. contract) that will send 0.1 ETH (a bounty) to the first person who gets the correct answer to the above "100-digit"

question.

- 0of 0 votes
Here is a standard telephone keypad:

1 2 3

4 5 6

7 8 9

* 0 #

Write a program to calculate the number of n-digit numbers that simultaneously:

● exclude * and #

● start with 0

● are formed by cycling through three moves: a "tall L" (two steps in one direction followed by one

step in the perpendicular direction) followed by two "short L"s (one step in one direction followed

by one step in the perpendicular direction).

For example, the qualifying 2-digit numbers are {04, 06}, the qualifying 3-digit numbers are {042, 048,

062, 068}, and the qualifying 4-digit numbers are {0424, 0426, 0484, 0486, 0624, 0626, 0684, 0686}.

How many qualifying 7-digit numbers are there? How many qualifying 100-digit numbers are there?

- 0of 0 votes
Given an array of int with less than 75 elements ( random, no bucket) . make all duplicates 0 and print array in sorted order .

avoid using any extra space, or any sorting algorithm ( quick sort , merge sort)

example :

input :

6 1 1 22 9

output :

0 1 6 9 22

- 0of 0 votes
https://codejamanalysis.wordpress.com/2017/03/18/crossover-problem-super-stack/

Any Optimized Solution to avoid TLE for 4 test cases. I have tried by implementing Stack using Doubly Linked List.

Still not able to pass test cases!!!

- 0of 0 votes
Design a concurrent hashmap.

Please point me to the link if this has been discussed before.

They wanted design with code snippet of the classes.

- 0of 0 votes
Given lat long of cabs in a city(lat long keeps changing)

Implement a function getNearby(lat1,long1) which returns all cabs in a circle of radius R from lat1,long1.

Which datastructure will u use?

FollowUp qs: Hows it implemented using a database like MySQl or Postgres.

- 0of 0 votes
Given a BST of memory sizes. Find best fit for a memory block of size M.

- 0of 0 votes
Given a wall, which is made up of two types of bricks (Porus / opaque ). Porus bricks allow water pass through them. Opaque won't. Find whether water reaches to ground, if there is any rainfall.

Water can flow from top to bottom, diagonally, horizontally as well. Only flowing from bottom to top is not possible.

- 0of 0 votes
Given an infinitely large array and every element has tags associated with them, and there are about 10,000 tags (say) then sort the given array to get all tag-0’s first, tag-1’s next and so on in O(n).

- 0of 0 votes
Given a 2-d integer array, find the size of the largest connected area (number of elements connected), where two elements are connected if they are side-adjacent in matrix(up,down,left,right operations). Also there can be maximum of two different integers present in this set.

- 1of 1 vote
For Amazon SDE-1 On Campus Interview, what are the topics I should study in Database Management ?

Just don't name the topics. Please elaborate too.

- -1of 1 vote
For Amazon SDE-1 On Campus Interview, what are the topics I should study in Computer Networking ?

Just don't name the topics. Please elaborate too.

- 0of 0 votes
encode a given decimal number in fibonacci series and return the smallest possible binary number

- 0of 0 votes
water capacity in a histogram

what is the capacity if an array value becomes 0 - which will make the water to flow off the histogram

- 2of 2 votes
Give an positive integer n, find out the smallest integer m, such that all digits in m multiply equals to n. For example, n = 36, return 49. n = 72, return 89. You can assume there is no overflow.

- 0of 0 votes
my account is not working properly I have to face Gmail login issue problem. what is Gmail support number?

- 0of 0 votes
Reverse a linked list

- 0of 0 votes
Consider a game similar to tennis. The game can be palyed by 'N' number of players. The player has to win atleast 'M' games to win a set.

Print all the possible combination of winning set for all the payers.

Where

2 <= N

1 <= M

For Example if [A, B] are the players and

if M = 2 The player has to win atleast '2' games to win a set.

The output will be

A A

A B A

B A A

B B

B A B

A B B

if M = 3 The player has to win atleast '3' games to win a set.

The output will be

A A A

A B A A

A A B A

B A A A

B B B

B A B B

B B A B

A B B B

Write an algorithm to print all the possible combination of winning set for all the payers

- 0of 0 votes
there is a 2d array and gbikes are located in that location. there is a person and he wants to know the nearest location of the bike which is available for him(there can be more than 1 nearest bike). person can only move left , right , up or down. output should be the distance in int.