CareerCup

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;
}

Please let me know if someone have given written test of Java for JPMC this year

How do the HR give negative feedback? After all the rounds which I believe I did well the HR executive responds that the director has left for the feedback. We will call you. How to understand this?

I am having a hard time understanding the calculations for time complexity/asymptotic analysis. I tried referring possible algorithm books I could i.e. Cormen, Steven Skiena and few others. I just don't want to memorize the time complexity of every algorithm to clear the interviews, but wish to understand how to come up with the time complexity.

Please let me know what is the best way to learn and understand time complexity.

I am applying a CS developer position at major IT companies. Although I have studied many available interview questions, I would like to have more in-person practices. If you are also working towards the same goal, we would help each other to practice more for better result. We can utilize a Skype or similar. Please let me know if you are interested. Usernamepi@outlook.com
Thanks.

I have three tables as mentioned below. I need to implement a basic search functionality where user will search for a keyword which could either match 'title' (from Proposal table) or 'msNumber' or 'description' (from Project table) and should match 'stageNumber' and 'newState' from ProjectLifecycle table.

create table Proposal (
proposalId LONG not null primary key,
title VARCHAR(75) null,
);

create table Project (
proposalId LONG not null primary key,
msNumber VARCHAR(75) null,
description VARCHAR(75) null
);

create table ProjectLifecycle (
lifecycleId LONG not null primary key,
proposalId LONG,
stageNumber DOUBLE,
newState LONG,
);

Below is the query which am using right now

SELECT
p.proposalId, p.title, pj.msNumber
FROM
Proposal p
JOIN
ProjectLifecycle pl ON pl.proposalId = p.proposalId
JOIN
Project pj ON pj.proposalId = pl.proposalId
WHERE
(p.title like '%%' or pj.msNumber like '%%')
AND
pl.newState=0
AND
(pl.stageNumber= 60.60 OR pl.stageNumber < 60.60 OR pl.stageNumber = 95.99);

The stageNumber and the newState conditions are working fine as expected but the keyword search isn't.

Please help me in finding where i'm going wrong

The input is the set of flights between various cities. It is given as a file. Each line of the file contains "city1 city2 departure-time arrival-time flight-no. price" This means that there is a flight called "flight-no" (which is a string of the form XY012) from city1 to city2 which leaves city1 at time "departure-time" and arrives city2 at time "arrival-time". Further the price of this flight is "price" which is a poitive integer. All times are given as a string of 4 digits in the 24hr format e.g. 1135, 0245, 2210. Assume that all city names are integers between 1 and a number N (where N is the total number of cities).

Note that there could be multiple flights between two cities (at different times).

The query that you have to answer is: given two cities "A" and "B", times "t1", "t2", where t1 < t2, find the cheapest trip which leaves city "A" after time "t1" and arrives at city "B" before time "t2". A trip is a sequence of flights which starts at A after time t1 and ends at B before time t2. Further, the departure time from any transit (intermediate) city C is at least 30 mins after the arrival at C
what approach will be best for solving this