Re: [algogeeks] ubuntu help

2011-09-04 Thread Saket Choudhary
Just type vlc in terminal. Else if you want to run it as root : sudo vlc Sent from my iPhone On Sep 4, 2011, at 1:31 PM, UTKARSH SRIVASTAV usrivastav...@gmail.com wrote: hi anyone knows how to play vlc in root .i know root is not allowed by default but i want to know

Re: [algogeeks] puzzle

2011-07-19 Thread Saket Choudhary
16x=15y. Multiple solutions. Actually Infinite. On 19 July 2011 23:58, shiv narayan narayan.shiv...@gmail.com wrote: There is a temple, whose premises have a garden and a pond. It has 4 idols, each of Ram, Shiv, Vishnu and Durga. The priest plucks x flowers from the garden and places them in

Re: [algogeeks] ms ques

2011-07-18 Thread Saket Choudhary
Use logarithms and the properties that follow. Let the number be n Find log to the base 5 of n =*X*= *log*(n)/*log*(5) here *log* refers to base 10 Find log to the base 9 = *X*/(log to the base 5 of 9) Done! On 18 July 2011 23:58, varun pahwa varunpahwa2...@gmail.com wrote: is there any direct

Re: [algogeeks] is it possible to detect the first repeating number in a 2-D array (n X n) in O(n) time ?

2011-07-18 Thread Saket Choudhary
Have a hash Table. Read the elements and push it to the hash table. If it alraedy exists you are done. On 19 July 2011 01:02, Shubham Maheshwari shubham.veloc...@gmail.comwrote: what would be the O(n^2) sol. to this ...!! On Tue, Jul 19, 2011 at 12:41 AM, snehi jain

Re: [algogeeks] is it possible to detect the first repeating number in a 2-D array (n X n) in O(n) time ?

2011-07-18 Thread Saket Choudhary
Ruby Solution for 1d array. The logic for 2d array remains same. a=[1,2,3,4,5,1] b=[] for m in a unless b.include?(m) bm else puts m break end end On 19 July 2011 01:05, Saket Choudhary sake...@gmail.com wrote: Have a hash Table. Read the elements and push it to the hash

Re: [algogeeks] is it possible to detect the first repeating number in a 2-D array (n X n) in O(n) time ?

2011-07-18 Thread Saket Choudhary
Ya. Have an extra array of size(nxn). the one that I have implemented above. -- 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

Re: [algogeeks] Re: MICROSOFT

2011-07-17 Thread Saket Choudhary
^*constraint is not using division operator* * * * * On 18 July 2011 01:44, hary rathor harry.rat...@gmail.com wrote: assume that ; all element in array are short integer; int i; long long long long long int multi=1; for(i=0;ia.len;i++) { multi*=a[i]; } for(i=0;ia.len;i++) {