CareerCup

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?

Reverse a linked list

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

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.

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

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

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

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

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.

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

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

Malware Bytes Customer Support Help 1/888/272/6111

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

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

Feasible Features of Malware Bytes Support 1/888/272/6111

Design a system like github.

Design a music streaming service like Pandora.

This anti - virus is known for its scanning and removal speed as far as entry of malwares spywares and viral attacks are concerned, but it often pops up with updating issues as updating bitdfender is a bit complicated technical task in case there is any problem to be resolved regarding update or any other issue connect at Bitdefender Support Number UK. For more info visit: http://antivirusphonenumber.co.uk/bit-defender.html

How to Contact Gmail Customer 1-833-995-8999 Service Phone Number ?

Where i can learn macros ?

Yahoo Sunnyvale onsite
A string s3 consists of multiple repetitions of s1.
Given s1 and another string s2, find if s2 is a substring of s3.
s3 = s1 + s1 + … + s1 = n * s1, where n is a positive integer 0.
For example
s1 = “aabc”, s2 = “caa” => true
s1 = “aabc”, s2 = “cab” => false
s1 = “aabc”, s2 = “caabcaa” => true

A city represented by a rectangular matrix is divided into plot of lands, and the cost of each plot is known. Find the largest rectangular area of land we can buy, within a budget B.

4 6 7
3 5 2
2 4 5

B = 16

Take an input and output the number of consecutive numbers in a row, or what you would say if you were to read it out loud ex input: 111222289 three ones three fours one eight one nine 31421819