## Recent Interview Questions

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

- 0of 0 votes
Find Duplicate number from a huge amount of data which cannot fit in the memory.

- 0of 0 votes
Find kth-largest number from a huge amount of data which cannot fit in the memory.

- 0of 0 votes
There is a list of 20 words. 10 of them are good works, and 10 of them are bad words. Write a regex of not more than 25 characters which would tell if given word is good or bad. Input would only contain one of these 20 words.

Good words: papa, book, home, cars, jolly, sugar, friend, mother, father, bloomiest

Bad words: ache, slow, torn, slum, boom, rival, wrong, cholera, revenge, arrogant

Input: book

Output: Good

Input: boom

Output: bad

Write Java Code using regex pattern

- 0of 0 votes
1. There is a list of 20 words. 10 of them are good works, and 10 of them are bad words. Write a regex of not more than 25 characters which would tell if given word is good or bad. Input would only contain one of these 20 words.

Good words: papa, book, home, cars, jolly, sugar, friend, mother, father, bloomiest

Bad words: ache, slow, torn, slum, boom, rival, wrong, cholera, revenge, arrogant

Input: book

Output: Good

Input: boom

Output: bad

- 0of 0 votes
Given a random MxN matrix and a positive integer, recursively Your program should then find a continuous path thought the matrix starting at position 0,0 that will sum to n. Your program shouldomly move left (col -1), right(col +1), up (row -1) and down (row+1)and can only use a position once in the sum. if there is a such path in the matrix, create the path in a separate matrix with the same size, and replacing the indices used with 1 and the rest 0.

- -1of 1 vote
More Info :- http://www.contactsupportservice.com/malwarebytes-support.php

- -2of 2 votes
Looking for Malware Bytes support? Wondering about getting this service for 24 hours? Your wish is fulfilled! You can now enjoy the support service of Malware Bytes easily from us at no cost. All you need is to pick the phone to ring our customer care helpline number.

More Info :- http://www.contactsupportservice.com/malwarebytes-support.php

- -2of 2 votes
Malware Bytes Customer Support Help 1/888/272/6111

- -2of 2 votes
More Info :-

http://www.livetechnicianhelp.com/malwarebytes-contact-support.html

- -1of 1 vote
When it comes to the support service of Malware Bytes, then no doubt it is the best and other antivirus packages available in the market do not falls into the line. Not only the antivirus software offers amazing services, but the support system of Malware Bytes is unbelievable. You can get instant solution for any problem you face with the antirust.More Info :-

http://www.livetechnicianhelp.com/malwarebytes-contact-support.html

- -2of 2 votes
Feasible Features of Malware Bytes Support 1/888/272/6111

- 0of 0 votes
Design a system like github.