CareerCup

Is this the right way to login Online QuickBooks? I got this link for QuickBooks Online Login.
https://www.247quickbookshelp.com/QuickBooks-Online-Login

What is the best way to connect QuickBooks Technical Support Number 1844-722-6675?
https://www.247quickbookshelp.com/QuickBooks-Technical-Support

A coffee machine has three buttons (S, M, L). After pressing each button, the coffee machine will flow out of a range of coffee [s1, s2], [m1, m2], [l1, l2], but the outflow of coffee The amount is random. There is a cup with a total capacity of c2. There is a tick c1 on the cup. If the amount of coffee is [c1, c2], it is considered full.
After asking for a series of button operations, can the coffee be filled in [c1, c2] but not overflow?

Input like method stack trace: "main, start", "foo, start", foo, end", "bar, start", "bar end", "main, end", "main2, start", "main2, end"
Output String, such as the following format, to indicate the order in which the method was called and the hierarchy

main
       Foo
       Bar
main2

Given an array of n strings, sentences, where each sentences, consists of most w space-separated words, we want to perform q queries given by an array of q strings named queries where each queries consists of at most k space-separated words. To answer query queriesj, we find all the indices in sentences that contain every word in queries and assemble them into an array of indices listed in ascending order. For example, if all the words in queries are only found in sentences4, sentences9 and sentences2 , then the answer to queriesj is the array[2,4,9].

Input Format:
The first line contains an integer, n, denoting the number of Strings in sentences
Each line i of the n subsequent lines contains at most w space-separated words describing sentences
The next line contains an integer, q, denoting the number of strings in queries
Each line j of the q subsequent lines contains at most k space-separated words describing queries.

1) Sample I/P format:

3
jim likes mary
kate likes tom
tom does not like jim
2
jim tom
likes

O/P:
2
0 1

2) Sample I/P Format:

4
how it was done
are you how
it goes to it
goes done are it
2
done it
it

O/P:

0 3
0 2 2 3

Note: Solution in Java only

static void searchQueries(String[] sentences, String[] queries) {

}

Language : Java
Given a binary tree, print boundary nodes of the binary tree counter-clockwise starting from the root.
For example, boundary traversal of the following tree is “20 8 4 10 14 25 22”

20

8 22

4 12 25

10 14

public TreeNode{
int val = val;
TreeNode left, right;
public TreeNode(int val){
this.val = val;
}
given a tree and an API, delete a part of the nodes in the tree and return the forest formed after the node is deleted.
public List<TreeNode> deletenodes(TreeNode root, List<TreeNode> toDeletes){

}
example

1
 / \
 2  3
/  / \
4  5 6
If you delete the 2 and 5 nodes, you will need to return to the forest
[4,     1]
         \
          3
           \
           6

Question 2: Given a number 'k', return the corresponding row, given the pattern:
k => output
0 => []
1 => ["0", "1", "8"]
2 => ["00", "11", "69", "96", "88"]
3 => ["000", "111", "101", "888", ...] // and so on ...

Question 1: Given an input of an array of string, verify if, turned 180 degrees, it is the "same".
For instance:
[1, 6, 0, 9, 1] => return true
[1, 7, 1] => return false

How To Recover Gmail Account
If you facing any issue like hack Gmail account, forget Gmail password, reset Gmail password and more then you should contact to Gmail customer service number 800 674 2896 which is very reliable and known for its instant help by our expert technician. http://www.helpdeskphone.com/gmailpasswordrecovery/

how can i Netflix Password quality and password recovery Tool | ?? ...

How to recover your password of without phone number and email?

How do I recover my SBC Global Account password with a verification code number without a recovery email address?

We have a quote file with millions of entries. Design a system to read from the system and return a random quote always with O(1) time. We can read the file once and can keep in memory but should not re read the same. Also when you restart your system, it should preserve and work with O(1) complexity.

Design a system to forward 20% of your requests to cloud datacenter and rest to onprem data center. comsider you are fwd api.

Design S3 file storage system.

turns the following format string into a tree: node has keys, values, and subtrees.


For example, the first key is node1 and the value is ‘aaaa’


<node1>aaaaa<node2>bbbbb</node2><node3>cccc</node3><node4>dddd</node4></node1>

All Sim characters are loaded with the same copy of your software. Imagine two of these sims are positioned somewhere on a line that extends to infinity in both directions, left and right. Using the below interface, write a C# method called "Collide" that ensures that the two sims will collide at some point in the future. Remember, the code that you write will be deployed to each Sim. You cannot write code that will be deployed to one and not the other. The method should have no parameters. You do not need to implement the ISim interface.

public interface ISim
{
void MoveLeft(); // Moves the sim character one unit on the line to the left
void MoveRight(); // Moves the sim character one unit on the line to the right
void Relax(); // Commands the sim character to not do anything
void MarkPosition(); // Puts a mark on the line at the current position of the sim character
bool IsCurrentPositionMarked(); // Inspects the current position of the sim character for a mark and returns true if one is found, false if one is not found.
}

Jet.com

Print a matrix in zigzag traversal (diagonally).
For matrix
1 2 3 4 5 6
7 8 9 10 11 12
13 14 15 16 17 18
19 20 21 22 23 24

Print
1 2 7 13 8 3 4 9 14 19 20 15 10 5 6 11 16 21 22 17 12 18 23 24

Evaluate infix expression: 2 + 3 * 5

Interleave two singly linked lists into one.

LL1: 1 -> 2 -> 3 -> 4
LL2: 10 -> 20 -> 30 -> 40 ->50

Output LL1: 1-> 10 -> 2 -> 20 -> 3 -> 30 -> 4.
Note: Stop when we hit null for LL1.

Given: Collection of sorted (ascending) iterators which return integer value.
Implement hasNext() and next() methods in SuperIterator class that next() method should return sorted values from all iterators.
Note that we can't load all iterators to memory, because they might get values from big file (1TB for instance) and it will lead to OutOfMemoryError.

/*
    iter1: 1,  4,  5, 20, ...
    iter2: 2, 10, 12, 50, ...

    SuperIterator.next() method should return: 1, 2, 4, 5, 10, 12, 20, 50, ...
*/

interface Iterator {
    boolean hasNext();
    int next();
}

class SuperIterator {
    public SuperIterator(Collection<Iterator> iters) {
        
    }
    
    boolean hasNext() {
        //TODO
    }
    
    int next() {
        //TODO
    }
}

We say that a character is unique in string S if it occurs exactly once in it. For example, in string S = "ACAX", the only unique characters are "C" and "X".

Let's define UNI(S) as the number of unique characters in string S. For example, UNI("ACAX") equals 2.

Given a string S, calculate the sum of UNI(S') over all non-empty substrings S'. If there are two or more equal substrings at different positions in S, we consider them different.

Since the answer can be very large, provide it modulo 1,000,000,007 (109 + 7).

Write a function:

class Solution { public int solution(String S); }

that, given a non-empty string S consisting of uppercase letters, returns the sum of UNI(S') over all non-empty substrings S' of S modulo 1,000,000,007.

For example, given "ACAX", your function should return 16, as explained visually as follows:

UNI("A") = 1
UNI("AC") = 2
UNI("ACA") = 1
UNI("ACAX") = 2
UNI("C") = 1
UNI("CA") = 2
UNI("CAX") = 3
UNI("A") = 1
UNI("AX") = 2
UNI("X") = 1
Total: 16
Given "CODILITY", your function should return 96.

Assume that:

the length of S is within the range [4..100,000];
string S consists only of uppercase letters (A−Z).
Complexity:

expected worst-case time complexity is O(N);
expected worst-case space complexity is O(N) (not counting the storage required for input arguments).

Dropbox

Grid Illumination: Given an NxN grid with an array of lamp coordinates.
Each lamp provides illumination to every square on their x axis,
every square on their y axis, and every square that lies in their diagonal
(think of a Queen in chess).
Given an array of query coordinates,
determine whether that point is illuminated or not. The catch is when checking a query all lamps adjacent to, or on,…

Given a pyramid of consecutive integers:
1
2 3
4 5 6
7 8 9 10
11 12 13 14 15
16 17 18 19 20 21
......

Find the sum of all the integers in the row number N.
For example:
The row #3: 4 + 5 + 6 = 15
The row #5: 11 + 12 + 13 + 14 + 15 = 65

find longest common suffix of two linked list.

Design a system to support a pool of servers. The pool Api should be able to add a server, get a server (can be random) and delete a server from the pool.

You need to design and implement an interface for such pool.

The pool implementation should operate with a high performance so all operations need to be done in O(1).

March 2018 Phone Interview FB
Calculate a moving average that considers the last N values.
Circular Queue (Interviewer didn't agree with the linked list queue that I suggested at first. Said the pointers took space)

Design bookshelf class model to perform checkout of book operation

Tell me how to test whether the high-order bit is set in a byte?