Hi ravi ,
I think he is trying to find the longest possible increasing chain in
matrix .
he needs to start traversing from first row choosing columns one by one and
move in all direction. but he needs to maintain the already visited nodes.
On Thu, Jun 6, 2013 at 12:07 AM, sourabh jain wrote:
>
Round 1 :
Q2: given BST is not correct.
correct BST passing this condition will be 7
/
5
/
Can u clear Round3 --- Qstn-3. the language is not cleared
On Wed, Jun 5, 2013 at 1:52 PM, sourabh jain wrote:
> Round 1:
> 1.Design a Data Structure supporting 3 queries a)push b)pop c) find
> minimum
> Ans : Do it using Two Stacks . in first stack use it as normal stack.
> second stack use it
Round 1:
1.Design a Data Structure supporting 3 queries a)push b)pop c) find
minimum
Ans : Do it using Two Stacks . in first stack use it as normal stack.
second stack use it to find minimun as the value inserted is greater than
the top ignore it else push it. if pop operation happens and the value
these are for which position? and experience?
On Thu, May 2, 2013 at 9:27 PM, Guneesh wrote:
> Round 1:
> 1.Design a Data Structure supporting 3 queries a)push b)pop c) find
> minimum
> 2.Given post order of a BST find whether each node of the tree(except
> leaf) has only 1 child or not.
>e
Can any one give some points on Round 3 : 1st and 3rd question ?
On Thu, May 2, 2013 at 9:27 PM, Guneesh wrote:
> Round 1:
> 1.Design a Data Structure supporting 3 queries a)push b)pop c) find
> minimum
> 2.Given post order of a BST find whether each node of the tree(except
> leaf) has only 1 ch
Round 1:
1.Design a Data Structure supporting 3 queries a)push b)pop c) find
minimum
2.Given post order of a BST find whether each node of the tree(except
leaf) has only 1 child or not.
eg5
\
7
/
3
/
2
is correct as e
Hi All,
I need ur help in solving few questions.
Would you please help me out *BY GIVING THE ALGORITHM AND THE LOGIC BEHIND
IT and it's DEEP EXPLANATION IF POSSIBLE?*
*
*
*a. Kadane’s Algo.*
*
*
*b. Linked-list intersection point.*
*
[A tree with only parent pointer, how to find LCA?]
*
*
bool IsValid(string s)
{
for(int len=0;len wrote:
> can be done with O(n^2) time complexity..
>
> can it be done with O(n) complexity ???
>
> On 6/3/12, utsav sharma wrote:
> > given a string tell wether it is valid or not.
> > string is valid if there is no substring which have the same substri
Can be done in O(n) time complexity using Suffix Trees.
On Sun, Jun 3, 2012 at 1:52 PM, atul anand wrote:
> can be done with O(n^2) time complexity..
>
> can it be done with O(n) complexity ???
>
> On 6/3/12, utsav sharma wrote:
> > given a string tell wether it is valid or not.
> > string is
can be done with O(n^2) time complexity..
can it be done with O(n) complexity ???
On 6/3/12, utsav sharma wrote:
> given a string tell wether it is valid or not.
> string is valid if there is no substring which have the same substring
> following it.
>
> these strings are not valid:- "stringstri
given a string tell wether it is valid or not.
string is valid if there is no substring which have the same substring
following it.
these strings are not valid:- "stringstring","geek123123rt",
"abcadabcad","strngstingstrngsting"
--
You received this message because you are subscribed to the Goog
12 matches
Mail list logo
