CareerCup

Hi Guys

I am looking for a study buddy as I am preparing for Software Development interviews. My areas of Focus is wide and people looking for various preparation areas are welcome to join me. Planned study planned period ranges between 15 days to 30 days. Not beyond this.

Areas of Focus.

Algorithms & Data Structure
Python and Frameworks - Flask/ Django
Hadoop/ Map Reduce/ Hive/ Pig/ Hbase/ Spark (Beginner)
Data Warehouse/ Business Intelligence/ Data Engineer.

Please comment on this topic and I would be happy to add you to my group.

Thanks

given 2 strings A and B. generate all possible solutions when B is merged in A.
Ex: A = "hey"
B: "sam"
then solutions are :

heysam,hseaym,hesaym,sahemy etc.

notice that order should be the same for both of strings while merging.

What is the market size of removalists in Brisbane, Australia?

Input: set of coordinates = [P1,P2,...,Pi,.....Pj,....Pn]

P denote Point(x,y)

Start point is any of set of coordinates like Pi
simily end point is also any of set of coordinates like Pj.
Find the shortest path with set of points between start and end points.

Let us have a simple example

Set of coordinates :
P4 P5 P6

P1 P2 P3 P7 P8 P9 P11 P12 P13

P10
Start Point: P2
End Points: p12
Output: P2,P3, P7,P8,P9,P11,P12

how can i solve this in java: i want my program to detect lucky numbers those are any numbers combined of numbers 7 or 4 or both ... the user is allowed to enter from 1 to 16 digit numbers.
EX: 7,74,474 are lucky however 73,470,754 are not.

how can i solve this in java: i want my program to detect lucky numbers those are any numbers combined of numbers 7 or 4 or both ... the user is allowed to enter from 1 to 10 digit numbers.
EX: 7,74,474 are lucky however 73,470,754 are not.

how can i solve this in java: i want my program to detect lucky numbers those are any numbers combined of numbers 7 or 4 or both ... the user is allowed to enter from 1 to 10 digit numbers.
EX: 7,74,474 are lucky however 73,470,754 are not.

Hello Everyone,

I recently received my EAD and looking for job as a DBA... Prior to that I worked as a Senior Analyst DBA and SME in Goldman Sachs, India... But, unfortunately, I've very little experience on SQL and Oracle servers... So, I'd like to learn SQL server and know the interview process for the companies here in Seattle... Any help is much appreciated... Thanks much again..

How would you implement a web logger?

Anyone preparing for Facebook interview. I have an interview in exactly 2.5 weeks. I feel bit nervous. If anyone willing to do online study with me for the same? Data structures and Algorithms programming practice? This is for Android dev interview but they said interview would be more like Computer science interview. Any help is much appreciated. Thanks

Anyone preparing for Facebook interview. I have an interview in exactly 2.5 weeks. I feel bit nervous. If anyone willing to do online study with me for the same? Data structures and Algorithms programming practice? This is for Android dev interview but they said interview would be more like Computer science interview. Any help is much appreciated. Thanks

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