CareerCup

Employee Salary Department
A 1000 IT
B 2000 IT
C 3000 IT
D 4000 HR
E 2000 HR
F 1500 IT
G 7000 HR
Write a query to get results like below -
Employee Salary Next highest salary(in same department) Department
A 1000 2000 IT
B 2000 3000 IT
.
.
E 2000 4000 HR

House No Members
1100 John, mary, kim, ash
1101 Dan, Roger, kee
Write a query to get in below format-
House No Person
1100 john
1100 mary
1100 kim
1100 ash
1101 Dan
1101 roger
1101 kee

If ( a = True){
If (b = True){
Approve credit card;
}
Else {
Disapprove credit card;
}
}
Else {
If(C=False){
IF(D=True){
Approve Credit card;
}
else {
Diapprove credit card;
}
}
}
Simplify above written code.

While designing a Table in database, how will you determine its performance?

Implement union and intersection of two array(in a efficient way).

Additional information given by the interviewer was: elements of the two given array may be repeated but cannot be repeated in union and intersection array.

/*
## Setup

The flow of a dispute is as follows:
- A charge is created by an end customer.
- Stripe receives a dispute record from the bank.
- The business responds with evidence.
- If no second dispute is received within 30 days after evidence submission, the dispute is won. If a second dispute is received, the dispute is lost.

Charge
(Maybe) Dispute Record
(Maybe) Evidence submission
(Maybe) Second Dispute Record

The raw tables generated from the API look like:

```
Charges
+---------------+-----------+
| charge_id | varchar |
| created | timestamp |
| amount | int |
| seller_id | varchar |
| customer_id | varchar |
+---------------|-----------+

Dispute Records
+----------------+-----------+
| dispute_id | varchar |
| created | timestamp |
| charge_id | varchar |
+----------------|-----------+

Evidence Submission
+-------------------+-----------+
| evidence_id | varchar |
| created | timestamp |
| charge_id | varchar |
+-------------------|-----------+
```
*/

/*

1. Can you design a unified dispute table that would allow us to compute things like the win rate, dispute rate, evidence submission rate etc?

*/

create a custom feature transformer in spark scala.Lets say dataframe is like below

+--------------------+ .
| email_list| .
+--------------------+ .
|testmail1115@gmail.com| .
|mavenmaven@mlail.com| .
|dnd.7899334622@gmail.com| .
+--------------------+ .
If i use the transformer it converts the input array of strings into an array of n-grams.like below:

+--------------------+--------------------+
| email_list| ngrams| .
+--------------------+--------------------+
|testmail1115@gmail.com|[t e, e s, s t, t...|
|mavenmaven@mlail.com|[m a, a v, v e, e...| .
|dnd.7899334622@gmail.com|[d n, n d, d...| .
+--------------------+--------------------+ .
How to get the distinct ngram present rather the pattern or array .

You have two files in hdfs one having date range with two columns start date and end date and another having two column with date and visitors field. You have to write a spark code which gives date range having maximum no. of visitors using that two files.

We have two sequences A and B consisting of integers, both of length N, and you would like them to be (strictly) increasing, i.e. for each K (0 ≤ K < N − 1), A[K] < A[K + 1] and B[K] < B[K + 1]. Thus, you need to modify the sequences, but the only manipulation you can perform is to swap an arbitrary element in sequence A with the corresponding element in sequence B. That is, both elements to be exchanged must occupy the same index position within each sequence.

For example, given A = [5, 3, 7, 7, 10] and B = [1, 6, 6, 9, 9], you can swap elements at positions 1 and 3, obtaining A = [5, 6, 7, 9, 10], B = [1, 3, 6, 7, 9].

Your goal is make both sequences increasing, using the smallest number of swaps.

Write a function:

public int minswaps(int[] A, int[] B);

that, given two zero-indexed arrays A, B of length N, containing integers, returns the minimum number of swapping operations required to make the given arrays increasing. If it is impossible to achieve the goal, return −1.

For example, given:

A[0] = 5 B[0] = 1
A[1] = 3 B[1] = 6
A[2] = 7 B[2] = 6
A[3] = 7 B[3] = 9
A[4] = 10 B[4] = 9
your function should return 2, as explained above.

Given:

A[0] = 5 B[0] = 2
A[1] = -3 B[1] = 6
A[2] = 6 B[2] = -5
A[3] = 4 B[3] = 1
A[4] = 8 B[4] = 0
your function should return −1, since you cannot perform operations that would make the sequences become increasing.

Given:

A[0] = 1 B[0] = -2
A[1] = 5 B[1] = 0
A[2] = 6 B[2] = 2
your function should return 0, since the sequences are already increasing.

Assume that:

N is an integer within the range [2..100,000];
each element of arrays A, B is an integer within the range [−1,000,000,000..1,000,000,000];
A and B have equal lengths.
Complexity O(N)

Given an array, find the number of tuple such that A [i] + A [j] + A [k] = A [l] in an array, where i <j <k <l.

There are three numbers a, b, and c. the product of any two numbers is equal to the third number. For example a*b=c or b*c=a or a*c=b. Then what are the possible a, b and c values?

Give you a 2xN board and two kinds of tiles: 1x2 (two squares across), 2x1 (two squares up) Ask how many ways you can fill the board.

**       **       *      *                                      
*         *        **   **

Follow up is the new four kinds of tiles: L shape in different angle, , ask you how many kinds of tiles are now six

give a binary matrix, 0 on behalf of the sea, 1 on behalf of the land, the val also represents the height of the altitude, if a cell is originally on land and is also surrounded by eight neighbor are on land, that cell become 2, each cell and its eight neighbor elevation cannot differ by more than 1. Return to the highest altitude can take altitude (special case is if the entire matrix is 1, then it is unlimited)

Give a weighted n-nary tree and find the longest path from the root node to the leaf node
    class Node {
        int id;
        // connected node id, edge weight
        Map <Integer, Integer> edges;
    }

Given a binary matrix, count the number of square that can be formed by all 0s

given a string p, called order, such as abc, means a in front of b, and so on
given a second string s, to determine whether it is follow the order of p, return boolean,
example If aaa return true,
If cba is false
If aaxyc is true, the letters that have not been seen in the order are skipped

MS FTE Question:

Find the gap from 1,2,5,6,10
Answer : 3,4,7,8,9

Design a system to find top 10 twitter hashtags in the most recent 1 min, 10 min, 1 hr

We have to merge a set of Intervals.How to decide if to sort them on start or end time? Which one is better to sort based on start or end time?

number_one = "193283492420348904832902348908239048823480823"
number_two = "3248234890238902348823940990234"

Question:
1) I need to multiply this and get the answer
2) DO NOT CONVERT TO INT AND DO THE MULTIPLICATION

I have two tables
Supplier Table:
Supp_id
supp_name

Invoice Table:
inv_id
supp_id
inv_date
inv_amt
payment_date
paid_amt

I want to list the invoice(s) that have highest invoice_amt for the year 2016.

DO NOT USE MIN/MAX function

Group by with having related questions. ER provided was customer table.

Find the % of all male customers in a specific area out of all the customers in that area.

Get total number of all the departments of each employees