*10 -x = 2334563.456 - 23.34563456 = 2334540.11036544
...
On Jun 9, 11:24 pm, Anurag Sharma anuragvic...@gmail.com wrote:
multiply the original number x=23.34563456
Anurag Sharma
On Wed, Jun 9, 2010 at 10:36 PM, Veer Sharma thisisv...@rediffmail.comwrote:
One question:
No x
, Veer Sharma thisisv...@rediffmail.com wrote:
You have a Numerator and Denominator. After division you might get a
recurring decimal points float as the answer.
Problem is: You need to identify the recurring part for a given
decimal no?
For example 23.34563456 ...
return 3456
--
You
You have a Numerator and Denominator. After division you might get a
recurring decimal points float as the answer.
Problem is: You need to identify the recurring part for a given
decimal no?
For example 23.34563456 ...
return 3456
--
You received this message because you are subscribed to the
Given a Binary Search Tree, write a program to print the kth smallest
element without using any static/global variable. You can’t
pass the value k to any function also
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
Hi All
Here is a problem for us to solve:
Write a function which takes as parameters one regular
expression(only ? and * are the special characters to consider) and a
string and returns whether the string matched the regular expression.
--
You received this message because you are subscribed
Hi Janak
Thanks for your reply and good that we are exited. But if you see the
problem, this approach is already known which has space complexity of
O(n). But this if you are lucky that the array has numbers which are
not more than n itself.
If the given array is say 1000 size and it has numbers
think is the closest approach.
correct me if I am wrong..
Regards,
Abhishek
On Sun, May 30, 2010 at 8:21 PM, sharad kumar
aryansmit3...@gmail.comwrote:
sort the players based on skill point and get the subarray of equal
sum..
On Sun, May 30, 2010 at 6:58 PM, Veer Sharma
Hi Friends,
Here's a problem from my side:
100 rooms are in a prison. All doors are closed initially. A policeman
on round i will toggle the doors that are in multiples of i.
After 100 rounds, which doors will be open?
Lets try get a solution.
Thanks,
Veer
--
You received this message
no of toggle)
On 5/31/10, sharad kumar aryansmit3...@gmail.com wrote:
@veera:only the perfect square numbers will be open
1,4,9,16,25...100
On Mon, May 31, 2010 at 9:37 AM, Veer Sharma
thisisv...@rediffmail.comwrote:
Hi Friends,
Here's a problem from my side:
100 rooms are in a prison
Hi Friends,
This is my first post to this forum. A Hi to all of you and here is
my first problem...
Giiven int n, the total number of players and their skill-point.
Distribute the players on 2 evenly balanced teams.
Lets see who gives the best solution (least space complexity / least
time
10 matches
Mail list logo
