CareerCup

Could any body plzz suggest me BlackRock placement papers which r before interviews..?I m not able to find..Its coming on campus for software eng post.

Dear all,

I am reading "Cracking the Coding Interview" at the moment. I am based in Switzerland and
I would like to ask if anyone here have any insights of what might differ in the application process in Europe with respect to the US.
I mean not only from the interview questions point of view, but also from the CV one.
I come from a finance sector background where, for example, lengthy CVs are appropriate (as opposed to shorter formats). But I am not sure if this also applies to companies like Google or Amazon in their European offices.

Any information will be highly appreciated.

Thanks,

Pablo.

I have a recent interview scheduled in amazon for Instant Video team. What type of question I can expect ( i.e. the main area to focus on .) .Kindly do revert some suggestion. Thanks in advance

Recently, An interviewer asked me to implement ConcurrentHashMap using basic Data Structures in Java.

The default implementation of ConcurrentHashMap in java is quite complex one.

Would you agree that it's unfair to ask such complex and lengthy question in an interview or Am I missing something ? Is there a simple way to implement ConcurrentHashMap in java using basic DS that can be written in 20 mins ?

Hello

Has anyone ever interviewed for a tech position at Nike? Would appreciate some help.

Cheers,
Jimmy Fallon

I've been working for a start-up for about 2 years (joined since the company started) and become senior software engineer in the company, which will get involved with some management stuff.

Now I have a Amazon SDE offer on my plate (Level 1). Should I quit my current job and accept Amazon's offer?

From salary stand point there is no comparison, my current salary just a half of Amazon's base salary.

If I'm going to start a start-up after 1 or 2 years, which will help me more. (e.g. experience).

I'm looking for job having just 2years of experience and trying to change domain (my school focus).
Should I prepare more on dynamic programming problems or focus on other area of algorithms?

Problem : There is a hill and few taps are present, all connected to other taps above/below, find which tap will be the last one to get water from a spring on the top of the mountain.

My Approach : Now I understand this is a connected graph problem. And by doing Breadth First Traversal we can get the last tap which will get the water.

Doubt : 1. Is my solution correct? If yes, then does BFT always gives the right answer? 2. Is there any other approach I'm not seeing?

Hello everyone,

I am looking for cpt ... I have an interview next week over phone regarding php/zend. Could anyone suggest what should I check must before interview. I am having 3 years experience in zend and 5 yrs in php.

Thanks ..

Hello
Sorry to ask this question as i am new here.
I pasted my code in between

and

but i am still unable to post.
What is the proper way ? Please help.

I have my google onsite interview in september 2015,I am a fresher and don't have any idea about troubleshooting. I would like to know how should I start and from where I should study troubleshooting so that I can clear my interview. I have good knowledge in DS and algorithms.

Hello everyone,

I am looking for a buddy to practice coding questions. Let me know if you are interested.

arun.nagari1985@gmail.com

Arun

Hey everybody,

I'm preparing for my interviews at Google & Facebook and into practicing with others. I couldn't find any practice buddies because my friends are not looking for jobs at the moment.
So, I'm looking for practice buddies for Skype / Google Hangout mock interviews.

I'm usually available around the evening hours in the Pacific time zone. Hit up the comments if interested!

Has anyone appeared for big data engineer interview in Verizon Recently .? If Yes, can you please share your experience

@locations.each do |location|
if y_lower_bound > location.y_coordinate
y_lower_bound = location.y_coordinate
end
if x_lower_bound > location.x_coordinate
x_lower_bound = location.x_coordinate
end
end
I am trying the above code, but at the end of loop it give me syntax exception.

can anybody provide me good link, tutorial , video link (anything) regarding DSA for basic & concept wise. Thanks.

Has anyone taken up the online assessment from amazon for 90 minute ? It was SDE position.

Following is problem 5.7 (under Bit Manipulation) in the 5th edition of Cracking the coding interview:

An array A[1..n] contains all the integers from 0 to n except for one number which is missing. In this problem, we cannot access an entire integer in A with a single opera-tion. The elements of A are represented in binary, and the only operation we can use to access them is “fetch the jth bit of A[i]”, which takes constant time. Write code to find the missing integer. Can you do it in O(n) time?

The algorithm applied is this:

1. Start with LSB.
2. Count occurrence of 1's vs 0's.
If count(1) < count(0) it means the missing number has a 1 as it's LSB, else it has a 0.
3. Remove all numbers with LSB not matching result found in step 3.
4. Repeat steps 1 to 4, and progressively checking the next LSB in each iteration.

Can someone explain the logic behind step 3? It basically removes all odd/even numbers from the current list (depending on the bit found for the missing number) and uses the modified list in the next iteration. Why do we do this?

A tree is called value balanced tree if for all nodes, sum of values (assume the values are integers) of nodes in left hand side is equal to sum of values in right hand side.

Given a complete binary tree find if it is a value balanced tree or not.
Test Case 1
3
1 1 1
Tree is value balanced
Test Case 2
7
3 0 -1 1 1 2 2
Tree is not value balanced
Test Case 3
15
22 2 4 -3 1 0 -4 4 4 2 2 2 2 4 4
Tree is value balanced

can it be done without creating tree data structure, solely from array?

Hi all I want to my method to return true if two node of un directed graph is connected,

Method print yes its connected but return false ?

public static boolean isConnectedGraph(int[][] graph, int start, int end,
int visited[]) {
visited[start] = 1;
if (graph[start][end] == 1) {
System.out.println("yes its connected ....");
return true;
}
for (int i = 0; i < graph[0].length; i++) {
if (graph[start][i] == 1 && visited[i] == 0) {
visited[i] =1;
isConnectedGraph(graph, i, end, visited);

}
}
return false;
}