CareerCup

Given n number of persons in a park. One of them is having a virus. But we don't know whom. Also, the position of all persons is given. A contaminated person can spread it up to d distance. When the best case (Spread is minimum) and the worst case(Spread is maximum) would occur?e.g.
N=5
Position=[1, 3, 5, 9, 14]
d=5

Given a binary tree, find the maximum product path.
In other words, find the path inside the binary tree which has maximum product.

Sum of series (n/1) + (n/2) + (n/3) + (n/4) +…….+ (n/n). 1 <= n <= 10^12

You are driving a bus along a highway, full of rowdy, hyper, thirsty students and a soda fountain machine. Each minute that a student is on your bus, that student drinks one ounce of soda. Your goal is to drop the students off quickly, so that the total amount of soda consumed by all students is as small as possible.You know how many students will get off of the bus at each exit. Your bus begins somewhere along the highway (probably not at either end) and moves at a constant speed of 37.4 miles per hour. You must drive the bus along the highway; however, you may drive forward to one exit then backward to an exit in the opposite direction, switching as often as you like. (You can stop the bus, drop off students, and turn around instantaneously.)Describe an efficient algorithm to drop the students off so that they drink as little soda as possible. Your input consists of the bus route (a list of the exits, together with the travel time between successive exits), the number of students you will drop off at each exit, and the current location of your bus (which you may assume is an exit). How would you approach this problem

Write test Case for Amazon search plugin with a drop-down, search text box and submit button

Amazon website was working fine till yesterday.
//However in last 24 hours, the order processing(Delivery Estimates) has been taking longer than usual.

Write Test data for the program which finds the distance between 2 given character of a sentence.
// SAMPLE INPUT: findDistance("Ajay is here", A, h) => 10

Question 2) You have given a 2D binary matrix of size M[N-1][N-1]. Consider 1's as a
path and 0's as a deadend. The person starts from M[0][0] and needs to reach at point
M[N-1][N-1]. He can either move forward and down. You need to calculate the path to
reach the destination.

M[N][N] = 1 0 0 0
1 1 0 0
0 1 1 0
1 1 1 1

A Fibonacci sequence is defined recursively by:

F0 = 0
F1 = 1
Fn = Fn − 1 + Fn − 2, for integer n > 1.

One way of generalizing the Fibonacci sequence is by starting with any pair of numbers and extending to negative values of n.

Given two terms of a generalized Fibonacci sequence Fp and Fq, their positions p and q respectively and a position r, find Fr.

Input Format
The first line of the input contains an integer t denoting the number of test cases.

Each test case contains three lines.

    First line of each test case contains two space separated integers p and Fp
    Second line contains two space separated integers q and Fq
    Third line contains an integer r

Output Format

For each test case, print Fr which is the term of the sequence at position r.

If Fr is not an integer, represent it as an irreducible fraction in the form a/b where b > 0.
Sample Input


0 1
6 13
10
3 65
6 315
-10
0 11
1 -6
2
9 36
15 646
-5
11 72
20 5473
6

Sample Output

89
4620
5
-1/4
13/2

Create a table EMP with the following structure.


Name Type

EMPNO NUMBER(6)

ENAME VARCHAR2(20)

JOB VARCHAR2(10)

MGR NUMBER(4)

DEPTNO NUMBER(3)

SAL NUMBER(7,2)

Implement an algorithm that takes in a string containing a parenthesized expression and prints it out with all sibling expressions at the same indent level, each on its own line.

Definitions:
A parenthesized expression consist of an opening parenthesis, one or more expressions separated by one or more spaces, and a closing parenthesis.
An expression is either a word or a parenthesized expression.

Reinstall AOL Desktop Gold to avoid hitches

Examples:
(((abc))) --> abc
(ab(c)) --> ab(c)
(abc09%(c)) --> abc09%(c)
ab(c) --> ab(c)
(ab)c --> (ab)c
abc(c)) → INVALID
(abc)(def) --> (abc)(def)
(abc)typ(def) --> (abc)typ(def)
((abc)(def)) --> (abc)(def)

You are in charge of designing a small, in-memory social network, with the basic functionality of adding friendship
between two people via an AddFriendship function, and a GetSuggestedFriends function for a particular user in the
network. The criteria is to pick someone with whom the given user has the most number of friends in common.

Start by discussing the most suitable data structure, and implement all the objects and functions.

Write all possible scenarios for youtube app on your TV

Program to find the frequency of each element in the array OR write a program to count the occurrence of each number in a given string

text = 'ABCDEFGHIJ'
output = '"A""

Asked in Google - 2020, Goldman Sachs - 2020

Given two Array.
A = [1,3,4,2,5,6] B = [3,4,6,5,7]
we have to remove 3,1,2,6 and Insert 6,7 to make A equal to B.

we can delete and insert any element at anywhere from first array and make that array same as second array. Output is Minimum Number of elements required to be insert in first array.

constraints:
1 <= First Array Size <= 10^5
1<= Second Array SIze <= 10^5
1 <= firstarray[i] <= 10^9
1 <= secondarray <= 10^9
second array consist of distinct element.

Note : it is same as edit distance but here our constraints are 10^5.

Implement binary addition of two strings.
For example "101101" and "111101" equal "1101010"
You cannot use any type conversion, operate only with strings.

I was asked during a virtual onsite to design a chat server. I was interviewing for a senior software engineer position. Here are some of the requirements:
- real time communication.
- offline handling
- multi-device supports.

Luckily, I was well prepared for system design interview questions. Thanks to system design interview - an insider's guide book on amazon and system design primer. Still waiting for the response. Wish me luck!

find target in chess board with given start position of knight

Bob and Alice have teamed up on a game show. They won the first
round, allowing them access to a maze with hidden gold. If Bob can
collect all the gold coins and deliver them to Alice's position, they can
split the gold. Bob can move North⇆South or East⇆West as long as he
stays in the maze and the cell is not blocked. The task is to determine
the shortest path Bob can follow to collect all gold coins and deliver
them to Alice. If it is not possible, return -1.

You will be given an n × m array where each of the values ∈ {0, 1, 2}
representing open, blocked and open with a gold coin. Alice's position is
given as (x,y) = (row, column). Bob starts at the top left in cell (0, 0).


For example, maze = [[0,2,1],[1,2,0],[1,0,0]] with Alice at (2,2) is
represented as follows:

0 2 1
1 2 0
1 0 0

minMoves has the following parameter(s):
maze[maze[0][0],...maze[n-1][m-1]]: a 2D array of integers
x: an integer denoting Alice's row coordinate
y: an integer denoting Alice's column coordinate

Constraints
1 ≤ n, m ≤ 100
0 ≤ the number of coins ≤ 10
1 ≤ x < n
1 ≤ y < m


The first line contains an integer n, the numbers of rows in maze.
The second line contains an integer m, the number of columns in
maze.
Each of the next n lines contains m space-separated integers
describing the cells of each row in maze.
The next line contains an integer x.
The next line contains an integer, y.


Sample Input 0
3
3
0 2 0
0 0 1
1 1 1
1
1

Sample Output 0
2
Explanation 0
The shortest path Bob can take is (0, 0) → (0, 1) → (1, 1).


Sample Input 1
3
3
0 1 0
1 0 1
0 2 2
1
1

Sample Output 1
-1
Explanation 1
It is not possible for Bob to reach Alice, so we return −1.


Sample Input 2

3
3
0 2 0
1 1 2
1 0 0
2
1
Sample Output 2
5
Explanation 2
The shortest path Bob can take is (0, 0) → (0, 1) → (0, 2) → (1, 2) → (2, 2) → (2, 1).

Design a system to efficiently find 10 top selling products on an online shopping site at a given time with a time window of say 20 minutes.

Say, every second 100 products buy count getting updated.

Which data structure && algorithm would be the best to design such kind of systems ?

Given a array of integers find the index which partitions the array to two with high numbers and low numbers. For example [5, -1, 3, 8,6] the index 3 will partition the array to [5,-1,3] and [8,6] all the numbers in the second partition are greater than first. The solution has to work in O(n).

Given an n-ary tree and some queries for the tree, in every query you’ll be given a node you are supposed to print preorder traversal of the subtree rooted at that node.

You have an array of numbers. You have to give the range in which each number is the maximum element. For Example, If array is 1, 5, 4, 3, 6 The output would be
1 [1, 1]
5 [1, 4]
4 [3, 4]
3 [4, 4]
6 [1, 5]

Given an array of billion of numbers. Billions of queries are generated with parameters as starting and an ending index. Both these indices lie within that array. Find the maximum number between these two indices in less than O(N)

Multiply two numbers without using * and only be using bitwise operations

Display nodes of a tree in level order using DFS

Implement a deque using stacks