CareerCup

Given a tree with n nodes and each node has 0 - n coins. The total coin number is n. Now we need to move the coins such that each node has exactly one coin. What's the minimum moves required? Each move can only move one coin to an adjacent node. (Notice it's not necessary to be a binary tree)

For example tree: 
1
|  \   \ 
0  1   0
|
3
will needs at least 4 moves.

binary search

It was a online coding round on software provided by samsung itself.
Given a graph print either of the set of the vertices that are colored with the same color. And if the graph is not bipartite print “-1”. Test cases also included the cases when a graph is not connected.
Note: No STL or other library functions were allowed

A company wants to fly in a total of 100 candidates for the interview. The company has two office location, one in NY and other in SF and max capacity at each location is 50 candidates. You are given the cost it incurs to fly in each candidate to NY and SF.

[500, 300],[540, 600],[550, 600],[300, 50]..so on

Write an algorithm for the minimum total cost?

Given the arraylist<meals> input, find the number of dishes with unique ingredients.

class meals{
        String cuisine;
        ArrayList<String> dish = new ArrayList<String>();
        meals(String s, String[] arr){
                cuisine = s;
                for(String i:arr){
                    dish.add(i);
                }
        }
    }

Example:
Input: [
{
"cuisine" : "American",
"dish" : ["lettuce", "cheese", "olives", "tomato"]
},
{
"cuisine" : "Mexican",
"dish" : ["lettuce", "cheese", "pepper", "tomato"]
},
{
"cuisine" : "French",
"dish" : ["lettuce", "cheese", "pepper", "tomato"]
},
{
"cuisine" : "Continental",
"dish" : ["lettuce", "cheese", "olives", "tomato"]
},
]

Output: 2

Because there are two unique ingredient-dishes; {Mexican, French} and {American, Continental}.

I have tried different methods, but could not get to the solution. Thank you!

Given a point and a radius r, draw a circle.

Design a portal for registration for a dog show

Find 2nd duplicate in an array

Given 2 sets of words. Find the words in 2nd set that begin with any word in the 1st set.

Largest Sum Contiguous Subarray

Given integer m and n where n is odd, for all mxn matrixes that consist of 0 and 1, find the one that has max count of 1s and meets following conditions:
1. All 0s are connected;
2. All 1s are adjacent to at least one 0 (Adjacent includes diagonal line adjacent, 8 directions);
3. maxtrix[m-1][n/2] = 0.

Example :

Input: m=2, n=3
Output: [[1,1,1],[1,0,1]]

Follow up:
Given another list of 'blocked' points. Matrix will set those points to -1 and you cannot change that. Solve the problem again.

What’s a feature you’d love to add to our product? (~1-3 sentences)

What’s one thing that excites you and one thing that bothers you
about the tech industry? (~2-4 sentences)

What were some characteristics of your favorite or ideal group of
people to work with? (~1-3 sentences)

What's the most helpful feedback you've ever gotten about yourself?
(~1-3 sentences)

What personality traits do you butt heads with? (~1-3 sentences)

What is idempotence and why is it useful for API design? (~2-6
sentences)

Looking at this function, what bugs do you see or concerns do you have
about its functionality? You can assume the models are correctly
{{defined, the schema is correct, etc. (~1-3 sentences)
def send_email_to_user_once!(to_user_id:, type:, subject:, body:)
user = User.find(to_user_id)
return if UserEmailLog.where(user_id: user.user_id, email: type).exists?
send_email(to: user.email, subject: subject, body: body)
UserEmailLog.create!(user_id: user.user_id, email: type)
end
def send_email(to:, subject:, body:)
# Makes a blocking network request to Amazon Simple Email Sender
# to send an email. Returns nothing in all cases.
# See this link for more info if you need it.
end}}

What does this Javascript ES6 function do and how is it useful? If you
had to give the function a name, what would it be? (~1-2 sentences)
{{
function operate(l, s, callback) {
a = s
for (let i = 0; i < l.length; i++) {
a = callback(a, l[i])
}
return a
}
}}

Your uncle grew up without a computer, grabs a fly swatter when he
hears the word “bug,” and still insists on faxing you things. How would
you explain the concept of an API to him, keeping in mind that most
technical terms will likely be foreign to him? (~2-12 sentences)

You are given a campus map with the Google buildings, roads and Google
bikes. You have to help the employee find the nearest Google bike.

Campus map:

. - Free path/road
# - Building
B - Google bike

Employee location - (x, y) - (1, 2)

. . . . . #
. . E . . #
# # # # . #
. B . . . .
. . . . . B

You are given a set of functions:

int open_port();
opens a serial port and returns 0 if everything ok (or -1 if error)

int read_port(char *buf, int buf_size)
which reads data from a serial port and stores it to 'buf' of size 'buf_size' or blocks until the data is available and returns the number of bytes read (or -1 if error occurred)

void close_port();
closes a serial port connection

Design a class:

class SerialConnection {
public:
     using ByteHook = std::function<void(char)>;

     SerialConnection(ByteHook callback);
....    
};

which should read data from the serial port asynchronously and send it to the callback function ByteHook byte by byte (e.g., for decoding).

Note that if you don't call 'read_port' often enough, the underlying system buffer might get full and some bytes will get lost..

Which data structures / sync primitives you are going to use ?

Given a binary tree, find the closest LEAF node to the target.

how much day take by adobe hiring team to respond after online test is completed? is worth to wait for there response? I have attended test on 30th July still I have not received any feedback.

Given two string check if they can be made equivalent by performing some operations on one or both string.

swapEven:swap a character at an even-numbered index with a character at another even-numbered index

swapOdd:swap a character at an odd-numbered index with a character at another odd-numbered index

Given : s="cdab" , x="abcd"
s -> cdab ->swap a and c ->adcb (swapEven)-> swap b and d (swapOdd) -> s="abcd" = x="abcd"

Given: s="dcba" , x="abcd"
no amount of operation will move character from an odd index to even index, so the two string will never be equals

Given: s="abcd" ,x="abcdcd"
x length to big so will never be equals

Given an array of lower case strings, the task is to find the number of strings that are special equivalent.
Two strings are special equivalent if they can be made equivalent by performing some operations on one or both string

swapEven : swap a character at an even-numbered index with a character at another even-numbered index

swapOdd : swap a character at an odd-numbered index with a character at another odd-numbered index


Input : arr = {"abcd", "cbad", "bacd"}
Output : 2
The 2nd string can be converted to the 1st by swapping
the first and third characters. So there are 2 distinct
strings as the third string cannot be converted to the
first.


string input[] = {"abcd", "acbd", "adcb", "cdba",
"bcda", "badc"};
ans =4

Given an array of lower case strings, the task is to find the number of strings that are distinct.
Two strings are distinct if they can be made equivalent by performing some operations on one or both string

swapEven : swap a character at an even-numbered index with a character at another even-numbered index

swapOdd : swap a character at an odd-numbered index with a character at another odd-numbered index


Input : arr = {"abcd", "cbad", "bacd"}
Output : 2
The 2nd string can be converted to the 1st by swapping
the first and third characters. So there are 2 distinct
strings as the third string cannot be converted to the
first.


string input[] = {"abcd", "acbd", "adcb", "cdba",
"bcda", "badc"};
ans =4

design an email job that would deliver high number of emails and will work on a really old and slow hardware.

how to design a system to fast lookup cars on the market according to the user's geo position.

Question : Given a set of N numbers [1,N], partition them into 2 disjoint subsets based on a set of K queries.
Each query is of the type (n1, n2) where n1 and n2 are distinct numbers from the set and n1 and n2
belong to opposite subsets.

Example:

Input:

Input:
N = 4
K = [(1, 2), (1, 3), (2, 4)]

Output:
Set 1 : (1,4)
Set 2 : (2,3)