CareerCup

How would you design a system where you have 1000 records in database and on UI you are showing them, a user can select single or bulk record which can be in any order and drag drop to reorder the sequence of the record. Example :
I have below records
1
2
3
4
5
a user selects 1 and dragdrops it on 5th position, so the new order becomes 2,3,4,5,1. This has to be done at the database layer and in efficient way. How to maintain continuous reordering sequence of records?

Given an undirected graph represented as a list of edges, find out the number of connected component.

set of locations on the map. Example, 4 places in zone 1. 2 places in zone2, 1 place in zone3 and 2 in zone4. 2 aircraft are assigned, A1, A2. A1 can fly faster. A2 is slower but farther than A1. Each day A1 can visit one location in any zone whereas A2 can visit 2 locations in any zone. what is the optimized number of visits by A1 and A2 at the end of 30 days.

Give m balls and n bins. Find out how many ways to assign balls to bins. Notice the buckets has no order. Like (1,2,3) and (3,2,1) are considered the same.
eg, m = 3, n = 2, return 2. (1, 2) and (3, 0)

Two Sum. Then follow up three sum

There is a web page which shows us a table which has products against their price, tax, discount, delivery time. There are about 20 products. There is a Database which has these same things. In your Selenium Test Automation Framework, how will you cross verify what is shown in the webpage correctly maps to the DB values for that product? Or just tell me how will you solve this problem, no need to write the code.

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.

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"}]

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.

Design a system like HackerRank/Codechef.

How is design review done?

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)

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

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)

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.

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?

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

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

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.

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.

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

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.

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

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.

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.

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.

encode a given decimal number in fibonacci series and return the smallest possible binary number

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

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.

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