algocircle

yeah this is good one , but i am not sure whether theie questions aasume all algo knowledge . or not.

one more easy problem el judge mipt: http://acm.mipt.ru/judge/problems.pl?problem=008&CGISESSID=

if(noOneIsThere) { head = you; waitForMoreToCome() } else { temp = ApplySomeSearchToFindTheHead(

i think since it is our first meeting lets discuss on how we are going to achieve depth in algos ,

but yes the idea of organizing a programming contest is good . On Wed, Sep 21, 2011 at 2:49 PM,

Carlsberg is enuf.....

I don't know the efficient solution. This question was asked from me by my friend. This problem

Then only solution is hashing....:)

have u missed anything in ur solution , it looks like there is something missing On Wed, Sep 21, 2011

yeah your solution is correct , its like replacing current node data with next node and then deleting

Here is my approach: Using example : 1->2->3->4->5->6->7---| |---------------------

correctamundo :) :) On Tue, Sep 20, 2011 at 8:56 AM, vishal <visha...@gmail.com> wrote:

Singly linked list... Without extra memory: Find center. Reverse second half of list.. compare with

This has lots of good problems on LL.. http://www.cs.ucf.edu/courses/cop3502/spr06/730/

http://www.chiark.greenend.org.uk/~sgtatham/algorithms/listsort.html This link has code and

1) linked list , stack , queues 2) Recursion techniques( this out of ds but we need it ) 2)binary

1)to find the union of 2 singly linked lists 2)to find the intersection of 2 linked lists

The answer: strcat(str,str2); strcat(str,str2); Find the occurence of the string str1....return the

if the only requirement is that order of finding min should be O(1). then using stl set set<int

in game programming and multimedia processing doubly linked list heavily used On Thu, Sep 15, 2011 at

and if i am correct the team who is going to win the contest would be; "citizens of world"

void SwapAdj(Node *Head) { if(Head != NULL && Head->link != NULL) { Node* temp = Head ;

hi all, now that we are through basics of linked lists , its time we start concentrating also on some

Sites : www.gild.com www.techgig.com Pls let me know....

1 and 3 :) -Avi

but i have one thing here it seems like apart from 5-6 members of this group , others are not as

I Really agree that STLs are very fast than normal codes we do.....But the amount of clear

Ya i left that case.....:)

I guess this is queue....so option (A) is more than enuf....;) By the third point u mean greater than

Sorry for my confusion with head......:)