|
![]() |
There are only two hard things in computer science: cache invalidation, naming things, and off-by-one errors
Originally posted by Mayur Soneta:
Guys give me some hint...or code or ideas...
"Perfection is achieved, not when there is nothing more to add, but when there is nothing left to take away." -- Antoine de Saint-Exupery
I want to count the all the duplicates Y corresponding to their X's (index value)
Some problems are so complex that you have to be highly intelligent and well informed just to be undecided about them. - Laurence J. Peter
Don<br /> <br />"An unexamined life is not worth living." -- Socrates
The very existence of flamethrowers proves that at some time, some where, some place, someone once said to themselves "I'd really like to set those people on fire over there, but I just can't get close enough".
Originally posted by Mayur Soneta:
PLEASE GIVE THE SOLUTION....
There are only two hard things in computer science: cache invalidation, naming things, and off-by-one errors
And inside of my fortune cookie was this tiny ad:
a bit of art, as a gift, that will fit in a stocking
https://gardener-gift.com
|