Re: [algogeeks] Openings in Mentor Graphics,Noida Location

Banned for spamming. Again a request to the members to post algorithm related queries. Stuck in some programming problem? Post it here. Not understanding some algorithm? Post it here. Found an interesting problem? Post it. On Tue, Nov 17, 2015 at 10:04 AM Ashish kumar Jain

Re: [algogeeks] Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr

Banned for spamming. Again a request to the members to post algorithm related queries. Stuck in some programming problem? Post it here. Not understanding some algorithm? Post it here. Found an interesting problem? Post it On Mon, Nov 16, 2015 at 8:56 AM shashi kant wrote:

[algogeeks] Re: [BANNED!!!] Urgent need Lead - Java Developer in Atlanta, GA

FYI, have banned this user and several others who mistook this group for a recruitment platform. Can we revive the legacy of this group again? On Mon, Nov 2, 2015 at 11:36 PM Shaik Asif wrote: > Hi Partner, > > This is Shaik from Deegit Inc. Partner find the below

Re: [algogeeks] Re: [BANNED!!!] Urgent need Lead - Java Developer in Atlanta, GA

ndra A C <sachindr...@gmail.com> > wrote: > >> Well, you need to ban a whole lot more people. >> >> On Mon, Nov 2, 2015 at 10:16 AM, saurabh singh <saurab...@gmail.com> >> wrote: >> >>> FYI, have banned this user and several others who

RE: [algogeeks] Yo! Help me make a Music Video

Nope. Forwarding this mail to a group with over 1 k members is definitely begging. It's shameless begging as it can get. No,Didn't bother to open the link. Also banning you from the group. -Original Message- From: Shrey Choudhary choudharyshre...@gmail.com Sent: ‎12/‎28/‎2014 4:52 PM

Re: [algogeeks] C++ initialization list

specific thing. The language doesn't advocates it. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sun, Sep 28, 2014 at 3:47 PM, sagar sindwani sindwani.sa...@gmail.com wrote: Thanks Deepak and Rahul for the reply. Do you guys have any standard document

Re: [algogeeks] Solving equation

^ No its not invalid. It just represents an equation with infinitely many correct solutions depending on the domain of x. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Mon, Jan 27, 2014 at 4:21 PM, Amol Sharma amolsharm...@gmail.com wrote: i din't get

Re: [algogeeks] perfect square condition checking....

Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sun, Dec 23, 2012 at 9:07 PM, Anil Sharma anilsharmau...@gmail.comwrote: no matter how much large number is still,how large?If it fits in long long int then using binary search we can check this is O(log n

Re: [algogeeks] Regex tester

If you need to implement this for some project then python and java have a very nice library Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sun, Dec 23, 2012 at 7:48 PM, shady sinv...@gmail.com wrote: http://stackoverflow.com/questions/13144590

Re: [algogeeks] how does this code achieve SIGSEGV

segmentation fault. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sat, Dec 22, 2012 at 10:52 AM, Saurabh Paliwal saurabh.paliwa...@gmail.com wrote: I am afraid both of you are incorrect.. 1. since the code modified by you will compile but give sigsegv

Re: [algogeeks] Re: Adobe Interview Question

^ *Exactly,* Things are the *same all around the globe *in terms of hiring procedure for programming positions. However I don't understand *this is India *part? Kindly reply only *when you think you are contributing something to the community.* Saurabh Singh B.Tech (Computer Science) MNNIT

Re: [algogeeks] Adobe Interview Question

of permutations that begin with 0 from this number. Since any factorial in the denominator part will be less than or equal to (len)! we can calculate and store them while calculating len! Hence the overall operation will take O(len) time which would be O(log n) where n is the number. Saurabh Singh B.Tech

Re: [algogeeks] Adobe Interview Question

routines. If he still disagreed I would have given him this solution: #includestdio.h int main() { int ch; while((ch=getchar())!=-1) putchar(ch); return 0; } Would have run this as *./a.out file_to_read* * * If he still disagreed I would have walked out :P Saurabh Singh B.Tech (Computer Science

Re: [algogeeks] Data structure and algorithm made easy by narasimha karumanchi

itti achi hai to khareed lo jake..yaha na milegi :P ( If it is that good,go buy it.You won't get it here) *No more posts on this thread.And please this is not torrent. Please dont post such requests in future* Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com

Re: [algogeeks] VIDEO STREAMING

has any idea about video streaming using vlcj lib ?? -- *WITH REGARDS, *KARTIK SACHAN B.Tech. Final Year Computer Science And Engineering Motilal Nehru National Institute of Technology,Allahabad Phone No: +91-9451012943 E-mail: kartik.sac...@gmail.com -- -- -- Saurabh

Re: [algogeeks] Check if a binary tree is Binary Search Tree or not.

Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Fri, Nov 9, 2012 at 10:00 AM, atul anand atul.87fri...@gmail.com wrote: @saurabh : correct..yes if you are considering recursive approach , so it will take O(n) space stack.But same can be done using

Re: [algogeeks] Check if a binary tree is Binary Search Tree or not.

^ To perform inorder traversal in a binary tree without using stack space the tree must be mutable. In other cases as far as I can think the space complexity should be asymptotically O(n) where n are the number of nodes. Saurabh Singh B.Tech (Computer Science) MNNIT

Re: [algogeeks] Fork in c

printf is line buffered. hence text1 remains in buffer when fork is called.this is shared by both the child and the parent when fork is called. Leaving the rest for u to conclude Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sat, Oct 27, 2012 at 2:25 PM

Re: [algogeeks] Fork in c

Yup Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sat, Oct 27, 2012 at 8:21 PM, rahul sharma rahul23111...@gmail.comwrote: text 1 remains in buffer...nowwhen child reaches print f.it prints oldbuffer+newdata...m i ryt??? On Sat, Oct 27, 2012

Re: [algogeeks] directi paper pattern

Please stop this idiocity of *me too,me too * You can send personal mails to the author,why spam the group? No More Posts on this thread. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com -- You received this message because you are subscribed to the Google

Re: [algogeeks] pls guy im need of a ebook named Data Structures and algorithms made easy details given below....

Above users banned for violating group policy. NO MORE POSTS ON THIS THREAD. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Fri, Jul 20, 2012 at 11:39 PM, suresh kumar mahawar suresh.mahawar1...@gmail.com wrote: On Fri, Jul 20, 2012 at 11:02 PM

Re: [algogeeks] Anagram problem

^sorting a string would be o(n^2logn) if u use q.sort.count sort would be better. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Wed, Jul 18, 2012 at 1:08 PM, vindhya chhabra vindhyachha...@gmail.comwrote: sort the list,sort the word(use quick sort

Re: [algogeeks] A Coding Problem

its from a running contest i believe.This is against the group policy as well as against the ethics of programmers. The author of this post is banned permanently from algogeeks. Kindly no more posts on this thread till 16th July (the date mentioned as end of contest in the given link). Saurabh

Re: [algogeeks] Re: [Google] Finds all the elements that appear more than n/3 times

@above On Thursday, 28 June 2012 04:05:12 UTC+5:30, Navin Kumar wrote: Design an algorithm that, given a list of n elements in an array, finds all the elements that appear more than n/3 times in the list. The algorithm should run in linear time ( n =0 ). You are expected to use

Re: [algogeeks] MS Question: Segregrate positive and negative nos in array without changing order

duplicate of a previous post.Kindly refer to that post. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Fri, Jun 29, 2012 at 10:41 AM, raghavan M peacelover1987...@yahoo.co.inwrote: Hi Question as in subject *No extra space (can use one extra space)-O

Re: [algogeeks] Switch doubt in C

the cases are simple lables they have nothing to do with the flow of program. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Fri, Jun 29, 2012 at 3:14 PM, adarsh kumar algog...@gmail.com wrote: Doubt, very trivial though: #includestdio.h int main

Re: [algogeeks] MS Question: Add two large numbers where the numbers are stored in an array format

^ Does it make any difference? Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Tue, Jun 26, 2012 at 5:32 PM, Navin Kumar algorithm.i...@gmail.comwrote: whether it is in character array or integer array?? On Tue, Jun 26, 2012 at 3:40 PM, Ashish Goel

Re: [algogeeks] Programming Question

+1 to Trie Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Fri, Jun 22, 2012 at 3:50 PM, Karthikeyan V.B kartmu...@gmail.comwrote: Tries -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post

Re: [algogeeks] Reverse Queue

count the size of queue : O(n) loop for n and do remove and add in queue : O(n) Total : O(n) On Wed, Jun 20, 2012 at 6:34 PM, Navin Kumar algorithm.i...@gmail.comwrote: How to reverse a Queue . Constraints: Time complexity O(n). space complexity: O(1) -- You received this message because

Re: [algogeeks] Reverse Queue

according to your algorithm. Because if you will delete an element from front and add at rear no change will be there. After n iteration front will be pointing to same element and rear will also point to same element. Correct me if i am wrong. :) On Wed, Jun 20, 2012 at 6:39 PM, saurabh singh

Re: [algogeeks] Reverse Queue

. :) On Wed, Jun 20, 2012 at 6:39 PM, saurabh singh saurabh.n...@gmail.com wrote: count the size of queue : O(n) loop for n and do remove and add in queue : O(n) Total : O(n) On Wed, Jun 20, 2012 at 6:34 PM, Navin Kumar algorithm.i...@gmail.com wrote: How to reverse a Queue

Re: [algogeeks] Reverse Queue

) . your solution is right but it takes O(n) space. On Wed, Jun 20, 2012 at 8:28 PM, saurabh singh saurabh.n...@gmail.comwrote: Why will my proposed solution not work for you ??? On Wed, Jun 20, 2012 at 8:19 PM, Navin Kumar algorithm.i...@gmail.comwrote: @Kirubakaran : still space

Re: [algogeeks] Reverse Queue

. Think about it :). Then you have to take stack or some other data structure. On Wed, Jun 20, 2012 at 8:40 PM, saurabh singh saurabh.n...@gmail.comwrote: How ?? I am asking to manipulate the same queue. Dequeue n-1 elements and enqueue them in order to you take out to the same queue..Where

Re: [algogeeks] Microsoft Interview Question

Order may not be maintained necessarily by this solution Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Thu, Jun 14, 2012 at 1:47 PM, Manikanta Babu manikantabab...@gmail.comwrote: Check this out, it works in O(n); int i = 0; int j

Re: [algogeeks] Re: Book Feedback needed for book from Narasimha Karumanchi

Kindly find some other group for requesting e-books- www.squiffer.com This is a good reference for ebooks.Any more requests for uploading ebooks may result in a ban from the group. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Fri, Jun 8

Re: [algogeeks] Re: spoj problem

No this is fair enough.It directly involves algorithm. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Thu, Jun 14, 2012 at 4:28 AM, shiv narayan narayan.shiv...@gmail.comwrote: will be better if you post on spoj forums.!! On Wednesday, 13 June 2012

Re: [algogeeks] Microsoft Interview Question

Think of the +ve numbers as 0 negative numbers as 1.Now the problem reduces to http://stackoverflow.com/questions/682171/arrange-0s-1s-in-a-array Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Thu, Jun 14, 2012 at 3:00 AM, Piyush Kapoor pkjee2

Re: [algogeeks] Adobe interiew question

tHE first thing that comes in my mind Signals Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Tue, Jun 12, 2012 at 10:26 PM, Shashank Narayan shashank7andr...@gmail.com wrote: yes u can review that link :) On Tue, Jun 12, 2012 at 9:47 PM, Anika Jain

Re: [algogeeks] Re: Power(n^n)

@Guneesh Actually he says But 0=N , K=1000 so N^N could be have 1000 digits. I think this assertion is wrong.. @dave sir.. The second part of question still remains unanswered.Is there any mathematical property... Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com

Re: [algogeeks] first Repeating character in a string

The key doesn't lies in the way it will be solved.It is how efficiently you implement the hash table.do we really need an integer array ( 4*256 bytes) just to record the first occurrence of a character? Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Fri

Re: [algogeeks] Re: Tree/Graph implementation

^ A list representation consider a graph with 1 million nodes..and at a time only 2 nodes will be connected...Compare the difference in the two representations... Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Tue, May 29, 2012 at 10:00 PM, Ashish

Re: [algogeeks] Partition the array with equal average

Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Thu, May 17, 2012 at 11:40 PM, Prem Krishna Chettri hprem...@gmail.comwrote: I guess this is Subset minimization problem's Modification.. Algo.. 1 Get all the Subset of the particular array. Best Algo

Re: [algogeeks] Re: finding anagrams in a list of words

u mean ad == bc ? On Mon, May 14, 2012 at 10:41 PM, payal gupta gpt.pa...@gmail.com wrote: @atul instead of sorting the string individually which would require tc- O(nlogn) shouldnot it be a better idea to use the sum of the ascii values of the individual alphabets as the key which would

Re: [algogeeks] Re: Sorting in O(n)

what he wanted to say was that first digit would be m/n and second digit m%n Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Tue, May 8, 2012 at 10:31 AM, atul anand atul.87fri...@gmail.com wrote: @arpit : your formula for converting base 10 to base n

Re: [algogeeks] Re: Sorting in O(n)

Read the problem for constraints Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Tue, May 8, 2012 at 11:12 AM, Mahesh Thakur tmahesh...@gmail.com wrote: I think if range is till n2, max passes for radix sort will be 3. by subtracting 1 to all

Re: [algogeeks] Re: Sorting in O(n)

Yes thanx for that...Gene had already mentioned that in somewhat different way.And now I feel like a floppy disk for not being able to think the obvious. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sun, May 6, 2012 at 10:20 PM, Arpit Gupta arpitgupta

Re: [algogeeks] Sorting in O(n)

optimization that we can make is to use a higher base which would reduce the number of buckets required but would add the cost of converting each number into the higher base. Somehow I am getting convinced worst case O(n) algorithm may not be possible.Working on the mathematical proof. Saurabh Singh

Re: [algogeeks] Sorting in O(n)

? Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sat, May 5, 2012 at 2:14 PM, Jeevitesh jeeviteshshekha...@gmail.comwrote: Hi all, I am new to this group. My last post was deleted i do not know the reason behind it. I will explain my logic here

Re: [algogeeks] Re: Sorting in O(n)

I think I couldn't make myself clear... This line in your algorithm *After this just iterate through the aux array printing the index aux[i] times.* this makes your algorithm O(n^2) since the size of aux is n^2 and in the worst case the complete traversal of aux may be required. Saurabh Singh

Re: [algogeeks] Re: Sorting in O(n)

^ This is what I was talking about in my earlier post.But the problem is how\ to convert the base of each number in O(1) time ( and then reconvert to base 10 in O(n)) .I may be missing some trick here.Still working on it. Saurabh Singh B.Tech (Computer Science) MNNIT

Re: [algogeeks] Re: Sorting in O(n)

^ And this completes the solution Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sun, May 6, 2012 at 11:12 AM, Gene gene.ress...@gmail.com wrote: Ah, but you can pick the radix to be n. Then at most 3 passes will always sort the array. O(3n) = O(n

Re: [algogeeks] Sorting in O(n)

@cegprakash They are n numbers lying in the range 1 to n^2.Not necessarily sorted. eg 3 4 1 2 5 8 (6 numbers satisfying the conditions given in the problem) Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sat, May 5, 2012 at 5:17 AM, Prakash D cegprak

[algogeeks] Wrong Answer SPOJ

[a]==n) ans++; printf(%d\n,ans); } } Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com -- 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

Re: [algogeeks] Re: Required O(n) Algorithm

@illya read the posts in the thread.Count sort is O(n) sorting algorithm.The constraints in this algorithm is that the maximum value of the array to be sorted should not be large. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Mon, Apr 23, 2012 at 5:25 AM

Re: [algogeeks] Re: Find the maximum boxes which can fit each other?

, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com -- You received this message because you are subscribed

Re: [algogeeks] Slang Decoder chatBot... give a try...

My impression is that the author is using http://www.imified.com/ or a similar platform which provides an interface to g-talk via very simple PHP.The bad news is though that imified is going to be shut down soon as they are not earning profit in this plan. Saurabh Singh B.Tech (Computer Science

Re: [algogeeks] [ DirectI ] Interview question

I think not necessary consider the case 3 1 4 1 2 2 4 Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sat, Mar 24, 2012 at 10:53 PM, karthikeyan muthu keyankarthi1...@gmail.com wrote: if i'm not wrong .. we are to repeat this process till no more

Re: [algogeeks] Re: Interview question

@amol I was trying to put forward the point that the o/p need not be sorted.If you check the difference between time of my and payal's message it was a case of race condition. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sun, Mar 25, 2012 at 6:54 AM

Re: [algogeeks] Re: Run Length Decoding... inplace

what if we simply use the same char instead of '\0' that would reduce one traversal? (@utkarsh We discussed that earlier in lab.Did u found out the bug in this approach?) Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Fri, Mar 23, 2012 at 6:38 PM, UTKARSH

Re: [algogeeks] Re: Run Length Decoding... inplace

Yes u are correct...My bad...That obviously didn't made any sense Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Fri, Mar 23, 2012 at 7:49 PM, UTKARSH SRIVASTAV usrivastav...@gmail.comwrote: yes if we use char instead of that place then again we

Re: [algogeeks] Maximum size square sub-matrix with all 1s

to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Saurabh Singh B.Tech (Computer Science) MNNIT

Re: [algogeeks] Maximum size square sub-matrix with all 1s

@sourabhThere are O(n^2) elements in the matrix of size nXn. Yes we can find patterns in a substring with n elements in O(n) but can you do that in O(sqrt(n)) (To complete your analogy), Beside's can you allocate a 10^6X10^6 matrix in an array? On 3/15/12, saurabh singh saurab...@gmail.com

Re: [algogeeks] Re: Maximum height/depth of tree

by a constant factor.All depends on how you want to implement it.Somewhat similar question can be whether 0 is a positive number? Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sun, Mar 11, 2012 at 12:44 PM, rahul sharma rahul23111...@gmail.comwrote: but according

[algogeeks] saurabh singh wants to chat

--- saurabh singh wants to stay in better touch using some of Google's coolest new products. If you already have Gmail or Google Talk, visit: http://mail.google.com/mail/b-8b1926b47c-1a94807712--9DQx1eW2o_LPykR-fUVx5lOG1s You'll

Re: [algogeeks] Re: Java question

Is it possible items are removed from the truck too? Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sat, Mar 10, 2012 at 9:39 PM, shruthi sharma shruthi.shar...@gmail.comwrote: I implemented it by using arraylist. I sorted the trucks according

Re: [algogeeks] Floyd Warshall

Its quite trivial..it just if there's a shorter way to reach from index j and k by using any of the nodes as intermediate Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sat, Mar 3, 2012 at 5:59 PM, shady sinv...@gmail.com wrote: Can someone explain

Re: [algogeeks] Re: Longest Path in A Graph

In case cycle is present in the graph then we cant have a longest path in the graph.Therefore the problem reduces to the longest path in a tree.(Assuming the graph is connected). Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Wed, Feb 22, 2012 at 11:23

Re: [algogeeks] Re: Finding closest double in a Btree

to the data structure used. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Tue, Feb 21, 2012 at 6:06 AM, Gene gene.ress...@gmail.com wrote: Not to mention the subject line seems to be asking about B-Trees, which is no kind of binary tree, so the OP

Re: [algogeeks] Data structure to implement mobile contacts list

number.in that case we need to store instead of an index number an array of index numbers... Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Fri, Feb 17, 2012 at 9:25 PM, Devansh Gupta devanshgupta...@gmail.comwrote: Which data structure will be the best one

Re: [algogeeks] nyone having pointer in c ebook..plz mail me...

Kindly don't post more replies on this thread.This group is not for file sharing. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sun, Feb 5, 2012 at 3:12 PM, Veronica Sharma sharma.veron...@gmail.comwrote: i have pdf of pointers on c by Kenneth A Reek

Re: [algogeeks] Re: Spoj ABCPATH

http://www.spoj.pl/problems/ABCPATH/ Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sun, Feb 5, 2012 at 11:18 PM, WgpShashank shashank7andr...@gmail.comwrote: @trinity tell the link of problem ? *Thanks Shashank Mani Narayan Computer Science

Re: [algogeeks] someone pls explain the o/p??

I once answered a similar question in stackoverflow.com http://stackoverflow.com/questions/8586722/comparing-unsigned-char-and-eof/8586867#8586867 Hope it helps... Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sun, Jan 29, 2012 at 6:54 PM, Firoz

Re: [algogeeks] Re: Represent a number in base of minus 2 ????

Use a pen and paper:) Generate a few numbers in base -2 by hand.You will get the logic. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sun, Jan 29, 2012 at 11:44 PM, Zyro vivkum...@gmail.com wrote: 0 -- You received this message because you

[algogeeks] Online algorithm for cycle detection

How to design an efficient data structure for a dag? The condition should be there should be no cycle formed during insertion of edge.So this condition for cycle needs to be checked at each insertion. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com -- You

Re: [algogeeks] Kurukshetra Online Debugging Prelims today

or editor even notepad and ideone will do. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Thu, Jan 26, 2012 at 11:17 PM, prakash y yprakash@gmail.com wrote: Hi guys, I tried to participate in this contest and solved the first problem KDEBUG1 in Java

Re: [algogeeks] Re: Doubt regarding complexity (if comparison based sorting algorithm used)

@ATUL..still we are not comparing elements among themselvesThe ordering of elements is already known to us Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Tue, Jan 24, 2012 at 10:19 AM, atul anand atul.87fri...@gmail.comwrote: @Don : if i am

Re: [algogeeks] Binary Index Tree

search problem japan Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sun, Jan 15, 2012 at 4:23 AM, Mad Coder imamadco...@gmail.com wrote: Hi all, I was going through Binary Index Tree (BIT) tutorial through topcoder , although the concept is clear to me

Re: [algogeeks] kth largest element in an unsorted list

nth order statistics http://en.wikipedia.org/wiki/Selection_algorithm Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sat, Jan 14, 2012 at 8:23 PM, Piyush Grover piyush4u.iit...@gmail.comwrote: you can do it in nlogk or n+klogn time. create a min-heap

Re: [algogeeks] Re: Sorting for large data

I would have told them to distribute the data in smaller logical partitions.there is no way 10^80 objects can be handled.Even external sort will take painfully enormous amount of time making it infeasible practically. Saurabh Singh B.Tech (Computer Science) MNNIT

Re: [algogeeks] c output ??

/CNkCo . Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Tue, Jan 10, 2012 at 2:29 PM, Rahul Verma rahulverma@gmail.comwrote: @amol this is not the behaviour of printf, its totally about the typecasting -- You received this message because you

Re: [algogeeks] Binary Search Problem

not clear what you are trying to ask...can you quote exactly from the book? Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sun, Jan 8, 2012 at 4:34 PM, Sanjay Rajpal srn...@gmail.com wrote: In binary search, mid = start + (end-start)/2 is used

Re: [algogeeks] Re: finding all combination

Sorry for being offtopic but yes if anyone proposes a polynomial time algorithm(which can work for all cases) he is entitled to a prize money of 1 million. http://en.wikipedia.org/wiki/Millennium_Prize_Problems Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com

Re: [algogeeks] Re: finding all combination

with both the subproblems... Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sat, Jan 7, 2012 at 2:01 AM, Don dondod...@gmail.com wrote: Given an array A[n], start by sorting the array. Then do something like this: int result[n]; int size=0; void

Re: [algogeeks] Re: check Similar array

will still be O(N) (Much simpler and immune to problems such as finite word size) Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Thu, Jan 5, 2012 at 5:17 PM, atul anand atul.87fri...@gmail.com wrote: @Shashank : as i have mentioned in the question

[algogeeks] A graph problem

coincide, that is, the cycle should not necessarily be simple. The number of rooms in the cycle is considered as *k*, the sequence's length. Note that the minimum possible length equals two. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com -- You received

Re: [algogeeks] Re: A graph problem

Yes I also initially thought soBut how do we take into consideration the edge weights??The cycle can include such edges whose total cost may come negative. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Thu, Jan 5, 2012 at 10:01 PM, karthikeyan

Re: [algogeeks] finding all combination

Most probably noThis is the subset sum problem which is proven NP complete...Even if a better solution than n^2 exists it won't work for all cases Saurabh Singh B.Tech (Computer Science) MNNIT ALLAHABAD On Tue, Jan 3, 2012 at 4:56 PM, atul anand atul.87fri...@gmail.com wrote

Re: [algogeeks] Re: DP problems in SPOJ

@atul in case you are considering indexing from 1 then your for loop shud be *for(i=1 *. Its more obvious this way that you are indexing from 1.(Although doesn;t makes any difference to the overall objective) Saurabh Singh B.Tech (Computer Science) MNNIT

Re: [algogeeks] Invitation - Abacus'12 Online Programming Contest

Kindly mail any further queries to the author of this mail directly @kashyap Thanx for sharing the info... *THREAD CLOSED-* Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Tue, Jan 3, 2012 at 9:33 PM

Re: [algogeeks] check Similar array

Why would xoring fail? Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Wed, Jan 4, 2012 at 9:56 AM, SAMM somnath.nit...@gmail.com wrote: I think this may works . needs verification. For the given array (3 5 2 5 2) For +ve number (N) take the sum from

Re: [algogeeks] check Similar array

Ok got itwill fail for the cases where the xor in the arrays individually come to 0.. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Wed, Jan 4, 2012 at 10:13 AM, atul anand atul.87fri...@gmail.com wrote: how its 42??..didnt get

Re: [algogeeks] Re: check Similar array

@sharad Your approach limits the size of array to be very small(as well as the elements of the array to be small).Else the product will become too big to be held in an array.Same applies with samm's solution too though in his case we can be more liberal with element's value.. Saurabh Singh

Re: [algogeeks] C output????

@all.Your explanations work because probably all of you are using a compiler that's behaving in the same way.Don't conclude from what you see...The compiler is free to store the constant strings the way it wants. Saurabh Singh B.Tech (Computer Science) MNNIT

Re: [algogeeks] addition of two numbers without using logical or arithmetic operators

, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Saurabh Singh B.Tech (Computer Science) MNNIT ALLAHABAD -- You received this message because you are subscribed to the Google Groups Algorithm

Re: [algogeeks] Re: given a stream of numbers FIND MEDIAN

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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Saurabh

Re: [algogeeks] Re: convert into palindrome

kumarmohit...@gmail.com wrote: @saurabh-as by the above example LCS of HELLO and its inverse would be LL and how can we form the word HELLOLLEH with it ... and is your ans for the word NITAN is NITATIN ...? On Wed, Dec 14, 2011 at 8:39 PM, saurabh singh saurab...@gmail.com

Re: [algogeeks] doubt in spoj 8473 ways

=en. -- Saurabh Singh B.Tech (Computer Science) MNNIT ALLAHABAD -- 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 algogeeks

Re: [algogeeks] Complexity

. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Saurabh Singh B.Tech (Computer Science) MNNIT ALLAHABAD

Re: [algogeeks] Re: Find Largest number in log(n)

Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Saurabh Singh B.Tech (Computer

Re: [algogeeks] Re: Number Theory (Power of 3 )

to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Saurabh Singh B.Tech (Computer Science) MNNIT ALLAHABAD -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post

  1   2   3   4   >