CareerCup

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)

Find all triplet that sum to a given value in an array of integers, given that the array is too big to fit into memory

Design and implement a interest matching algo, to match people according to their interests in a particular area.
Suggest a score based on their interests. And rank matchings accordingly.

You are standing in the top-left corner of n*m grid. At each step you can only move up, down, right or left. Count the number of unique paths to the bottom-right corner of the grid (paths cannot cross themselves). The interviewer suggested that a backtracking solution is not the most performant one.

Given an undirected graph represented as a list of edges, find out the number of connected component.

Design a concurrent hashmap.

Please point me to the link if this has been discussed before.
They wanted design with code snippet of the classes.

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.

Reverse a linked list

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.

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