<< Previous |
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
Next >>
To post a question, please login or sign up.
-
anonymous
Write code to find the largest sub-sequence sum in a list of integers (+ve as well as -ve)
(no answers yet)
-
anonymous
Design a web crawler.
(no answers yet)
-
anonymous
Asked to write exhaustive test cases for the above code fragment
(no answers yet)
-
anonymous
Asked to thoroughly test a given windows form.
(no answers yet)
-
anonymous
more architectural view about solve problem capability. I think the intervier was more realistic than the other two . Not just because he recommend to 2nd interview, since I also have the experience with recuriting other employees in the past. I felt the potenial is more than anything in work. Coding is just one thing , maybe the one who can solve the tricky algorithms is good in some way, but how about the one who has been out of school for several years and I cant remeber anything about mergesort or quicksort or how to find the shortest path blah blah. But I do have the confidence I am very good at work. No matter where I go, I found most people are not that smart and if you are willing to learn, you can be the best. Of course, you must have the potenial first. Like you are willing to learn and you like your job...
(no answers yet)
-
anonymous
Given a deck of nCards unique cards, cut the deck iCut cards from top and perform a perfect shuffle. A perfect shuffle begins by putting down the bottom card from the top portion of the deck followed by the bottom card from the bottom portion of the deck followed by the next card from the top portion, etc., alternating cards until one portion is used up. The remaining cards go on top. The problem is to find the number of perfect shuffles required to return the deck to its original order. Your function should be declared as:
static long shuffles(int nCards,int iCut);
(no answers yet)
-
anonymous
You have eight balls: seven are the same weight, and one is heavier than the rest. Given a scale that only tells you which side is heavier, how do you find the heavy ball?
(no answers yet)
-
anonymous
What's XD bit? How does buffer overflow work?
(no answers yet)
-
anonymous
Define "class" and "object."
(no answers yet)
-
anonymous
What features would you incorporate into the hotel functionality of expedia?
(no answers yet)
-
anonymous
String XMLEncode(String str). There are a few characters in XML that can't be represent and need to be replaced with a certain special string.
(no answers yet)
-
anonymous
Find first non-duplicate character in a string"abcda" -> first non-duplicate 'b'
(no answers yet)
-
anonymous
There are two large tree (not binary) having n nodes deep and m nodes breadth. (m,n are arbitrary). Again each sub nodes have multiple nodes. Find the similar nodes that have the same data in both the trees using any data structure. Also optimize your algo if there are duplicate values.
(no answers yet)
-
anonymous
How would you detect a repeated element in an integer array. Discuss various solutions and the order of the algorithm.
(no answers yet)
-
anonymous
[Round 2] {algorithm} There was a timed exercise which had patterns (and shapes) where you had to determine the next in the sequence. It was basically a bunch of logical puzzles to solve in 30-60 minutes (not sure the exact amount of time).
(no answers yet)
-
anonymous
For a balanced binary search tree find the number of leaf nodes for a tree with depth 10.
(no answers yet)
-
anonymous
Interviewer showed me a snapshot of their application UI and me how to test it
(no answers yet)
-
anonymous
Given the product that I currenly work on (web-based application), how would you test it
(no answers yet)
-
anonymous
Differentiate between Array and Linked List
(no answers yet)
-
anonymous
Plenty of behavorial questions like what would you do if you found a bug in piece of software that was from a different product group ? If you were short of time, would you release a product with lesser features but bug-free or with all the features but having bugs in them ?
(no answers yet)
<< Previous |
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
Next >>
