Any one has the E- book "Algorithms For Interviews" by Adnan Aziz. ?
It s a good book for algo,
please send download link..
thank u in advance
--
DIPANKAR DUTTA
M-TECH,Computer Science & Engg.
E&C Dept,IIT ROORKEE
Uttarakhand , India – 247667
---
website:h
If I remember correctly Berkeley DB uses an extensible hashing system or did
at one time. This is not part of the OS API, but rather a library that runs
in user space.
I've used the B-tree parts of Berkeley DB, though never the hash table.
Performance and reliability have been extremely goo
@ dave assume reverse also O(1)
@juver will you elaborate a bit dude
On Thu, Feb 10, 2011 at 8:21 PM, juver++ wrote:
> Cartesian tree will do.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to alg
Cartesian tree will do.
--
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+unsubscr...@googlegroups.com.
For more options,
@Jalaj: What is the work for each of the operations? I presume that
get is O(1), but don't know if reverse is O(1) or O(end-start).
Dave
On Feb 10, 12:07 am, jalaj jaiswal wrote:
> sort the input array. only following operations on array is allowed:
> 1)get(index) -gets the element at that index
well its game of Number Theory
There are 3 possibilities in any number set - prime numbers, non-prime
numbers (that are not squares) & squares.
In this puzzle the original state of a door will be reversed if it is
acted upon an odd number of times - otherwise the original state & the
final state
Given two sets of strings
set a="b8","b7""b1"
set b="c2","c1","c0"
I wish to list out all the permutations of the form
b8c2 b7c2 b6c1 b5c1 b5c0 b5c0 b1c0 b1c0
of length 8 each wherein
the ordering is maintained like non increasing indices from set a and
also from set b.
A more formal def
There is very long array of ints, and you are given pointer to base addr of
this array.. each int is 16bit representation... you need to return the
pointer to tht "bit" inside array where longest sequence of "1"s start
take this simple example:
Array = {15,7,2,1,0,23}
,0111,0010,0001,,1011
