Which college?
I can help you.
On Wed, Aug 22, 2012 at 11:23 PM, Arun Kindra arunkin...@gmail.com wrote:
Anyone know the paper pattern or ques of snapdeal? And What they
demand(any specific language)?
--
Regards:
*Arun Kindra*
--
You received this message because you are subscribed
its DU . please guide with watever details you have.
thanks
On Fri, Aug 24, 2012 at 4:42 PM, JITESH KUMAR jkhas...@gmail.com wrote:
Which college?
I can help you.
On Wed, Aug 22, 2012 at 11:23 PM, Arun Kindra arunkin...@gmail.comwrote:
Anyone know the paper pattern or ques of snapdeal?
@all .. i suggested him the hashing method... but was not convinced... he
might be expecting something else.. something like tries.. etc..
@ Karthikeyan Muthu... can u explain it in detail with some ex ...
On Thu, Aug 23, 2012 at 11:28 PM, Karthikeyan Muthu
keyankarthi1...@gmail.com wrote:
Ques Given a large text... in the text.. there are gt; , lt; etc
representing and .(there can be others like eq; etc)
the task is to replace such (gt;) with the '' symbol...
and (lt;) with ''
given the table which have corresponding matches... and
table is
Can u please explain ur code..!!!
--
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
@all thanks
On Thu, Aug 23, 2012 at 6:08 PM, vaibhav shukla vaibhav200...@gmail.comwrote:
Abstract class are used for Abstraction
Interface are used for Polymorphism
On Thu, Aug 23, 2012 at 6:06 PM, Amit Tiwari amit.monu...@gmail.comwrote:
With an abstract class, the subclass of that
Hi all,
This was asked in microsoft, question is write a program to
reverse a linked list.and write it's test cases.
i got very few test cases
1) check if the node is null
2) check if there is only one node
3) check if there is any loop in the linked list.
can any one tell how to
Reversing a linked list if loop exists:
1. Find the node from which loop start by any loop finding algorithm in
linked list and keep the position of that node.
2. Unroll the loop i.e. set the last node's(last unrepeating node) next
pointer to NULL.
3. Reverse this singly linked list.
4. Change
Few more Test cases :
Check for 10 node.
Check for 1 million node
Check for even number of nodes
Check for odd number of nodes...
etc etc...
On Fri, Aug 24, 2012 at 6:25 PM, Navin Kumar algorithm.i...@gmail.comwrote:
Reversing a linked list if loop exists:
1. Find the node from which loop
Anagram problem solution using TRIE..
For each word in dictionary we will put it in TRIE as..
1. First sort the word
2. Search in trie using sorted word. If search found then we will add the
original word in that TRIE node.
3. If node node not found then using simple TRIE insertion insert
Hi All,
I would Like to Answer u,
We implement Multiple Inheritance through Interfaces.That is why only we
need Interfaces because class does not support multiple Inheritance.
On Tue, Aug 21, 2012 at 9:20 PM, sulekha metta metta.sule...@gmail.comwrote:
hi all,
why do we separately need
find the all possible combination of digits ranging 1 to 9 whose sum is 10,
no digit shud be repeated in any combination.
1234
127
136
145
19
235
28
37
46
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web
The complexity of above code is exponential.
Here is the simple recurrence for the given problem
F(n) = 2*F(n-1) + F(n-2) + F(n-3) for n = 4
where F(1) = 2
F(2) = 5
F(3) = 13
precompute the values and each query will then be O(1)
On Thu, Aug 23, 2012 at 8:22
13 matches
Mail list logo
