CareerCup

How to Cancel a Cash App Payment

Design a distributed key-value store that can perform the following
Store a set of attributes (value) against a particular key (k)
Fetch the value stored against a particular key (k)
Delete a key (k)
- Perform a secondary index scan to fetch all key along with their attributes where one of the attribute values is v.
Key can have a value consisting of multiple attributes.
Each attribute will have name, type associated (primitive types - boolean, double, integer, string) & type has to be identified at run time.

Ex -
1) Key = delhi has 2 attributes ( pollution_level & population)
2) Key = jakarta has 3 attributes (latitude, longitude, pollution_level)
3) Key = bangalore has 4 attributes (extra - free_food)
4) Key = india has 2 attributes (capital & population)
5) Key = crocin has 2 attributes (category & manufacturer)

Example of Secondary index:
Get all keys (cities) where pollution_level is high. Get all medicines by manufacturer (GSK)
So, in a nutshell, value must be strongly typed when defined.

Attribute
1. Attribute is uniquely identified by its name (latitude, longitude etc.
2. Data type of the attribute is defined at the first insert. (i.e. data type of pollution_level is set when key = delhi is inserted)
3. Once data type is associated with a particular attribute, it cannot be changed.
(i.e. free_food when defined takes type = boolean, hence, any key when using the attribute - free_food must allow only boolean values on subsequent inserts/updates)

Non-functional requirements

Highly scalable - Support for high throughput with very low latency
Highly available
Shared nothing architecture i.e. Support for Multiple nodes and each node is independent & self-sufficient.
Stretch - Smart client i.e. clients being aware of available servers & makes smart routing based on that available information.

TPM interview question. In this tech company, backend engineers quickly develop/ prototype and test new features with live data on the server by some framework, how do you extend a similar framework to mobile app developers as well to use such prototype features and validate with live data. It was a very abstract question. To me it sounded more like sandbox testing. The key requirement was to on the fly develop new features and test with live data. I spoke about prototyping engines, sdk for the backend service to be integrated to the mobile apps, and these apps could use the same canary rollout data or a backup of live data. There wasn't a definitive answer more of a thought process question. I mentioned nuances in mobile app context like less resources, pagination requirement etc. Appreciate if some one has been asked or familiar with a similar question and any responses are appreciated.

You are given a series of arithmetic equations as a string, such as:

y = x + 1
5 = x + 3
10 = z + y + 2
The equations use addition only and are separated by newlines. Return a mapping of all variables to their values. If it's not possible, then return null. In this example, you should return:

{
x: 2,
y: 3,
z: 5
}

Question: TPM interview question. In this big tech company, backend engineers quickly develop/ prototype and test new features with live data on the server by some framework, how do you extend a similar framework to mobile app developers as well to use such prototype features and validate with live data. It was a very abstract question. To me it sounded more like sandbox testing. The key requirement was to on the fly develop new features and test with live data. I spoke about prototyping engines, sdk for the backend service to be integrated to the mobile apps, and these apps could use the same canary rollout data or a backup of live data. There wasn't a definitive answer more of a thought process question. I mentioned nuances in mobile app context like less resources, pagination requirement etc. Appreciate if some one has been asked or familiar with a similar question and any responses are appreciated.

Design twitter trending topics feature to show trending topics in past 24 hours.

Q.1 Rather than separate T[1…m] into two half size arrays for the purpose of merge sorting, we
might choose to separate it into three arrays of size x%3, (x+1)%3, and (x+2)%3, to sort each of
these recursively, and them to merge the three sorted arrays. Give a more formal description of
this algorithm and analyze its execution time. Justify your answer with example.

Given two very large files – first contains Id and name, another one contains Id and address – you need to create 3rd file which will contain id, name, and address. -First, ask the clarifying questions and then tell the approach.

Two tables employee (contains name and Id) and employee details having work experience history (contains Id, fromYear, toYear) – find out all the employees who worked w/o career break.
Java implementation for the same.
From the same table list the name, fromYear, toYear for all employee.
Dependency Injection.
Design patterns which can be used.

VERY IMPORTANT C PROGRAMMING QUESTION. PLEASE HELP. DUE DATE: 19.05.2020 21:00 (I HAVE 7 HOURS TO SUBMIT QUESTION)
Your task is to find the given list of words inside a given character grid. The dimensions of the character grid will be 8 x 8. Each cell of the character grid will contain one of the capital letters in the English alphabet.

The inputs of the program will be as follows:

1) First, a 8 x 8 character grid will be given as input where each row will be given in separate lines. Each row of the character grid will be separated from other rows with a newline character ('\n') including the last row.

2) Next, the number of list of words to be found will be given as input in a separate line ending with a newline character.

3) Finally, the list of words to be found inside the character grid will be given as input in separate lines. Each word in the list will be separated from other words with a newline character ('\n') including the last word.



The properties of the character grid and the rules for finding the words are given as follows:

1) The number of list of words may be at least 1 and at most 15.

2) The length of each word in the list of words will be at least 3 and at most 8 characters.

3) Each word in the list of words may be located inside the character grid in any of:

a) horizontal which is left to right,

b) vertical which is up to down,

c) diagonal which either

i) starts at an upper-row-left-column and ends with a lower-row-right-column (e.g. a 3 characters length word "PIE "which starts at (1,2) and ends at (3,4) ),

ii) starts at an upper-row-right-column and ends with a lower-row-left-column (e.g. a 4 characters length word "FEEL" which starts at (2,6) and ends at (5,3) )

directions where each letter that compose that word should be located in the neighboring cells. The directions other than the given above will not be considered while searching any word inside the character grid.

4) When your program finds a word inside the character grid, the letters that compose that word should be substituted with the "#" character.

5) While searching words inside the character grid, you should consider that a character inside the character grid may be reused to find more than 1 word. Check the sample run for a concrete example.

6) All the words in the list of words will be available on the character grid.

7) All the words inside the list of words will be distinct.

8) A word inside the character grid will appear only once in the character grid: It is not possible to find any word more than one location inside the character grid.

9) When the list of words is input by the user, the order of the words IS NOT necessarily an alphabetical order.

10) The word is guaranteed to be found inside the character grid if you search in all (vertical, horizontal or diagonal) directions.



Your program is expected to output the final modified version of the character grid where all the words in the list are substituted with "#" in the character grid and the remaining letters are left as is. Similar to input format, each row of the modified character grid will be printed in distinct rows separated with newline character ('\n') including the last row as output.


Sample Run

----------

Input:

AWESOMEA

DEKTTADR

DZLZQUOC

RPEYRMDL

EEAEAPRY

SFFNQBDA

SSFTMASN

AWESOGER

5

ADDRESS

STUDY

LEAF

ROMAN

AWESOME



Output:

#######A

#EKT#AD#

#Z#ZQ##C

#P#YR##L

#E#E#PR#

#F##QBDA

#SFTMASN

AWESOGER



Explanation of Sample Run:

The following character grid is input by the user:

AWESOMEA

DEKTTADR

DZLZQUOC

RPEYRMDL

EEAEAPRY

SFFNQBDA

SSFTMASN

AWESOGER



The number of list of words is 5

The list of words are:

ADDRESS

STUDY

LEAF

ROMAN

AWESOME



The row and column numbers of the character grid are written below to follow the explanations, clearly.


0 1 2 3 4 5 6 7
0 A W E S O M E A
1 D E K T T A D R
2 D Z L Z Q U O C
3 R P E Y R M D L
4 E E A E A P R Y
5 S F F N Q B D A
6 S S F T M A S N
7 A W E S O G E R






1. The letters of "ADDRESS" are found in the zeroth to the sixth row, all in column 0. These letters are substituted with the "#" character. Then, the modified character grid becomes as follows:

#WESOMEA

#EKTTADR

#ZLZQUOC

#PEYRMDL

#EAEAPRY

#FFNQBDA

#SFTMASN

AWESOGER



2. The letters of "STUDY" are found in the diagonal of (0,3),(1,4),(2,5),(3,6),(4,7) where the numbers in the parenthesis represent (row, column) numbers, respectively. These letters are substituted with the "#" character. Then, the modified character grid becomes as follows:

#WE#OMEA

#EKT#ADR

#ZLZQ#OC

#PEYRM#L

#EAEAPR#

#FFNQBDA

#SFTMASN

AWESOGER



3. The letters of "LEAF" are found in the second to the fifth row, all in column 2. These letters are substituted with the "#" character. Then, the modified character grid becomes as follows:

#WE#OMEA

#EKT#ADR

#Z#ZQ#OC

#P#YRM#L

#E#EAPR#

#F#NQBDA

#SFTMASN

AWESOGER



4. The letters of "ROMAN" are found in the diagonal of (1,7),(2,6),(3,5),(4,4),(5,3) where the numbers in the parenthesis represent (row, column) numbers, respectively. These letters are substituted with the "#" character. Then, the modified character grid becomes as follows:

#WE#OMEA

#EKT#AD#

#Z#ZQ##C

#P#YR##L

#E#E#PR#

#F##QBDA

#SFTMASN

AWESOGER



5. The letters of "AWESOME" are found in the zeroth to sixth column, all in row 0. These letters are substituted with "#" character. Notice that 'S' in row 0 is used both for the words "AWESOME" and "STUDY". Also, 'A' at (0,0) is used both for the words "ADDRESS "and "AWESOME". Since there are 5 words, there is no word remaining to find in the character grid. Hence, your program should print the final version of the grid given below on the screen, where each row will be separated with a newline character ('\n') including the last row.



#######A

#EKT#AD#

#Z#ZQ##C

#P#YR##L

#E#E#PR#

#F##QBDA

#SFTMASN

AWESOGER

Love Life Problem Solution

Given a binary matrix of size M * N. You are given H and V where H denotes the number of horizontal cuts and V represents number of vertical cuts. You need to find whether you can make H and V amount of cuts such that each submatrix formed after the cuts will have equal number of 1. E.g.

4 5
1 1 1 1 1
0 0 1 1 1
0 1 1 1 1
1 0 1 1 1
Given H=1 and V=3, we can make 1st horizontal cut after 2nd row and 3 vertical cuts after 2nd, 3rd and 4th column such that each of the sub matrix will have equal number of 1s.

| ----------------|
| 1 1 | 1 | 1 | 1 |
| 0 0 | 1 | 1 | 1 |
| ----------------|
| 0 1 | 1 | 1 | 1 |
| 1 0 | 1 | 1 | 1 |
| ----------------|

Given a remote having 0-9 digits, plus button (to increase channel), minus (to decrease) and previous channel button (to go to previous channel). We were given 2 numbers stating start and end channel number and an array having various channel numbers. The task is to go to all channel numbers given in array with minimum number of clicks.

There is a dictionary already implemented. Write a method , which takes input String without space, to replace the characters from the strings which are not present in dictionary with –

Example: Dictionary – a*
………….Input- aaabaa
………….Output- aaa_aa

Failure to get my money back from Cash App due to authentication? Get support.

I was asked the following question in an interview recently, which was a lot more vague and after asking clarification questions came down to this:
```
We have to perform N tests [1, 2, ... N] but in randomized order.
We have access to two functions test(x) and rand(x) which both take an integer.
test(x) returns if the current test was succesful or not and rand(x) returns a random integer
from 1<= rand(x) <= x.
The tests fail because of the sequeunce of tests carried out and we want to figure out which
sequences are bad and which sequences are good.
Basically our task is to generate a sequence of test while carrying them out and return the
sequence either when the test failed or when all tests are done.
```
I understand that the problem could be simplified by calling rand(N) just once, say x = rand(N) then we get the xth permuation of the seuence (1...N) and then call the test() function on this sequence reutrning only the part of sequence that finished successfully, this is deterministic and can be done in O(N) time.
Is there a better approach / solution in Python?

write a BASIC program to compute cube root of numbers between 1-50

What are the steps to get my Roku account?
First, activate your Roku device by completing all the initial set up. Once done, visit the Roku page and enter the required credentials to create the Roku account. After this step, you will get the account activation steps on the screen. enter the code on the Roku site and activate your Roku account

Smallest string

You are given the following :

1. Two strings S and T each of Length N
2. K Pairs of integers L(i) and R(i) (0 <= l(i) < R(i) <= N-1)

You can perform any of the following two operations any number of time.

1. You can replace the character of string S at the ith position with the character of string T at the ith position
2. You can select from any provided K pairs and you are allowed to swap characters at position L(i) and R(i) in string T

Now, you are required to perform all the operations optimally so that string S can be lexographically smallest.

All characters of S and T are of lowercase English letters and there are only two ways to perform all the operations either(111...1) then (2222...2) or (2222...2) then (1111.1)

Input Format :

1. First line contains number of test cases:
2. Second line contains the lengths of string and the number of pairs of integers.
3. Next two line contains S and T two strings.
4. The next K lines contains the space separated integers.

Sample Input :
1
8 4
abagfiab
cbacbcda
0 1
1 2
3 4
4 5

sample output : aaabccaa

You are given a list of n people and also a list of m pairs who know each other.

Here is an example input:
List of people: x1, x2, x3, . . . , xn
People who know each other: (x1, x2),(x1, x4),(x2, x4),(x2, x5),(x2, x6),(x4, x5),(x4, x6), . . .

1. Given a positive integer k, write an integer program that finds k people among the given n people with
the maximum number of pairs who know each other. How many variables and constraints are there?
2. Write an integer program that finds the maximum number of people where everyone knows each other. How many variables and constraints are there?

You are given 2 arrays: one representing the time people arrive at a door and other representing the direction they want to go(in or out) You have to find at what time each person will use the door provided no 2 people can use the door at the same time. Constraints: the door starts with ‘in’ position, in case of a conflict(2 or more people trying to use the door at the same time), the direction previously used holds precedence. If there is no conflict whoever comes first uses the door. Also if no one uses the door, it reverts back to the starting ‘in’ position. Should be linear time complexity.

Given a board game of N x M size. A domino is of size 1 x 2 and can be rotated to make it 2 x 1. A player can place a domino in any of the available position. When a player is not able to place a domino, he loses. An AI is created to play against the user. The AI selects a random position in the board and places the domino there. Improve this AI. What solution will be the best when board size is small and what if the board size is large.


Anyone has any idea how to have a solution to this problem?

You have to find out the number of good strings of length N characters in size which you can make using characters A B and C.

A string is a good String if it satisfies the following three criteria:

The total number of C in the string should not be greater than equal to 4.
There should not be more than two consecutive A's in the string.
Any two B's should be at least two characters apart.

How do I find total possible good strings for N length string?
Time constraint of 1 sec for large N

Java:
Managing extreme sports locations:
In such locations, are period of the year when this actities can be performed(ski December - February, Kiting May August, ATV all year), each sport /location usually has an average cost/day.
The sports have hierarcal structure and countaind the country, region and city, we need an ADD, REMOVE, UPDATE; GET a location and all its informations.
exemple:
Switzerland:
Zurich:sky(dec, feb), price 12 $
Berna:ATV - all time , price 10$

how to snake & ladder game

Write a c program to simulate Bankers algorithm for the purpose of deadlock avoidance.

Write a program to create a file and open it in read write mode . Take the input (your choice) from the user . Also display the the last 17 character of the input on the terminal.

Implement Producer - Consumer problem using semaphores

WAP to create two threads . One threads check whether
the number is even or odd while the second threads finds factorial of a numbers.

Why Google Duo Not working on iPhone?