It is there mentioned in Section 8.3 Longest Increasing Sequence
page 290.
We distinguish an increasing sequence from a run, where the elements must be
physical neighbors of each other. The selected elements of both must be
sorted in
increasing order from left to right. For example, consider the
@kumar : i have one doubt regarding this question.Do we have to use all K
colors[K] to color all building.
for example :-
color[3]={1,2,10};
now if we have to color 6 building then i can use only 1st 2 color to color
all building and never 10 ...is this allowed ???
building[N]={1,2,1,2,1,2}
Can u pls show me the diagram representation of the implementation of Stack
using 2 Queues
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To unsubscribe from this group and stop receiving emails from it, send an email
to
