CareerCup

Design a log4j style logging library for a high throughput multi threaded application.

Parking lot problem: Given 3-dimensional parking lot, lets say, length width and floor. Implement following two methods:
void unpark(int i, int j, int k); where i, j, k are the parking coordinates.
void park(); The car should be parked in empty cell with lowest floor and between length and breadth prefer minimum length.Example, (3, 4, 2) is preferred over (1, 1, 3) as floor is 2 in first case. (1, 2, 3) is preferred over (2, 1, 3). (2, 3, 3) is preferred over (2, 4, 3).

Given an array find if array gets sorted by reversing any subarray of this array. Ex: In {1, 2, 3, 4, 8, 7, 6, 9} we can reverse subarray from index 4 to 6.

LLD for third party delivery vendor for registration and notification system.

Design gaming platform. A number of games can be hosted on this platform. User can login and select a particular game.

Design Meeting calendar system. Then there was discussion on various issues on it like scalability, what database should be used; SQL-NoSQL, concurrency etc.

You are given many files of 6 GB, each having stream of integers. You have space of 4 GB left in your main memory (mainly to swap out, swap in). You have to store sorted sequence of integers in all file in a other output file. How will you do that?

Design an authentication using AWS services like Api gateway and lambda.

Design an online chess game.

It supports 3 mode:
Player vs. AI
Player vs. player  (Offline)
Player vs, player (Online)

The questions asked were how will you assign a player to another player who wants to play. You need to think about how to divide your players into multiple groups of ratings, so that a newbie is not playing a grand master, rather with someone who is of his level only. Then the question was how will you design your system when a player comes in and say I want to play, and the max wait time is 1 min, you need to find a player suitable for his level

Design a movies reviews aggregator system. Data should be fetched from movie rating providers like imdb, rotten tomatoes, etc

Find the sum of n elements after a kth smallest element in BST. Tree is very large, you are not allowed to traverse the tree.

Design subscription based sports website which can display scores, game status, history for any games hld and lld

Consider an infinite stream of numbers. At any point print smallest k elements.

Given an array of integers(duplicates allowed) return if it is a set of contiguous integers or not?
Input: 5,2,3,6,4,4,6,6 Output: Yes (as it is from set of [2,3,4,5,6])

Given an array of integers with the property that arr[j] – arr[j-1] is either 1,0,-1 and a search value, provide an efficient search mechanism.

Given coin denomination of 3, 6 and 17, find the number of ways in which you can form a sum 'n'. How will do it for large numbers?

There is a huge road. Given are the following
- Array D that stores the distance from a starting point where billboard can be installed.
- Array C that stores the profit. C[i] -> profit if the billboard is installed at distance D[i].
- dist -> minimum distance to maintain between the billboards.

Assume you can install any number of billboards while maintaining a given minimum distance 'dist' between each of them. Find the maximum profit you can achieve.

Design an airport service that will be used to allocate a free runway when the plane is about to land. Data structure for the same. What if the runway is not available? Message passing between control centre and the plane. Focus on low-level design and code. Can the same runway be alloted to two different planes (locking)? Database storage needed?

A smart-set is a set of distinct numbers in which all the elements have the same number of 1s in their binary form. The set of all smallest elements from each smart-set
that can be formed from a given array of distinct positive numbers is known as the smartest-set.

So given an array of distinct numbers, outline the elements of the smartest-set in ascending sorted order.

Example
Let the array be {6 , 2 , 11 , 1 , 9 , 14 , 13 , 4 , 18}.
In binary form the set is {110, 010, 1011, 0001, 1001, 1110, 1101, 0100, 10010}.
The smart-sets are {1, 2, 4}, {6, 9, 18}, {11, 13, 14}.

The smartest-set is {1,6,11} as each element is the smallest element from each smart-set.

Input Format

The first line of input consists of an integer t. This is the number of test cases. For each test case,
the first line of input contains an integer n. Here n is the number of elements in the array. The next line contains n space separated distinct integers which are the elements
of the array.

Output Format

The output will space separated integer elements of the smartest-set in ascending order.

Constraints

0 < t < 1000 (This is the number of test cases
2 < n < 10000 (This is the number of integer elements of the array)
1 < Xi < 100000 (This is the size of each element of the array)

Sample input :
3
9
6 2 11 1 9 14 13 4 18
3
7 3 1
3
1 2 4
Sample Output :
1 6 11
1 3 7
1 please send me javascript code

Name the asset that is an accumulated visual asset and can be utilized as a foundation, title, or in other piece of the screen?

What do you believe are a few disservices of Android?

Tell me What Is the Google Android SDK?

Explain what is Android?

A graph has N vertices numbered from 1 to N. We have two lists. One list M consisted of edges between vertices. The other list K consists of restricted paths. We have to add edges one by one from M and check whether the addition of the particular edge leads to a path between the restricted vertices given in K. If it creates a path, we have to discard the edge.

Example: N = 4; K = {(1,4)}; M = {(1, 2), (2, 3), (3, 4)}. Here, addition of edge (3, 4) will create a path between 1 and 4. Hence we discard edge (3, 4)

You have given a string which consists of four characters {a,c,t,g}, find minimum length of unique substring which occurs only once.

Eg:

Input :
#1 aacc
#2 actg

Output:
#1 2 3
#2 1 4

Explain:

aacc -> {aa, ac, cc} are the smallest unique string with single occurrence.

why we need dua for love back ?

What sort of help will you be offered once your application is discharged?

Will I have the capacity to get to the application while it's in advancement?

How is the app going to be hosted?

What sort of help will I get all through the advancement procedure?