CareerCup

There are two separate infinite sources of data. Data is arriving simultaneously into our system as two streams via two channels: Channel 1 and Channel 2.
    
The data could be of three types: R, G and B. 
 
Each data element should have two properties: channelNumber and uniqueID.
 
These three types of Data are arriving in a random sequence on the two channels.
 
Write a program which creates pairs of "same types" arriving on two channels in their "order of arrival".
 
For example, if a sample sequence is as follows:
Channel 1: R1_1 R1_2 R1_3 B1_4 B1_8 G1_5
Channel 2: B2_6 B2_8 R2_9 G2_10 B2_7 R2_20
 
Then the expected output is:
(R1_1, R2_9) (B1_4, B2_6) (B1_8, B2_8) (G1_5, G2_10) (R1_2, R2_20)

Hi, I recently interviewed with Amazon on-site and had an email response from a recruiter (first time hearing from that recruiter) saying they want to call in two days to discuss next steps. Doesn't say if it is an offer, neither does it say it is a rejection. Any ideas? Ever happen to anyone else?

In the first cracking the coding interview video Ms. McDowell talks about candidates that begin by writing test cases. How would one go about this? For example, the derivative problem would you create a list of Terms, pass it into derivative(), and write the expected solution before even writing the code? I'm thinking something along the lines of derivative([(10,50),(10,0)]) -> [(500,49), (0,0)], is this what she means?

Write a echo TCP client, connect the server interviewer provided and read metric from it.
(You write a client, they provide you server, you just read response from server thats all)

Two request types you can send to server.
1. STATUS
2. Throttle <number>

For example, you send a "STATUS" request to server and server respond back with

<num1> <num2>
0.0 0.0
num1 is your pressure on the paddle
num2 is your current speed

Status
>> 0.0 0.0 (means your current pressure is 0 and speed is 0)

Throttle 50.1
Status
>> 50.1 3.75
Status
>> 50.1 15.98

You can see the speed is increasing, its like driving car. The goal is to how to reach a constant target speed for example like 30

rearrange the characters of a string such that characters should not be at original position. Repeatation of characters is also allowed.
print "not possible" if it is impossible to arrange them.

I was recently asked this question in aptitute test:

Write a code to maximize the given expresion having +,- using greedy approach in O(n) and dynamic approach in O(n3).

For dynamic approach i thought we can make use of matrix chain multiplication.

I would like to know if any one has a better approach or code to solve this.

Describe the key advantages of HTTP/2 as compared with HTTP 1.1.

if i have 2000 records and exit when condition should be counter<500;
so if i have 2000 records so counter will be 2000/500 =4
loop will execute for 4 times
update statement should consist of
update tablename set counter=1 where rownum<500

this process continues until the update condition is met

Given an array numbered from 1 to N, you need to perform M operations. Each operation is described by 3 values a, b and k. Now, k is added for the range of values starting from index 'a' and ending at index 'b' in the given array. Now, After M operations, you have to calculate the maximum of the values in the array.
Initialize the array to '0' before starting to perform M operations.

Consider the number of elements (N) = 5
Number of operations to perform (M) = 4
When M=1,
a=1, b=2, k=100
When M=2,
a=2, b=5, k=100
When M=3,
a=3, b=4, k=100

Initially the array is 0 0 0 0 0

First operation 100 100 0 0 0

Second operation 100 200 100 100 100

Third operation 100 200 200 200 100

ANS 200

Hi Everyone.
I got a one hour technical phone screen (w/ hiring manager) scheduled for Cloud Support Associate position (for AWS support team) at Amazon. I’ve pasted the excerpt from the recruiter’s email:

Basic qualifications

· Monitoring and/or Troubleshooting of:
o OS Administration (Windows or Linux)
o Network Essentials (TCP/IP)
· Knowledge of Internet Fundamentals

Preferred qualifications
· Knowledge of Cloud Computing concepts
· Experience with AWS
· Experience in a service desk or network operations environment
· Experience with scripting / programing
· Experience with database administration

Do we have anyone who has already taken this interview?
What questions can I expect?
Any advice is greatly appreciated.

-Qin

Hello Friends,
Can anyone help me about ThoughtWorks Quality Analyst Questions ?

Thanks

- Basically would like to understand the design for ticket reservation system, for ex : movie tickets
- What are the different ways that we can avoid if multiple users trying to book the same ticket.
- What java collections can be used for the above usecase.

Consider the below usecase

- User A logged into the system at 10:00 AM
- User B also logged into the system at 10:00 AM
- Only one ticket is available
- Which java collection to use so that only one user gets the ticket.
- Is it required to use synchronization, without synchronization can't we achieve this by using only java collections.

Hey guys,

I had a 30 minute phone screen interview with Microsoft on 12/15/2015, the week before Winter break. It was a Tuesday. I still haven't heard back from the recruiter, although I have sent a follow up email.

Do you think they have not responded yet simply because it is the holidays? They were interviewing all the way to 12/18/2015.

Thanks

Michael

Hi,

I am having an interview coming soon for "Cloud Support Engineer Interview" with Amazon Web Services. I am having background working with Big Data technology stack like Hadoop and its ecosystem. I am not having hands on with networking or linux administrative side.

Has anyone recently given interview for the same or similar position with Amazon. What kind of question do they generally ask over phone. Any feedback or guidance will be appreciated.

Thanks in advance

There is a room where boxes are stacked. If the room is rotated 90 degrees to the
right, boxes will fall, affected by gravity. Finds out a box which will have the longest ‘fall distance’, and
output the value of the longest ‘fall distance.
like there are 26 boxes in total (7 + 4 + 2 + 6 + 7 = 26). After rotating, gravity
affects all boxes and final state becomes like the room on the right. Among these 26 boxes, a ‘fall
distance’ of box A is the longest as 7, therefore, return 7.
For reference, a ‘fall distance’ of box B is 6, and a ‘fall distance’ of box C is 1. Gravity begins to apply after rotation is finished.
Boxes are stacked being adjacent to one side of the wall, thus all boxes are located in a two
dimensional plane. There is no box which is stacked apart from the wall. The width of the wall is always 100, and the height of the wall is always 100.

Input
First line contains t, the number of test cases.
t test cases follow. Each test case has 2 lines. First line of each test case is n, the width of the
room.
Next line contains n space separated integers representing the number of boxes in each stack.
1<=t<=10
1<=n<=100
Output
The program should give output in separate line, for each test case
Sample Input
1
9
7 4 2 0 0 6 0 7 0
Sample Output
7

What is good or bad about the below?
<a href="javascript:void(0)" onClick="doSomething()">Click me</a>

We take 2 sets of integers to generate a third set with contains the xor of every element in the first set with every element in the second set.

Now as a problem we have been given the first set and the third set i.e. the set with xors, and we need to generate the second set.

You have been given of stream of integer find out the 1st non repeated integer.
example 21235 :here 1st integer would be 1,
123452134 : here the 1st non repeated integer would be 5.
Please let me know the solution to above question.

I am getting a bit confused with verbal (& fast) calculation of time complexities of recursive functions.
The substitution method & recursion tree method takes a lot of time and during interviews are not feasible options.
So I need help with fast and verbal calculation of recursive functions.

For eg.
The below method is called recursively.
Inside the method a for loop runs from 1 to n. And for each iteration the recursion is called twice.
How should the Big-Oh should be calculated?

compute(){
if(){
// some base case which terminates the recursion
} else {
for(1 -> n){
compute();
compute();
}
}
}


Thanks For Reading

Is there a better way to reverse an array of integers than the one below. Will using a stack perform better

int [] array = {2,5,7,8,9,10}
int startindex = 0;
int endindex = array.Length -1;
while(startindex < endindex)
{
int temp = array[startindex];
array[startindex] = array[endindex];
array[emdindex] = temp;
startindex++;
endindx--
}


Complexity : O(n/2)