## Recent Interview Questions

- 2of 2 votes
Given a string with alpha-numeric characters and parentheses, return a string with balanced parentheses by removing the fewest characters possible. You cannot add anything to the string.

- 1of 1 vote
Given a collection of two dimensional points and a number k, return the k closest points to (0,0) by Euclidean distance.

- 3of 3 votes
Search for a target value from a sorted array with unknown size.

- 0of 0 votes
how do Unable To Make Changes To Sbcglobal Account Settings?

- 0of 0 votes
my netflix device Troubleshooting Network Connection Issues? show me netflix tool free number how can connect there

- 0of 0 votes
my Comcast DNS issue - .com site not resolving ? plz share a tech support number tool free number

?

- -2of 2 votes
How do I report a problem with Facebook?Facebook Advertising Help, Tips & Support | Facebook for Business provide facebook help center number ?

- 0of 0 votes
Implement a method to check if a n-ary tree is unival

class TreeNode {

int val;

List<TreeNode> children;

TreeNode(int val) {

this.val = val;

children = new ArrayList<>();

}

}

- 0of 0 votes
Given the length and width of a rectangle, how many ways can be used to go from the upper left corner to the upper right corner (each step can only go to the right, top right or bottom right):

-follow up 1: If three points in the rectangle must be visited, how many ways

-follow up 2: If you are given an point H, and the path must go down below the H point, how to do it

- 0of 0 votes
Using Google BigQuery documentation, provide at least three (3) possible failure modes that could cause following customer problem:

""" I am ingesting data regularly in streaming mode into my mobile-events table, querying the data back however shows timestamps six hours behind. Please help. """

You can use public BigQuery documentation for the client side and make assumptions about the serving side based on your experience with other similar products, provided the serving stack spreads across multiple machines and microservices.

- 0of 0 votes
BIG DAT AND MACHINE LEARNING

Hi Cloud Support,

I have records like this in BigQuery:

logs.datetime: ''2017-07-01T13:51:03"

logs.type: "worker"

logs.message: "Starting pipeline"

apps.name: "reader_af45c9"

apps.log_type: "worker"

And I'm trying to run this query:

select logs.datetime, logs.type, logs.message, apps.name

from logs inner join apps on logs.type = apps.log_type

where logs.datetime > "2017-07-01T00:00:00" and logs.datetime < "2017-07-02T00:00:00"

group by apps.name;

But it's not working. Can you help me?

- 0of 0 votes
A sample state of ‘a’:

[[2, NULL, 2, NULL],

[2, NULL, 2, NULL],

[NULL, NULL, NULL, NULL],

[NULL, NULL, NULL, NULL]]

FUNCTION foo()

FOR y = 0 to 3

FOR x = 0 to 3

IF a[x+1][y] != NULL

IF a[x+1][y] = a[x][y]:

a[x][y] := a[x][y]*2

a[x+1][y] := NULL

END IF

IF a[x][y] = NULL

a[x][y] := a[x+1][y]

a[x+1][y] := NULL

END IF

END IF

END FOR

END FOR

END FUNCTION

- 0of 0 votes
Design a turn-by-turn application. Prioritize v1 features and tell why

- 0of 0 votes
The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each house has one and only one parent house. After a tour, the smart thief realized that "all houses in this place forms an n-nary tree". It will automatically contact the police if two directly-linked houses were broken into on the same night.

Determine the maximum amount of money the thief can rob tonight without alerting the police.

/**

* Definition for a n-ary tree node.

* public class TreeNode {

* int val;

* List<TreeNode> kids;

* }

*/

class Solution {

public int rob(TreeNode root) {

}

}

- 1of 1 vote
For two string a, b, their distance is defined as the number of positions at which the corresponding character are different.

Now you can swap characters at any two locations once, and ask how to swap to make the distance the smallest.

- 0of 0 votes
preorder Traversing a n-ary tree without using recurrsion

TreeNode<T> {

T val;

List<TreeNode> children;

}

- 2of 2 votes
Adobe (phone)

Return the value of the item k away from the end of a linked list

- 3of 3 votes
Find a byte array in a byte file.

For e.g.

finding arr = bytearray([3,4,5,3]) in byte file ([24,3,4,5,3,4,5,3,9, 255,...])

output: 1, 4, ...

since arr is found at idx 1, 4, ...

- 0of 0 votes
You have a 2 Dimensional Array.

1 2 3

4 5 6

7 8 9

Write code to generate all the 7 character strings without any duplicates starting from 4. You can move one block at a time and you can move either horizontally and diagonally. So for example, valid moves from 4 are 4 -> 1 and 4 -> 7. You can visit any node any number of times. so 4141414 is a valid string.

- 0of 0 votes
Given two methods for the person class, one to find a dad and one to find a mother, using these two methods to achieve a method to determine whether the two people are related to blood, assuming a limited number of people.

- 0of 0 votes
Self-implemented data structures and methods, output all the heirs. To achieve birth (parent, name), dead (name), getAllSucession (). There is a king, you can use birth plus children, dead dead. The order of inheritance is the same as preorder except that this tree has multiple children.

- 1of 1 vote
Given a string as input, return the list of all the patterns possible:

`'1' : ['A', 'B', 'C'], '2' : ['D', 'E'], '12' : ['X'] '3' : ['P', 'Q']`

Example if input is '123', then output should be [ADP, ADQ, AEP, AEQ, BDP, BDQ, BEP, BEQ, CDP, CDQ, CEP, CEQ, XP, XQ]

- 0of 0 votes
Longest increasing subsequence, Number of Island, Basic SQL questions like joins, select statement etc, Code for finding the Name in the document. Like based on the property of name (which cannot be written in small case). Find its frequency.

- 0of 0 votes
Design online movie ticket system. Hardware and software capabilities, improvements etc

- 0of 0 votes
A number of islands. All the rounds had basic DB questions

- 0of 0 votes
Basic DB questions like joins, aggregations, primary keys etc

- 0of 0 votes
Number of islands. Big(O).

- 0of 0 votes
In the doc file the "Name" without any dictionary. Like finding the property of the name as Starts with the capital letter. Then find the frequency of only names present in the doc. Whiteboard coding

- 0of 0 votes
Longest Increasing Subsequence

- 0of 0 votes
Online movie ticket booking system design