Thank you Navneet.
On Sat, Sep 3, 2011 at 8:34 AM, Navneet navneetn...@gmail.com wrote:
I had an offer from IBM ISL, but i did not accept it.
The interview is not very tough. They asked me standard questions like
detecting loop in linked list, level order traversal etc.
Though i appeared
Question:
Given: A singly linked list and a number 'n'.
Write a program, that will reverse consecutive 'n' nodes in the linked list.
Optimize for space and time.
Example:
Input:
Linked list: A-B-C-D-E-F
number 'n': 3
Output:
C-B-A-F-E-D
--
Regards
Reynald Reni
Masters in Software Engineering
Thanks for your blog post, *Shashank Mani * :)
On Fri, Aug 19, 2011 at 2:42 PM, WgpShashank shashank7andr...@gmail.comwrote:
Hi Mac, Problem Have Discussed Several Time across various forums ,here one
of the possible solution using Suffix Array in O(N^2)
Please note:
- Your OO design counts more marks, so, try to make use of well-known
design principles
- Your code should all easy modification. Eg: Dont use IF-ELSE.
- Change management and feature extension in your code should be
flexible.
In, Coding round you will be paired with
CTC: 5.8LPA
On Tue, Aug 9, 2011 at 12:19 AM, Ankur Garg ankurga...@gmail.com wrote:
How much thought work pays..Can any1 tell ?
On Mon, Aug 8, 2011 at 2:48 PM, vaibhav shukla vaibhav200...@gmail.comwrote:
@raj : its about to come to our campus too..questions hv been uploaded
already in
Sorry for the typo, Its Thoughtworks
On Wed, Aug 3, 2011 at 11:04 PM, Reynald reynaldsus...@gmail.com wrote:
Hi folks!
If any of you have Thoughworks flow questions, Coding rounds
questions, Technical interview questions kindly please share. Thank
you.
--
You received this message
Thank you Ramya.
On Wed, Aug 3, 2011 at 11:08 PM, ramya mv ramyamvasa...@gmail.com wrote:
-- Forwarded message --
From: ramya mv ramyamvasa...@gmail.com
Date: Wed, Aug 3, 2011 at 1:10 AM
Subject: Thoughtworks Problems
To: coder.du...@gmail.com
Hi,
See to
Shivnarayan, why should we add all Fibonacci number? Since 1+1 both digits
represent the same cow. I think the last Fibonacci is the answer.
I'm sorry if I'm wrong.
On Fri, Jul 29, 2011 at 12:53 PM, Hemalatha
hemalatha.amru...@googlemail.com wrote:
@Shivnarayan
As per the analysis from the
Rajeev, I think 'vmlinuz' file in /boot directory is the symbolic link to
kernel.
On Fri, Jul 29, 2011 at 9:45 AM, rajeev bharshetty rajeevr...@gmail.comwrote:
1 )System map in Linux is a Symbol table used by the kernel.
Mapping of symbol names and addresses.
2 ) IS it /usr/src/linux ???
Thank ya shiv, agarwal and Anders.
On Sat, Jul 30, 2011 at 8:10 AM, Anders Ma xuejiao...@gmail.com wrote:
anders@anders-Satellite-U400:~/puzzle$ cat novel_she_calf.c
#include stdio.h
/*
iIf a cow produces its first she-calf at age two years and after that
produces another single she-calf
Try this out, Venkat
a^=b^=a^=b; (XORing)
On Fri, Jul 29, 2011 at 11:09 AM, tech rascal techrascal...@gmail.comwrote:
one method is-
a=a+b;
b=a-b;
a=a-b;
is there any other method???
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
Congrats! Which team did pick you up? Global Customer Support, Dev or
Testing QA.
On Sun, Jul 24, 2011 at 9:57 PM, Rahul Menon menonrahul1...@gmail.comwrote:
I am placed! :)
On Jul 20, 9:43 pm, Reynald Suz reynaldsus...@gmail.com wrote:
Round-1 :Aptitude (OS, SQL, Data Structures Problem
Please post Thoughtworks question. Thanks.
On Mon, Jul 25, 2011 at 12:51 AM, priyanka goel priya888g...@gmail.comwrote:
if any1 can post Oracle Apps questions.. pl post...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
This code works perfectly. Try out with different test data.
int main()
{
//char str[]=qwertyuioplkjhgfdsazxcvbnm;
char str2[] = qwertyquejolpd;
int val, i;
int len = strlen(str);
int unique=1;
int checker=0;
for(=0;ilen;i++)
{
val = str[i]-'a';
if(
I tried in Dev C++,code-B executes infinitely. Why?
On Thu, Jul 21, 2011 at 4:13 PM, Gaurav Popli abeygau...@gmail.com wrote:
dont you think it is illegal using x=x-- or x=--x;??
On Thu, Jul 21, 2011 at 2:56 PM, karthiga m karthichandr...@gmail.com
wrote:
in code A using pr e- decrement
Sagar;s Algo works, thank you so much guys.
On Sun, Jul 17, 2011 at 3:41 AM, SkRiPt KiDdIe anuragmsi...@gmail.comwrote:
A pre-order traversal which is used to index the (min,max) pair value
at each level except the bottom-most level where all the entries are
to be printed. O(n) time O(log n)
Yep!
On Sun, Jul 17, 2011 at 1:02 AM, swetha rahul swetharahu...@gmail.comwrote:
@Reynald
Will 75 not be included in the tree that u have
given..??
On Sun, Jul 17, 2011 at 12:49 AM, sagar pareek sagarpar...@gmail.comwrote:
here is the code
void border(node*);
Hope this blog helps a little:
http://amazon-interview-questions.blogspot.com/
On Thu, Jul 14, 2011 at 12:36 PM, sinhanurag sinhanu...@hotmail.com wrote:
Can any one please post the questions they faced during Amazon campus
recruitment both online test and the interview rounds??
--
You
18 matches
Mail list logo
