search
Log In

Recent questions tagged placement-questions

2 votes
2 answers
1
Given an array of $n$ elements find the maximum continuous sum in it. For example consider the below array of $n=6$. 23 4 -10 2 15 1 Answer is 35.
asked Jul 3, 2016 in Algorithm Challenges Arjun 891 views
1 vote
0 answers
2
Write an object oriented code for representing boolean expressions and then a function for checking the equivalence of two boolean expressions.
asked Jun 6, 2016 in Algorithm Challenges Arjun 158 views
0 votes
0 answers
3
Given an arithmetic expression involving *, + only write an object oriented code for its representation and evaluation
asked Jun 6, 2016 in Algorithm Challenges Arjun 277 views
0 votes
2 answers
4
Write a function (proper programming code) for multiplying two integers without using '*' operator and considering all corner cases.
asked Jun 6, 2016 in Algorithm Challenges Arjun 408 views
0 votes
4 answers
5
Given an input string of length $n$, find the maximum length of the substring containing maximum $k$ unique characters. For example, for "abbcdaadcd" and $k=2$ answer will be 4 for the substring "daad".
asked Jun 6, 2016 in Algorithm Challenges Arjun 678 views
2 votes
1 answer
6
Given an array with possible repeating elements you have to rearrange such that elements are alternatively decreasing and increasing (strict increase/decrease). For example, suppose the given array is 1 1 2 3 4 5 one possible answer would be 2 1 3 1 5 4. Assumption: Solution do exist for any given input. Hint: Try to avoid sorting.
asked May 27, 2016 in Algorithm Challenges Arjun 630 views
3 votes
2 answers
7
The information about an array used in program will be stored in Symbol Table Activation Record Both (A) and (B) Dope Vector
asked May 24, 2016 in Programming im.raj 1.2k views
1 vote
1 answer
8
According to me first we sort the array in O(nlogn) time and then in O(k) time , find the product , so total time complexity is O(nlogn) , so am I right or can it be done in lesser time ?
asked Apr 10, 2016 in Algorithm Challenges radha gogia 677 views
1 vote
1 answer
10
You are given a number lock of 4 digits and it accepts a serial input. What should be the minimum length of an input string so that the lock is guaranteed to open assuming it opens if any of the consecutive 4 digits matches the code. Also how to get one such sequence?
asked Apr 10, 2016 in Algorithm Challenges Arjun 280 views
6 votes
3 answers
11
A bad king has a cellar of 1000 bottles of delightful and very expensive wine. A neighboring queen plots to kill the bad king and sends a servant to poison the wine. Fortunately (or say unfortunately) the bad king's guards catch the servant after he has only poisoned one bottle. ... is in mind of the king, how will he be able to do so ? (of course he has less then 1000 prisoners in his prisons)
asked Apr 9, 2016 in Puzzles pC 756 views
0 votes
4 answers
12
If we are given a linked list then we have to manipulate such that even indexed node are arranged together and odd indexed nodes are arranged together after even indexed nodes for instance the given linked list is 1-->2-->3-->4-->5-->6 , so the op should be 2-->4-->6-->1-->3-->5
asked Apr 7, 2016 in Algorithms radha gogia 387 views
To see more, click for the full list of questions or popular tags.
...