CareerCup

Find a pair that equals to the given target from the list of given two lists.
example:
input:
target = 7
list1= [[1,2],[2,4[,[3,6]]
list2 = [[1,2]]

Output:[[2,1]]

Explanation: There are only three combinations [1,1],[2,1] and [3,1], which use a total of 4,6, 8 respectively. Since 6 is the largest use that does not exceed 7, [2,1] is the only optimal pair.

Example 2:
Input :
target = 10
list1 = [[1,3],[2,5],[3,7],[4,10]]
list2 = [[1,2],[2,3],[3,4],[4,5]]

Output;
[[2,4],[3,2]]

# Given a set of strings, print them in Lexicographic order (dictionary/alphabetical order)
# Example,
# Input:
# “ABCDEF”, “AA”, “BEF”, “A”, “AABB”
# Output:
# “A”, “AA”, “AABB”, “ABCDEF”, “BEF”

Design a music streaming service like Pandora.

Given a number, rearrange the digits of that number to make a higher number, among all such permutations that are greater,one of them is the smallest, Find the smallest greater permutation (the next Permutation).

Examples:
next_permutation (12) = 21
next_permutation (315) = 351
next_permutation (583) = 835
next_permutation (12389) = 12398
next_permutation (34722641) = 34724126

First common Ancestor of Binary tree . Java Solution needed.

Class Node {

Node Parent;
Node LeftChild;
Node rightChild;
int val;
}

publlic Node firstAncestor(Node leftNode, Node rightNode){
// We don't get the root node here. From left and right child we need to find it's parent and find the lowest common ancestor.
}

Problem:

Insert + or – sign anywhere between the digits 123456789 in such a way that the expression evaluates to 100. The condition is that the order of the digits must not be changed.

e.g.: 1 + 2 + 3 – 4 + 5 + 6 + 78 + 9 = 100

I have below C solution - Can you please help me to convert to Java. I need this solution in Java.


#include<stdio.h>
#include<conio.h>
int findnumber(int i,int j)
{
int k;
int n;
for(k = 0; k < j; k++)
{
n = i % 3;
i = i / 3;
}
return n;
}
void main()
{
int i, j, k, current, result, operation;
clrscr();
for(i = 0; i < 19683; i++)
{
if(i%3 == 0)
continue;
current = 0;
result = 0;
for(j = 1; j < 10; j++)
{
k = findnumber(i,j);
if(k==0)
{
current = current * 10 + j;
}
else
{
result = result + (operation == 1 ? current : -current);
current = j;
operation = k;
}
}
result = result + (operation == 1 ? current : -current);
if(result == 100)
{
for(j = 1; j < 10; j++)
{
k = findnumber(i,j);
if(k==0)
printf("%d",j);
else
printf("%c%d",k==1?'+':'-',j);
}
printf("\n");
}
}
getch();
}

Language : java
Find the length of the non repeated numbers in an array.
Input : 1,2,2,3,4,5,6,2,3

Given an array of n strings, sentences, where each sentences, consists of most w space-separated words, we want to perform q queries given by an array of q strings named queries where each queries consists of at most k space-separated words. To answer query queriesj, we find all the indices in sentences that contain every word in queries and assemble them into an array of indices listed in ascending order. For example, if all the words in queries are only found in sentences4, sentences9 and sentences2 , then the answer to queriesj is the array[2,4,9].

Input Format:
The first line contains an integer, n, denoting the number of Strings in sentences
Each line i of the n subsequent lines contains at most w space-separated words describing sentences
The next line contains an integer, q, denoting the number of strings in queries
Each line j of the q subsequent lines contains at most k space-separated words describing queries.

1) Sample I/P format:

3
jim likes mary
kate likes tom
tom does not like jim
2
jim tom
likes

O/P:
2
0 1

2) Sample I/P Format:

4
how it was done
are you how
it goes to it
goes done are it
2
done it
it

O/P:

0 3
0 2 2 3

Note: Solution in Java only

static void searchQueries(String[] sentences, String[] queries) {

}

Language : Java
Given a binary tree, print boundary nodes of the binary tree counter-clockwise starting from the root.
For example, boundary traversal of the following tree is “20 8 4 10 14 25 22”

20

8 22

4 12 25

10 14

Design a system to support a pool of servers. The pool Api should be able to add a server, get a server (can be random) and delete a server from the pool.

You need to design and implement an interface for such pool.

The pool implementation should operate with a high performance so all operations need to be done in O(1).

Given the N*N matrix, find the given number in the matrix. All rows are sorted. And each row first element is less than the previous row last index.
input :

[1,3,5,7,9]
[11,13,15,16,20]
[21,22,23,24,25]
[30,32,35,40,45]

Given Num : 23

What is the best Optimal solution ? I have used BST but the interviewer asked to use any other which could do better in the above scenario.

Given the below input and ouput.

Input :
String[] input = {"hello", "world"};
output: (Higher count should come before and natural order)
hello : l=2, e=1,h=1,o=1
world: d=1,l=1,o=1,r=1,w=1

Given the below input and output and asked to write in Java.
Example 1)
input : {1,2,3,4, &, 12,13,14,15}
output : {15,14,13,12,1,2,3,4}

Example 2 )
input : {33,34,&,55,63}
output : {63,55,33,34}

Assumption : '&' will always be in the middle.