*tree substrings*
tree--|---mississippim .. mississippi
|
|---i--|---ssi--|---ssippi i .. ississippi
| | |
| | |---ppi issip,issipp,issippi
| |
| |---ppi
can anyone please tell me how important are heaps as compared to other data
structures (from interview's point of view). i am not talking about simple
min/max heaps, but advanced ones like fibonacci heaps and binomial heaps
--
You received this message because you are subscribed to the Google
how to implement dijkstra algorithm using fibonacci heaps ?thanks in
advance
--
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
Hassan, can you explain your algo?
Best Regards
Ashish Goel
Think positive and find fuel in failure
+919985813081
+919966006652
On Mon, Jun 4, 2012 at 11:20 AM, Hassan Monfared hmonfa...@gmail.comwrote:
for
--
You received this message because you are subscribed to the Google Groups
The problem suggests that a character can't be more than once present and
thereby it can be done by just having s bitmap and if a char repeats, any
longer repeating substring will have those char repeated atleast twice,
hence O(n) solution.
Also, Hasaan: how is your algo O(n2) for for-while-for
Ashish:
the algorithm passes over string and check if there is any substring with
len=1 is repeated or not. if not, tries for substring with len 2,... and so
on.
max length of substring which can be repeated can be at most N/2.
Regards,
On Tue, Jun 5, 2012 at 10:48 AM, Ashish Goel
#includeconio.h
#includeiostream
using namespace std;
int main()
{
char crew[2][2][10];
cincrew[0];
coutendl;
cincrew[1];
coutcrew[0][0]crew[0][1]crew[1][0]crew[1][1];
getch();
return 0;
}
now if I give input jack sparrow robert langdon
crew[o][o] should be jack
Can anyone pls mail me good datastrucutre and algo books..or any link to
download those books..thanks in advance
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
From interview perspective i think min-max heaps are enough.
You should be able to identify situations where you can apply them.
I do not think other heaps are of any use.
On Tue, Jun 5, 2012 at 11:40 AM, Abhishek Sharma abhi120...@gmail.comwrote:
can anyone please tell me how important are
Each DS has its own importance. So before you approach a problem , it is
better to understand the advantage of each DS. Infact, the Fibonacci heap
is having an big advantage of O(1) time searching element, which is
extremely significant as even the DS like Trie can't afford to do so.. All
in all,
you mean like scramble ?
On Jun 5, 5:39 am, Ashish Goel ashg...@gmail.com wrote:
preparing a sample itself is a great problem here, that is why i called it
hard
all words in the rectangle horizontally as well as vertically needs to be
valid dictionary words
Ashish
Hassan
say this
More than a programming, I believe this is a logical question. Some of the
assumption you can take into consideration is how many names a particular
person can possibly have. say, John F Kennedy, So, your array now can't
hold 3 names in two dimension, so what you wanna do, increase an array of
yes, but this rectangle clause is troubling me...
Best Regards
Ashish Goel
Think positive and find fuel in failure
+919985813081
+919966006652
On Tue, Jun 5, 2012 at 3:18 PM, rafi rafiwie...@gmail.com wrote:
you mean like scramble ?
On Jun 5, 5:39 am, Ashish Goel ashg...@gmail.com wrote:
http://books.google.co.in/books/about/Introduction_To_Algorithms.html?id=NLngYyWFl_YC
-- RK :)
On Tue, Jun 5, 2012 at 12:32 PM, arun prakash arunslb...@gmail.com wrote:
Can anyone pls mail me good datastrucutre and algo books..or any link to
download those books..thanks in advance
--
Introduction To Algorithms By Clifford Stein, Thomas H Cormen, Ronald L
Rivest, Charles E Leiserson
On Tue, Jun 5, 2012 at 12:32 PM, arun prakash arunslb...@gmail.com wrote:
Can anyone pls mail me good datastrucutre and algo books..or any link to
download those books..thanks in advance
go though 4shared.com and esnips.com
huge online storage of shared files including pdf..
On Tue, Jun 5, 2012 at 12:32 PM, arun prakash arunslb...@gmail.com wrote:
Can anyone pls mail me good datastrucutre and algo books..or any link to
download those books..thanks in advance
--
You received
http://torrentz.eu/search?f=data++structures
download the toprated book you like !using utorrent
--
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,
Does this sufficae?
Suppose you were using a dictionary from the frapplewonk language,
which has only 5 words:
tab
oma
to
am
ba
Then the biggest rectangle is clearly
tab
oma
On Jun 4, 10:39 pm, Ashish Goel ashg...@gmail.com wrote:
preparing a sample itself is a great problem here, that is
is geke is a invalid strng?
On Tue, Jun 5, 2012 at 12:17 PM, Hassan Monfared hmonfa...@gmail.comwrote:
Ashish:
the algorithm passes over string and check if there is any substring with
len=1 is repeated or not. if not, tries for substring with len 2,... and so
on.
max length of substring
no
if ta/om/to/am/ba/batot/amoma are words then it should be the one. no
5*2 3*3
On Tue, Jun 5, 2012 at 7:45 PM, Gene gene.ress...@gmail.com wrote:
Does this sufficae?
Suppose you were using a dictionary from the frapplewonk language,
which has only 5 words:
tab
oma
to
am
ba
What is the efficient algorithm to partition a big number like 1000 into
500 parts such that each part is=0,i need to know all the partition ;ex
partition of 5 into 3,4 1 0,3 1 1,2 2 1,i know brute force methods..please
provide some algorithm which is feasible to calculate all the partition
upto
But then all these words
ta, om ,., amoma all should be available in the dictionary i.e
they should be valid words.
On Jun 5, 11:32 am, partha sarathi Mohanty
partha.mohanty2...@gmail.com wrote:
no
if ta/om/to/am/ba/batot/amoma are words then it should be the one. no
5*2 3*3
yes It's valid, cuz it doesn't have any repeated substring next together
On Tue, Jun 5, 2012 at 7:08 PM, Lomash Goyal lomesh.go...@gmail.com wrote:
is geke is a invalid strng?
On Tue, Jun 5, 2012 at 12:17 PM, Hassan Monfared hmonfa...@gmail.comwrote:
Ashish:
the algorithm passes over
23 matches
Mail list logo
