CareerCup

You have a binary tree which consists of 0 or 1 in the way, that each node value is a LOGICAL AND between its children:

0
   /   \
  0     1
 / \   / \
0   1  1  1

You need to write a code, which will invert given LEAF and put tree in a correct state.

Given n1, n2 is the number after removing one digit from n1. Example, n1 = 123, then n2 can be 12, 13 or 23.

If we know the sum of n1 + n2, and find the possible values of n1 and n2.

public List<List<Integer>> getNumber(int sum){
}

Design copy-on-write string class
e.g. stringclass s("abc");
stringclass s1 = s; // no copy
s = "bcd"; // copy

Design and implement an algorithm to assign an unlimited M number of messages evenly among N number of servers (N will not change).
Input to the algorithm
A message contains a message identifier and a text string. The algorithm will be fed one message at a time.
There are N numbers of servers (N will not change), each can be identified by a unique id.
Output of the algorithm
When the algorithm is called to process a message, it should output the id of the server that the message is assigned to.

Given an ODD number, print diamond pattern of stars recursively.

n = 5, Diamond shape is as follows:
  *
 ***
*****
 ***
  *

void print(int n){
}

/From the input array, output a subset array with numbers part of a Fibonacci series.
// input: [4,2,8,5,20,1,40,13,23]
// output: [2,5,1,8,13]
public static List<Integer> getFibNumbers(int[] nums){}

The number of valid combinations of a strings for given input array a[], where a=>1, z => 26, and 0 <= a[i] <= 9

{1,1,1} => {aaa, ak, ka} => 3
{1,1,0} => {aj} => 1

Can multiple threads improve the time complexity to merge k sorted arrays? If so, how?

Gives an array of unsorted int (may have negative number),
rearrange the array such that the
num at the odd index is greater than the num at the even index.
example
giving 5, 2, 3, 4, 1, one of the expected result is 1,4,2,5,3,
please solve it in o(n) time, where n is the length of the array
public void rearrange(int[] nums){

}

Given a string, find all possible combinations of the upper 
and lower case of each Alphabet char, keep the none Alphabet char as it is.
example1 s = "ab", return: "Ab", "ab", "aB", "AB"
example2 s = "a1b", return: "A1b", "a1b", "a1B", "A1B"
public List<String> getPermutation(String s){
	
}

Given a binary tree of integers, write code to store the tree into a list of integers and recreate the original tree from a list of integers.

Here's what your method signatures should look like (in Java):

List<Integer> store(Node root)
Node restore(List<Integer> list)

Example Tree:

5
/ \
3 2
/ / \
1 6 1

For a given array, find the subarray (containing at least k number) which has the largest sum.
Example:
// [-4, -2, 1, -3], k = 2, return -1, and the subarray is [-2, 1]
// [1, 1, 1, 1, 1, 1], k = 3, return 6, and the subarray is [1, 1, 1, 1, 1, 1]
try to do it in O(n) time
Followup, if input is stream, how to solve it
public int maxSubArray(int[] nums, int k) {}

find maximum contiguous subarray sum with size (the number of the element in the subarray) <= k
a brute force method is very simple, can you do it better?
public int maxSum(int[] nums, int k){
}

I want to learn some big words so people think I'm smart.

I opened up a dictionary to a page in the middle and started flipping through, looking for words I didn't know. I put each word I didn't know at increasing indices in a huge array I created in memory. When I reached the end of the dictionary, I started from the beginning and did the same thing until I reached the page I started at.

Now I have an array of words that are mostly alphabetical, except they start somewhere in the middle of the alphabet, reach the end, and then start from the beginning of the alphabet. In other words, this is an alphabetically ordered array that has been "rotated." For example:

String[] words = new String[]{
"ptolemaic",
"retrograde",
"supplant",
"undulate",
"xenoepist",
"asymptote", // <-- rotates here!
"babka",
"banoffee",
"engender",
"karpatka",
"othellolagkage",
};

Write a function for finding the index of the "rotation point," which is where I started working from the beginning of the dictionary. This array is huge (there are lots of words I don't know) so we want to be efficient here.

// Read4K - Given a function which reads from a file or
// network stream up to 4k at a time, give a function which
// which can satisfy requests for arbitrary amounts of data
private int read4K(char[] buf) {
// GIVEN
}

// IMPLEMENT:
public int read(char[] buf, int toRead) { }

Due to network latency, if the read4K method return a value < 4k, it does not necessarily mean that we reach the End of File (EOF), in this case, you should continue to read the file until you reach toRead or EOF.

given a graph: example -> A company holds 10% of B company’s share,
B company holds 5% of C company’s share, A company holds 2% of C company’s share,
what percent of C company’s share does A company hold?

// Design and implement key value system
//
// string -> string
// Insert a key-value pair or modify a value
void put(string key, string value);

// Delete a key-value pair
void delete(string key);

// Gets a value given a snapshot
string get(string key, Snapshot snap);

// Take a snapshot
Snapshot takeSnapshot();

// Delete a snapshot
void deleteSnapshot(Snapshot snap);

// put(k1,v1)
// put(k2,v2)
// put(k3,v3)
// takeSnapshot -> snap1 { k1 -> v1, k2 -> v2, k3 -> v3 }
// get(k1,snap1) -> v1
// put(k1,v4)
// delete(k3)
// takeSnapshot -> snap2 { k1 -> v4, k2 -> v2 }
// get(k1,snap2) -> v4
// get(k1,snap1) -> v1
// get(k3,snap2) -> XX
// deleteSnapshot(snap1)
// get(k1,snap1) -> XX

// Space efficient is more important than time efficient, thus please use as small space as possible.

Insert node with a given value in a circular sorted linked list.

Given list of N points find the K closest points to origin i.e((0,0)).

Given a mapping from digits to list of letters and a string of digits of arbitrary length determine all possible ways to replace the digits with letters.

Input Mapping = {

'1' → ['A', 'B', 'C'],

'2' → ['D', 'E', 'F'],

...

}

Avg length of map values - N

Input String = “12” - K
Expected Output = [“AD”, “AE”, “AF”, “BD”, “BE”, “BF”, “CD”, “CE”, “CF”]

Given a task sequence tasks such as ABBABBC, and an integer k, which is the cool down time between two same tasks. Assume the execution for each individual task is 1 unit.
rearrange the task sequence such that the execution time is minimal.
Example:
S = AAABBBCCC, K = 3
Result: ABCABCABC (all 'A's are 3 distance apart, similarly with B's and C's), thus return 9
S = AAABC, K=2
Result: ABCA_ _A, thus return 7
S = AAADBBCC, K = 2:
Result: ABCABCDA, thus return 8
public int rearrangeTasks(String tasks, int cooldown){
}

Given an array of n elements which contains elements from 0 to n-1, with any of these numbers appearing any number of times. Find these repeating numbers in O(n) and using only constant memory space.
Try to do it in one pass
example
[4, 2, 0, 5, 2, 0, 1] return: 0, 2
[1, 2, 3, 0, 0, 1, 3, 6, 6,6] return 0, 1, 3, 6
public List<Integer> findRepeat(int nums[]){
}

convert a ternary expression into a Binary tree structure.

     a?b:c 

       a
      / \
     b   c

  a?b?c:d:e

     a
    / \
   b   e
  / \
 c   d
class TreeNode{
    char val;
    TreeNode left;
    TreeNode right;
    public TreeNode(char val){
        this.val = val;
    }
}
 public TreeNode build(String s){}

try to do it in o(n) time complexity, n is the size of the string

Group a list of words so that the same group of words have a common substring, and this common substring is also in the word lists,
example
[cow "," cold "," an "," co "], return [[" can "," an "], [" cow "," cold "," co "]]
["can", "cow", "cold"], return [["can"], ["cow"], ["cold"]]
["c", "ca", "can"], return [["c", "ca", "can"]]

public List<List<String>> groupWords(String[] s)

Enter a two digit number, find the year closest to this year.
Example input 99, return 1999;
Input 15, return 2015.
public int getClosestYear(int input){
}

generate random number which differs from the number generated last time in the range of [min, max)
what is the best way to do it?
public int getNumber(int min, int max){

}

Given a undirected graph with each node representing a char and a word,
check if the word can be formed by any path of the graph

example
graph:
a--d--o--g--a--c--t
word : dog, return true;
word: cat, return false;

The same letter may not be used more than once.

class Node {
     char label;
     List<Node> neighbors;
     Node(char x) { 
        label = x; 
        neighbors = new ArrayList<>(); 
     }
}
class Solution {
    public boolean exist(List<Node> nodes, String word) {
        
    }
}

Given a Binary tree (Not binary Search Tree ), find the inorder suc­ces­sor of a node.

class TreeNode{
    TreeNode left;
    TreeNode right;
     int val;
    public TreeNode(int val){
        this.val = val;
    }
}

public TreeNode inOrderSuccessor(TreeNode root, TreeNode n) {

Given a positive integer n, find the no of integers less than equal to n, whose binary representation doesn't contain consecutive 1s.
eg:
I/P : 4
O/P: 4 (0,1,2,4 Valid)
public int count(int n){
}

Given an input string and a dictionary of words, find out if the input string can be segmented into a space-separated sequence of dictionary words.
Ex: "bedbathandbeyond" would be "bed bath and beyond" which are all dictionary words.