## Recent Interview Questions

- -1of 1 vote
Binance Support +1-800-571-6109 Binance customer service

- 0of 0 votes
Iam passing the graph in the Post request body as

{

"data":[

{

"source": "A", "target": "B", "distance":6

},

{

"source": "A", "target": "E", "distance":4

},

{

"source": "B", "target": "A", "distance":6

},

{

"source": "B", "target": "C", "distance":2

},

{

"source": "B", "target": "D", "distance":4

},

{

"source": "C", "target": "B", "distance":3

},

{

"source": "C", "target": "D", "distance":1

},

]

}

How can I save the graph in the database and used it for to find the shortest path between the nodes?

- -3of 3 votes
How to connect wireless HP printer to Laptop?

- -5of 5 votes
How to unblock Friends without Blocker users?

- -5of 5 votes
How to Facebook account hacked?

- -5of 5 votes
How Recover Facebook Account?

- 6of 6 votes
Given two two integer arrays. Find the longest common subsequence.

eg: a =[1 5 2 6 3 7], b = [5 6 7 1 2 3]. return [1 2 3] or [5 6 7]

- 2of 2 votes
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)

- 0of 0 votes
Given two arrays. One is for tasks (Processes) and each element depicts the amount of cores required to run the task. 2nd array is an array of CPU where each element depicts the no of cores in it.We have to tell how many maximum number of tasks can be allocated. Example: Task: [3, 5, 7], Cores: [1, 3, 5] . Here only task 0 and 1 can be allocated to CPU 1 and 2 . So, answer=2.

- 6of 6 votes
Give a binary tree, find if it's possible to cut the tree into two halves of equal sum. You can only cut one edge.

- 0of 2 votes
What is the best way to generate first N primes? (not primes up to N but first N primes)

- 0of 0 votes
We are given a list of N integers and another positive integer K. We need to compute the number of ways in which the product P of the

given N integers can be expressed as a product of K positive integers (not

necessarily distinct). The order of the factors in the expression is not

important. For example, 1 x 2 x 3 and 2 x 3 x 1 are not counted as different

ways of expressing 6 as a product of three integers.

Input Format

The first line contains two space-separated integers, N and K

The next line contains N-space separated integers

Output

One line containing the number of ways in which the product of the N

integers can be expressed as a product of K positive integers

Example:

Input

2 3

4 16

Output

7

Explanation

The product is 64. This can be expressed as a product of three integers in

the following ways:

1 x 1 x 64

1 x 2 x 32

1 x 4 x 16

1 x 8 x 8

2 x 2 x 16

2 x 4 x 8

4 x 4 x 4

- -3of 3 votes
Common problems in canon printer

- 1of 1 vote
What is quirk mode in browser? What happens in quirk mode?

- 1of 1 vote
In html5 how do to make Video in fullscreen mode?

- 0of 0 votes
Friend circle:

There are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct friend of B, and B is a direct friend of C, then A is an indirect friend of C. And we defined a friend circle is a group of students who are direct or indirect friends.

Given a N*N matrix M representing the friend relationship between students in the class. If M[i][j] = 1, then the ith and jth students are direct friends with each other, otherwise not. And you have to output the total number of friend circles among all the students.

Input:

[[1,1,0],

[1,1,0],

[0,0,1]]

Output: 2

Explanation:The 0th and 1st students are direct friends, so they are in a friend circle.

The 2nd student himself is in a friend circle. So return 2.

Input:

[[1,1,0],

[1,1,1],

[0,1,1]]

Output: 1

Explanation:The 0th and 1st students are direct friends, the 1st and 2nd students are direct friends,

so the 0th and 2nd students are indirect friends. All of them are in the same friend circle, so return 1.

- 0of 0 votes
Universal Lucky string:

All characters in S have the same exact frequency (i.e., occur the same number of times). For example, "aabbcc" is valid, but "baacddd" is not valid.

2. Deleting exactly 1 character from S will result in all its characters having the same frequency. For example, "aabbccc" and "aabbc" are valid because all their letters will have the same frequency if we remove occurrence of "c", but "aabbcccc" is not valid because we'd need to remove 2 characters.

- -1of 1 vote
Are you unable to print the document after giving print command from AOL Gold? If your reply is positive then you need to check the connection of cables and internet connectivity of your device. Before checking these make sure you have to download AOL Desktop Gold from official and site have completed the installation process.

Read More:- https://www.email-customer-support.com/aol-download/

- -1of 1 vote
Always install AOL Desktop Gold in your system after checking the system requirement and download the. exe file from its original website only. Make sure you have installed the latest available version. In this way, you can protect your desktop application from confronting any error or glitches be it desktop running slow or not working.

Read More:- https://www.email-customer-support.com/aol-download/

- 1of 1 vote
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

- 0of 0 votes
**Game of Bits**

Yale and Xavier are playing a game with numbers. Each round of the game starts with a number given to them by Zita, Yale’s little sister.

The number n is expressed as a binary integer with p bits

For every round, Xavier gets the first move.

The game came consists of moves performed by Yale and Xavier alternately.

The mth move of the game involves performing these operations on the number:

Toggling the mth bit (numbering of bits starts from left) of the number.

Toggling the left adjacent bit of m (if such a bit exists) if it is equal to the mth bit before toggling in step 1; otherwise keep it as is.

Toggling the right adjacent bit of m (if such a bit exists) if it is equal to the mth bit before toggling in step 1; otherwise keep it as is.

This modification of the number goes on until all p moves are made. If the modified number (as a result of all the operations) is

equal (or a distance one away) from the original number, then the person who made the last move wins the round; otherwise the other one wins the round.

**Note:**

The number given to them is converted to its binary form and represented with the help of minimum number of bits.

The numbering for the bits starts from the leftmost bit.

**Constraints**

1<=r<=10^6

1<=n<=10^6, where n is the number given by Zita in any round

**Input Format**

The first line contains a number, r, denoting the number of rounds in the game.

This is followed by r lines, where the ith line contains the number given by Zita for the ith round.

**Output Format**

The output of the problem has r lines, where the ith line contains the winner of ith round as X if Xavier wins ith round or Y if Yale wins the ith round.

**Sample Input**

1

11

**Sample Output**

Y

**Explanation**

11 is represented as 1011 using minimum number of bits in binary.

When Xavier makes the first move, it becomes 0011.

Then Yale makes the 2nd move and it becomes 1111.

After the third move made by Xavier, it becomes 1000.

After the last move by Yale, it becomes 1011 which is 11 in decimal.

The last move was made Yale and the modified number is equal or adjacent to 11,

therefore, Yale wins this round.

- 0of 0 votes
I want to implement a simple HTTP Denial-of-Service protection. There are clients that can send HTTP request to a Server (i.e. a GET Method of http://10.1.1.2:8080/?clientId=7)

if in an interval of 10 seconds more then 10 request comes from a specific client the 11th, 12th.. requests will get blocked. until 10 seconds from the first request will pass and then a new time windows of 10 seconds will be open. the idea is no more than 10 requests per 10 secs.

The time frame starts on each client’s first request and ends 10 seconds later.

I want to implement this logic on the server. Which data structures/collection/custom made object would you build to implement such a logic...

it is also important to have a threats safe solution.. and performances is also a factor here..

Thanks.

- 0of 0 votes
What are common table expressions? How are they different than temporary tables?

- 0of 0 votes
Write query to find second highest salary? Provide different queries to find using sql.

- 0of 0 votes
What is the difference between Interface and abstract classes? Give practical example from experience.

- 0of 0 votes
What are event emitters?

- 0of 0 votes
`Given a string “SELECT c1,… FROM (SELECT c2,… FROM (…) WHERE c2=v2,…) WHERE c1=v1,…”, format to the following by inserting "\n" and "\t": “SELECT c1,… FROM ( SELECT c2,… FROM ( … ) WHERE c2=v2,… ) WHERE c1=v1,…`

- 1of 3 votes
How do find out the top trendings products on a last hour/day/monthly basis?

Given that we have access to a real-time stream of sold product ids.

- -1of 1 vote
How to add chat plug in in any website

- 5of 5 votes
Give an array A of n integers where 1 <= a[i] <= K.

Find out the length of the shortest sequence that can be constructed out of numbers 1, 2, .. k that is NOT a subsequence of A.

eg. A = [4, 2, 1, 2, 3, 3, 2, 4, 1], K = 4

All single digits appears. Each of the 16 double digit sequences, (1,1), (1, 2), (1, 3), (1, 4), (2, 1), (2, 2) ... appears. Because (1, 1, 2) doesn't appear, return 3.