>
>>
>>
>>
>>
>>
>>
>>
>>
>>
>>
>>
>> Regards,
>> Kumar Raja.
>>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To unsubscribe fr
oup, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
~VISHNU~
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post
This can be done using binary indexed tree.
Thanks and Regards,
Vishnu Vardan Reddy Onteddu
Software Engineer
KeyPoint Technologies India Pvt Ltd.
9Q1A, 9th Floor, Cyber Towers,
HITEC City, Madhapur,
Hyderabad – 500081.
T: +91 40 40337000 Extn 70__
F: +91 40 40337070
www.keypoint-tech.com
Output will be
5 4 3 2 1
as static variable will be initialized only once.
--
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
algog
Cant see my mail going out
On Fri, Jun 10, 2011 at 12:26 AM, vishnu madiga wrote:
>
>
>
>
> Need to compare large and adhoc files (the files may have 1 milliion rows)
> in java.
> So need to load these files in a datastructure and based on a set of rules
> , need to r
Need to compare large and adhoc files (the files may have 1 milliion rows)
in java.
So need to load these files in a datastructure and based on a set of rules ,
need to realign and compare these rows.
Can you advice which datastructure/Collection class is best fit.
Or anyway I need to custom code t
Need to compare large and adhoc files (the files may have 1 milliion rows)
in java.
So need to load these files in a datastructure and based on a set of rules ,
need to realign and compare these rows.
Can you advice which datastructure/Collection class is best fit.
Or anyway I need to custom code t
Need to compare large and adhoc files (the files may have 1 milliion rows)
in java.
So need to load these files in a datastructure and based on a set of rules ,
need to realign and compare these rows.
Can you advice which datastructure/Collection class is best fit.
Or anyway I need to custom code t
Frns,
Any more tries / suggestions?
On Tue, Jun 7, 2011 at 11:26 PM, vishnu madiga wrote:
> Good suggestion Navneet.. I had a similar solution but am looking for
> something more faster.
> Performance is a major consideration to me. The possible permutations for a
> large set o
a design choice whether you want to have a single
> DS like above to contain both Credit and Debit based calculations or
> have separate multi-lists for Debits and Credits.
>
>
> On Tue, Jun 7, 2011 at 7:39 PM, vishnu madiga
> wrote:
> > find a combination of credits and debits
Generally we will have random set of credits and debits (which can have many
to many matchings). We need to find a match such that we are left with
minimum possible credit/debit which is unmatched.
On Tue, Jun 7, 2011 at 11:09 PM, vishnu madiga wrote:
> find a combination of credits and deb
find a combination of credits and debits which will sum out to zero in
a given set of credit and debit values.
It's not necessary to have a one to one match between a debit and
credit.
For example, the parent may lend $25 and $75 to its subsidiary and
receive back 3 payments of $20, $40 and $40.
T
Let the string be str1. Sort that string and form a map of sorted string and their positions in the original string .
example :consider string "computer"
sorted map will contain
c 1
e 7
m 3
o 2
p 4
r 8
t 6
u 5
Let the permuted string be "comtepur
13 matches
Mail list logo
