I don't want to confuse you giving so much of materials and links except
this one website http://www.geeksforgeeks.org/
Just explore this site you've got all the stuff. Primarily focused on DS
and algo based interview questions, but also you can get a practice on MCQs
of other subjects like
Thanks all for solutions, but this problem can also be solved using DP
right ???
On Wednesday, 16 January 2013 01:57:26 UTC+5:30, Don wrote:
Sprague–Grundy theorem
On Jan 12, 6:28 pm, Nguyễn Thành Danh danhnguyen0...@gmail.com
wrote:
Can you please explain by which theorem you use to
, but why? The solution is n%3. DP will by more complex and
slower.
On Jan 16, 11:43 am, siva sivavikne...@gmail.com wrote:
Thanks all for solutions, but this problem can also be solved using DP
right ???
On Wednesday, 16 January 2013 01:57:26 UTC+5:30, Don wrote
consider there are N balls in a basket. 2 players play the turns
alternatively ..AT each turn,the player
can take 1 or 2 balls from the basket. the first player starts the game..
Both the players play optimally.
i) Given N,tell whether the 1st player win or loss ?
ii) If player 1
win
On Saturday, 12 January 2013 19:12:19 UTC+5:30, raunak wrote:
how is winning going to decided
On Sat, Jan 12, 2013 at 6:33 PM, siva sivavi...@gmail.com
javascript:wrote:
consider there are N balls in a basket. 2 players play the turns
alternatively ..AT each turn,the player
can
you can use suffix tree for this kind of problem.
http://www.allisons.org/ll/AlgDS/Tree/Suffix/
Thanks Regards,
Senthil S
On Fri, Feb 3, 2012 at 4:12 AM, Ravi Ranjan ravi.cool2...@gmail.com wrote:
Implement a MS key suggest like tool where on typing the first letters
will give a list of
Please look at the below link.
http://norvig.com/sudoku.html
The tutorial above gives brilliant explanation of how to use Constraint
Propagation with BackTracking to solve every Sudoku puzzle ever.
On Mon, Jan 30, 2012 at 6:46 AM, Don dondod...@gmail.com wrote:
For each group (either a row,
Consider that there are n (finite)individuals standing at different
points on a line.Now we need to find the meeting point of all the
n .They can move either left or right and every single step is added
to the output .
This same problem is extended for a 2D array. here they can move up
down
Post it in interviewstreet group
On Nov 17, 10:35 pm, Raunak Agrawal raunak.ra...@gmail.com wrote:
Hi All,
Please find the job description attached and let me know if anyone is
interested in any openings. And also please mention the post you wanna
apply for.
Some brief note about InMobi:
If you want ask for any interview or company related queries , kindly
join new group.
http://groups.google.com/group/interview-street
..Only ALGORITHM RELATED interview questions from any company will
be posted ...Kindly notify your friends too
For more details visit this thread...
Provide link for interview street in this same threadthe another
thread has been deleted it seems...
On Oct 9, 10:35 am, shady sinv...@gmail.com wrote:
well new group is already there so people can post job related questions,
book requests there... those who are genuinely interested in
I should definitely thank this group and all its members. This
group played a vital role in my placement preparations and surely it
was an excellent doubt clearing group.
To mention some instance I read about mutex and semaphore in many
sites which is not so good, but in this group, some of
at 7:35 PM, sagar pareek sagarpar...@gmail.comwrote:
cONGRATES
On Sat, Oct 1, 2011 at 7:34 PM, rahul sharma
rahul23111...@gmail.comwrote:
congrats buddy
On Sat, Oct 1, 2011 at 6:51 PM, siva viknesh
sivavikne...@gmail.comwrote:
I should definitely thank this group and all its
@rashmi .thanks of lot for sharing.It would be of great
help if u detail much about written test pattern and share the
questions whatever u remember...thanks in advance..
On Sep 29, 6:40 am, sush57 sushaant...@gmail.com wrote:
didsymanteccome to your col...how many did they
plz share the latest qualcomm questions and interview pattern if
anyone had attended
On Sep 25, 12:52 am, mohit mittal mohitm.1...@gmail.com wrote:
Hello yar,
Please share the written paper format and interview questions.
If dont want to display openly, plz share with my id
can u plz giv the sequence
On Sep 25, 11:36 am, Sanjay Rajpal srn...@gmail.com wrote:
yah rite answer would be 5 and 4 resp.
Sanju
:)
On Sat, Sep 24, 2011 at 10:04 PM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
5 4?
On Sun, Sep 25, 2011 at 9:33 AM, sivaviknesh s
plz give detailed explanation
On Sep 25, 1:58 pm, siva viknesh sivavikne...@gmail.com wrote:
can u plz giv the sequence
On Sep 25, 11:36 am, Sanjay Rajpal srn...@gmail.com wrote:
yah rite answer would be 5 and 4 resp.
Sanju
:)
On Sat, Sep 24, 2011 at 10:04 PM, Dheeraj Sharma
A 4-stage pipeline has the stage delays as 150, 120, 160 and 140 ns
(nano seconds)
respectively. Registers that are used between the stages have a delay
of 5 ns each. Assuming
constant clocking rate, the total time taken to process 1000 data
items on this pipeline will
approximately be
a. 120 us
.
On Sun, Sep 25, 2011 at 2:33 PM, siva viknesh sivavikne...@gmail.comwrote:
plz give detailed explanation
On Sep 25, 1:58 pm, siva viknesh sivavikne...@gmail.com wrote:
can u plz giv the sequence
On Sep 25, 11:36 am, Sanjay Rajpal srn...@gmail.com wrote:
yah rite answer would
Total Rounds: max 3.
1 written + 1 tech + 1 hr
Probably there might be a 2nd tech interview in case they are willing
to take you for the company and want to give you another chance to
prove yourself.
Tomorrow itself they'll complete the recruitment process and shortlist
the candidates.
Round
congrats :) and share ur experiences
On Sep 22, 11:28 am, rahul sharma rahul23111...@gmail.com wrote:
plz post the written test n interview question...thnx in advance
On Thu, Sep 22, 2011 at 8:59 AM, saurabh sah.saurab...@gmail.com wrote:
I sincerely thank this group as i got selected
for interview ques 1 ..
fink ak 's position using normal binary search in original list ..log
n
postion of a1 in corrupted list is n-k+1 .. O(1)
eg : original : 0 1 2 3 4
corrupted : 3 4 0 1 2
n=5, k=3 , hence the ans 2...correct me if m wrong
@ anup .. can u explain solution through
plz help 4 me..
Is thr any1 knw how to write the code in trust
calculation?...
On Thu, Sep 22, 2011 at 9:57 PM, Rajesh Kumar testalgori...@gmail.comwrote:
not working by changes provide by you
On Thu, Sep 22, 2011 at 9:42 PM, payal gupta gpt.pa...@gmail.com wrote:
has.
On Sep 22, 6:05 pm, Sahil Garg garg.sahi...@gmail.com wrote:
hey plz post ur experience??
Sahil Garg
Computer Engg. DCE
On Mon, Aug 8, 2011 at 8:43 PM, siva viknesh sivavikne...@gmail.com wrote:
not sure i m also gonna attend wit u only if u r from anna univ :P
On Aug 6
first round was mixture of c , cpp , very few general aps and few
subjective ques
print semicolon without using semicolon anywhere in program
2 trains in opposite dir...wat time they ll meet...
On Sep 22, 9:36 pm, siva viknesh sivavikne...@gmail.com wrote:
Interview Questions
hi
Informatica is coming to our campus in just five days.heard
it came to many north collegesthose who attended plz tell me d
pattern and ques u got in all rounds...
thanks in advance
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
thanks a lot guys..
On Sep 21, 10:17 pm, ravi maggon maggonr...@gmail.com wrote:
most of questions are already discussed. Search previous threads or my
posts.
On Wed, Sep 21, 2011 at 10:03 PM, vijay singh vijaysinghb...@gmail.comwrote:
It will be asking questions from C, C++ and DS
somebody plz reply...
On Sep 21, 10:53 pm, sivaviknesh s sivavikne...@gmail.com wrote:
for(i=0;in;i++)
for(j=0;ji*i;j++)
for(k=0;kj;k++)
sum++;
Is it n^5 log n . n * (n^2 log n) * (n^2 log n) ???
correct me if i m wrong? also anybody can tell some easy
somebody try to execute in linux and try to find the output...expected
output is 9but when first in ideone without \n in printf it showed
7 .. then with \n it showed 10... again with \n it showed 10 !!! ..
whether its prob with compiler or fork's execution is differing i'm
confused :(
On Sep
http://ideone.com/l5ek4 .. in this it had shown 6
http://ideone.com/Lj56O .. here 10
On Sep 22, 8:27 am, siva viknesh sivavikne...@gmail.com wrote:
somebody try to execute in linux and try to find the output...expected
output is 9but when first in ideone without \n in printf
if anybody knows other good online compilers try to post ... codepad
doesn't support fork
On Sep 22, 8:29 am, siva viknesh sivavikne...@gmail.com wrote:
http://ideone.com/l5ek4 .. in this it had shown 6
http://ideone.com/Lj56O .. here 10
On Sep 22, 8:27 am, siva viknesh sivavikne
expected op is 9 .. since on each iteration parent process gets
cancelled out (its pid 0 ) and child process alone prints hello ..
no chance of getting 10 or any other output .. correct me if m wrong !
On Sep 22, 8:31 am, siva viknesh sivavikne...@gmail.com wrote:
if anybody knows other good
@Dave ... thanks dude.So it should be O(n^5) .. am i right ??
On Sep 22, 8:19 am, Dave dave_and_da...@juno.com wrote:
@Siva: Work from the inside out, using the identities
sum from i = 1 to n (i) = n*(n+1)/2
sum from i = 1 to n (i^2) = n*(n+1)*(2*n+1)/6
sum from i = 1 to n (i^3) = n^2
thanks a lot guys...
On Sep 19, 7:22 pm, Don dondod...@gmail.com wrote:
This depends on rnd being a good pseudo-random generator. I don't
suggest using the RNG built into many compilers. Instead use something
like the Mersenne Twister which produces much better results with an
extremely long
Two registers A and B. Initial Contents of the registers are unknown.
Write a program to find MAXINT - The maximum positive unsigned integer
The instructions available are:
SHR reg1, op1
ADD reg1, op1
AND reg1, op1
NOT reg1.
Op1 may represent any number or register.
(Hint: The Shift operation is
Do post ur queries only in english...there are members from all over
India , even abroad...u may lose answers
On Sep 17, 2:13 pm, vivek goel vivek.thapar2...@gmail.com wrote:
HELLO FRIENDS,,,
PLEASE give me advice THAT agar *computer branch(B.E. or MCA) ka koi
student hai and
@prasanth I know this solution...Try giving with constraints
specified ...
only following operations are available...
SHR reg1, op1
ADD reg1, op1
AND reg1, op1
NOT reg1.
On Sep 17, 6:46 pm, prasanth n nprasnt...@gmail.com wrote:
let a and b be the two numbers
int temp,result;
temp=a-b;
of A
The result is that A is filled with 1-bits, giving MAXINT.
Dave
On Sep 17, 6:06 am, siva viknesh sivavikne...@gmail.com wrote:
Two registers A and B. Initial Contents of the registers are unknown.
Write a program to find MAXINT - The maximum positive unsigned integer
hi anyone at least provide code using file handling.i found this
ques from other site
On Sep 17, 6:35 pm, sivaviknesh s sivavikne...@gmail.com wrote:
you have to write a program which tell about how many times it has run. ex:
if you run first time it will print 1.
if you run second time
'' and SHR
operatorIs there any possibility with these instructions?
On Sep 17, 9:08 pm, Dave dave_and_da...@juno.com wrote:
@Siva: The problem clearly states that we are to find MAXINT - The
maximum positive unsigned integer. It doesn't say that we are to find
the maximum of any particular integers
thats a nice solution dave :)
On Sep 17, 9:26 pm, Dave dave_and_da...@juno.com wrote:
@Siva: Note that in 2-s complement arithmetic, -b = ~b + 1.
So a - b = a + (-b) = a + (~b + 1) = (a + ~b) + 1.
Thus, a - b can be written as
NOT B
ADD A,B // reading this as add B to A, i.e., result
http://in.careers.yahoo.com/students/content/186
check this .. it has visited many colleges including trichy NIT ..
contact them...kindly share ur experience after attending ...
On Sep 15, 8:09 am, Akash Mukherjee akash...@gmail.com wrote:
k...bt its a gud 2 weeks lefti guess der wud be sm
package ??
On Sep 14, 7:27 pm, Prachi Bhise prachi.bh...@gmail.com wrote:
Tech Mahidra is going to visit in my collage for recruitment.
Does anyone knows which type of question ask in written test and interview.
With Regards
Prachi Bhise
B.E (I.T)
Pune University
--
You received this
check the groupsi have posted some 5 mails ...those ppl ask those
same ques repeatedly ..if u prepare well and strong in basics of all
areas of CS mainly oops u can crack it
On Sep 14, 7:36 pm, amrit harry dabbcomput...@gmail.com wrote:
dey would only look for OPPS concept with proper
and also package??
On Sep 16, 12:24 pm, aashish bansal aashish.b...@gmail.com wrote:
and what is their shortlisting criteria?do they consider elitmus score
only or percentage as well?
On Sep 14, 8:01 pm, rahul sharma rahul23111...@gmail.com wrote:
they take elitmus test..and then
Hi
Symantec is comin to our collanyone if attended plz share
written pattern and interview ques...thanks
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To
is this company eligible for cse?? for what post?? package??
On Sep 14, 9:12 pm, jestincobol nair jestinco...@gmail.com wrote:
Has anyone attended schneider electric placement ?? if yes plz share ur
experience it is coming after 2 days to my coll.
--
You received this message because you are
can anybody plz tell SISO's package and are they recruiting for s/w
developer???
On Aug 8, 4:57 pm, MANNU manishkr2...@gmail.com wrote:
SISO in our college have 50 Apti questions (1 hr) and 20 tech questions, all
on c (in 30 mins).
Manish Kumar (Placed In SISO)
NIT DGP
FINAL YEAR.
--
You
package?
On Sep 13, 7:16 pm, abhinav gupta abhinav@gmail.com wrote:
NIT ALLAHABAD...
On Tue, Sep 13, 2011 at 7:45 PM, navneet kumar
kumarnavneet@gmail.comwrote:
which college??
On Tue, Sep 13, 2011 at 7:41 PM, abhinav gupta abhinav@gmail.comwrote:
any one plzz tell
it was a mixture of aptitude, probability based ques, unix, networks,
combinatorics and computer funda
On Sep 11, 3:52 pm, Deoki Nandan deok...@gmail.com wrote:
--
**With Regards
Deoki Nandan Vishwakarma
*
*
--
You received this message because you are subscribed to the Google Groups
Directi Questions
Interview Questions :
My interview questions(Anantharam)
1st round (coding) :
There is a drought situation in Agrabah.King got worried and called
Aladdin for helping him out. As he is a modern Aladdin he took
printouts of places around Agrabah from google maps.For
eligiblity seems to be somewat overwhelming ..its 9 nd above
cgpa! cs it ec .. 4.2 lpa
On Sep 9, 7:17 pm, vivek goel vivek.thapar2...@gmail.com wrote:
hey wat is its eligibility criteriaand whch branches allowed
and wat package..and profile
hi...which coll and package???...plz post the interview experiences
after attending ..thx
On Sep 8, 6:03 pm, htross htb...@gmail.com wrote:
please post the questions after the first round is over...
On Sep 8, 9:35 am, rahulmaximus rahul29ma...@gmail.com wrote:
what the pattern
watever test conduct ..watever interview they conducttopper will
be selected... tats all...a girl wit 9.9 cgpa was selected in our coll
nd no other !!!
On Sep 9, 9:58 pm, Kamakshii Aggarwal kamakshi...@gmail.com wrote:
dr's get shortlisted and den direct interview..no written test
On Fri,
On Sep 7, 1:10 am, htross htb...@gmail.com wrote:
its an online test which consusts of
1.logical ability
2.database concepts
3 algorithms
4 aptitude
On
Sep 6, 9:31 pm, siva viknesh sivavikne...@gmail.com wrote:
hi
anybody who attended plz share interview experiences and also
@parth U r banned
On Sep 6, 3:47 pm, parth panchal parthpancha...@gmail.com wrote:
hi neha how are you send me a nice mail of nature plz reply me i m online
now
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to
thanks a lot guys :)
On Sep 6, 11:48 am, Rajeshwar Patra rajeshwarpa...@gmail.com wrote:
pointer points to read only memory location
and this address is then compared whch evaluates to true
hence the output...
--
You received this message because you are subscribed to the Google Groups
hi
anybody who attended plz share interview experiences and also
written test ques
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email
plz mail me too once u ve attended
On Sep 5, 7:09 am, Akshay Rastogi akr...@gmail.com wrote:
Ditto harshit :)
On Sun, Sep 4, 2011 at 7:36 PM, sinjanspecial sinjanspec...@gmail.comwrote:
@harshit if u wl get EPIC paper pattern then plz forward it also to me
On Sep 3, 11:59 pm,
hi...kindly post the ques after u ve attended .. its coming for us too
next week
On Aug 31, 4:27 pm, htross htb...@gmail.com wrote:
NIT surathkal
On Aug 31, 2:30 pm, sukran dhawan sukrandha...@gmail.com wrote:
which coll?
On Wed, Aug 31, 2011 at 2:39 PM, htross htb...@gmail.com
hi
If anybody attended kindly plz share interview
patternthanks
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
will they ask electronics ques for CSE ppl also ??
On Aug 31, 6:49 pm, siva viknesh sivavikne...@gmail.com wrote:
hi
If anybody attended kindly plz share interview
patternthanks
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group
dave s algo is nice :)
On Aug 31, 10:09 pm, Dave dave_and_da...@juno.com wrote:
@Ashima: Scan all but the first row and the first column. If there is
a 1 in a row, set the first element of that row to 1. If there is a 1
in a column, set the first element of that column to zero. Now, set
any
@dave...additionally u ve to do this...checking the 1st row nd 1st
column...
if(a[0][0])
set both first row and first column;
else
for(i=1;in;i++)
if(a[0][i])
set first row;
else
set first column;
On Aug 31, 10:34 pm, siva viknesh sivavikne...@gmail.com
go through geeksforgeeks.org ... tat will give u a clear idea with
perfect explanations rather than reading these books
On Aug 27, 12:07 am, ankit arun talk.ankit...@gmail.com wrote:
Ya sure... :)
After posting it Igot even more confused...
On Sat, Aug 27, 2011 at 9:33 AM, siddharth
hi
If anyone attended interview from this company .. kindly share the
questions and experiences.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this
hi search this group.. u ll get lot of interview ques recently
attended for ms
On Aug 27, 10:58 am, rahul sharma rahul23111...@gmail.com wrote:
i joined this group yesterday...dATS y i posted..after psoting i
search for this but i got only questions n not the process...
thnx moiz 4 ur unfo.
hi
If anyone attended interview from this company .. kindly share the
questions and experiences.for CSE group what kind of ques they
ask?? .. Do they ask electronics ques also for CSE ppl ?plz
share
--
You received this message because you are subscribed to the Google Groups
first round - mixture of c cpp ques mostly with few aptitude ques...
for shortlisted people they asked simple ques like reversing LL ,
basics from c, cpp, dbms etc and simply people were
recruited..selected ppl told interview was very easy...
On Aug 18, 11:00 pm, ROHIT SINGHAL
search in this group itself .. there are gud questions with nice
explanations
On Aug 17, 7:27 pm, saurabh singh saurab...@gmail.com wrote:
Kindly suggest some references on forkI know what it is and how it
works.Its just that there are few programs related with recursion that
I have to do
hi .. Any idea about first round in EMC ? Do they concentrate on
general aptitude also or just fully c, cpp ??.. If anyone recently
attended plz share
On Aug 15, 11:23 pm, dexter does dxterd...@gmail.com wrote:
can anyone post EMC software sample questions and its pattern ASAP??
--
You
hi can u plz tell me in which areas of aps did they concentrate .. i
mean the topics...work and time, probability ..like thatthere were
c / cpp aps ???
On Aug 16, 7:11 pm, somya mishra somya.bvm...@gmail.com wrote:
no probs mate all the best
On Tue, Aug 16, 2011 at 10:01 AM, karthik
thanks a lot guys :)
On Aug 15, 12:32 am, SuDhir mIsHra sudhir08.mis...@gmail.com wrote:
2)
int main()
{
fork();
fork();
fork();
fork()
printf(Hello world!);
}
a.out─┬─a.out─┬─a.out─┬─a.out───a.out
│ │ └─a.out
For cpp buy test ur cpp skills by kanethkarits really awesome..u
can even buy a new book ..its worth
On Aug 15, 10:23 pm, priya ramesh love.for.programm...@gmail.com
wrote:
@mitra: can you plz mail the e book if you have??
--
You received this message because you are subscribed to the
not sure i m also gonna attend wit u only if u r from anna univ :P
On Aug 6, 7:44 pm, swetha rahul swetharahu...@gmail.com wrote:
Thanks Siva... Is it all MCQ or they ask us to code for a problem..??
On Sat, Aug 6, 2011 at 7:35 PM, siva viknesh sivavikne...@gmail.com wrote:
Paypal
is there any possible solution for O(1) space and O(n) time for
unsorted array?
On Aug 7, 11:45 am, Amol Sharma amolsharm...@gmail.com wrote:
@raghvan: take care of space complexityyou are using extra space that
too O(n) in worst case...
can be done in O(nlogn)
else it can be done in
MICROSOFT INTERVIEW QUESTIONS 2011
ROUND 1 :
Written Test Questions :
(1) Give the output of the following program
int main
{
char ch[]={‘1’,’2’,’3’,’4’,’5’};
char *p = (char *)(ch+1);
char *q = ch+1;
printf(“%d %c
congrats :) and do share your Interview Experience.
On Aug 6, 1:30 pm, shady sinv...@gmail.com wrote:
congrats harshal :) and do share your Interview Experience.
On Sat, Aug 6, 2011 at 12:15 PM, Harshal hc4...@gmail.com wrote:
Algogeeks is really awesome and very informative. I got a
...For developers position they said u gotta be an expert in linux ….
…u can use any programming language ..but I found shell found to be d
best…we were allowed to use man pages…
1.Prog shud take process name as input , display the memory occupied
by all the process under that.
2. Process should
my friend s experience who got selected...
Algo round:
1. Queue in O(1) solution.. I came up with a method and it was
not the most optimal one… and I asked if I shud optimize more.. he sed
he was happy with the solution I gave and proceeded to the next
question…
2. For eg.. if
Paypal is a subsidiary of ebay .. so i think mostly java .. SCJP
level !!
On Aug 6, 6:52 pm, swetha rahul swetharahu...@gmail.com wrote:
Hi,
Can anybody say what is the wriiten test pattern of paypal... :-)
What kind of questions are asked ??
--
You received this message because
ques ll be simple but they expect solid,secure,scalable, and
efficent code
.. for instance.. they asked merging 2 sorted LL..
.. ppl who forgot to check d simple condition...say ..
if(head==NULL)return; were eliminated
On Aug 5, 8:28 pm, raj kumar megamonste...@gmail.com
how it ll simply call the base class constructor ???
As far as i know .
if we give like.
class abc
{
abc(int i){.}
}
class def : public abc
{
def(int i,int j):abc(i)
{}
// by using like this only u can call base class
//constructor no ??? ..correct me if i m
Create a data structure where inserting, deleting and finding the
minimum element all have O(1) time.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this
using map ?? key - string , value - count..print d string whose count
is 1..
On Jul 19, 8:49 pm, pacific :-) pacific4...@gmail.com wrote:
sorry.
On Tue, Jul 19, 2011 at 9:07 PM, Shubham Maheshwari
shubham.veloc...@gmail.com wrote:
what is meant by unique string ...!!
A string
less value ... then set the min field to point
to itself else copy the min field of te previous head.
insertion and deletion is easy ... and I hope i dont need to expalin that
too ...
On Sun, Jul 31, 2011 at 12:27 PM, siva viknesh sivavikne...@gmail.comwrote:
Create a data structure
I think the exact question resembles as what ravinder kumar
saidAnd all these operations in O(1) time...ideas plz
On Jul 31, 5:21 pm, Ravinder Kumar ravinde...@gmail.com wrote:
Guys the real question is :
Design a data structure which support following operation
1. insertion of an
@DK.perfect explanation :)
On Jul 27, 8:14 pm, Rajeev Kumar rajeevprasa...@gmail.com wrote:
@All : very good article on this
:http://tech-queries.blogspot.com/2011/01/nuts-and-bolts-algorithm.html
On Wed, Jul 27, 2011 at 7:49 AM, DK divyekap...@gmail.com wrote:
@All: Please pay
No. rectangles in NxN matrix
... is it n^2 + (n-2) ??
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
oh...i forgot the case that a square is also a rectangle!!
On Jul 27, 11:48 pm, SkRiPt KiDdIe anuragmsi...@gmail.com wrote:
C(n+1,2)^2
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
main()
{
char str[80];
strcpy(str,junk);
scanf(%[^india],str);
printf(%s,str);
}
...input is gujarat.output is guj.plz explain how?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
a and prints the string scanned till then.
If the input is india , it matches at first location so it prints the
contents of str which is junk.
Now consider rajeev it will print r because of a at second position. and for
siva it will print s try it out.
Hope you understood the concept
ideone.com is also great
On Jul 26, 10:03 pm, Ram CEG honest...@gmail.com wrote:
ya it would ignore \ alone..
On Tue, Jul 26, 2011 at 10:27 PM, aditi garg aditi.garg.6...@gmail.comwrote:
ya thats wat my doubt was...if its not a recognised escape sequence thn how
is it interpreted??
http://geeksforgeeks.org/?p=767
On Jul 26, 11:49 pm, Pratz mary pratima.m...@gmail.com wrote:
how?
On 26 July 2011 23:18, ankit sambyal ankitsamb...@gmail.com wrote:
@vivin : Suffix trees are memory intensive..
This problem can be solved just by running 2 nested loops in O(1)
space and
-- Forwarded message --
From: jayapriya surendran priya7...@gmail.com
Date: Sep 29 2010, 9:41 pm
Subject: Directi question-centre of the tree
To: Algorithm Geeks
In graph theory, atreeis defined as a graph on N nodes,and (N-1)
un-directed edges such that there are no cycles in
Given two arrays
a[] = {1,3,2,4}
b[] = {4,2,3,1}
both will have the same numbers but in different combination.
We have to sort them . The condition is that you cannot compare only
elements within the same array.You can compare element of one array
with
another only.
On Jul 27, 8:45 am,
Given an array of integers, for each index i, you have to swap the
value at i with the first value smaller than A[ i ] that comes after
index i
for example array A = {3,7,4,9,10,2,1}
The Output array should be : 2 4 3 7 9 1 10
--
You received this message because you are subscribed to the
hi.
if anyone came up with amazon and direct-i interviews recently , plz
do post d ques...they are visiting our campus in 3
daysthanks ..
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
@ swetha.i dont reveal any placement schedule here.. i m
just asking ques so tat it wud help everyone...
On Jul 25, 7:22 pm, swetha rahul swetharahu...@gmail.com wrote:
Guys pls dont reveal the placements schedule of AU here... Hope u knw dat v
r instructed not to do so..
On
@sagarcan u plz post tat 20 ques whatever u
remembercoming friday we ve amazon interview...it d be of
great help bro :)
On Jul 24, 1:14 pm, sagar pareek sagarpar...@gmail.com wrote:
@ambika
20 questions of MCQ with negative marking
mostly C/DS
then 1-2 que of OS
then
1 - 100 of 147 matches
Mail list logo
