search
Log In

Highest voted questions in Tier 1 Placement Questions

6 votes
3 answers
1
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 758 views
3 votes
1 answer
2
How to generate permutation of a string? What will be the complexity?
asked May 30, 2016 in Algorithm Challenges Arjun 304 views
2 votes
2 answers
3
Given a linked list : 1->2->3->4->5->6, make the following changes 1->6->2->5->3->4 What would be the most effiicient way to make this change?
asked Jul 22, 2016 in Algorithm Challenges sh!va 974 views
2 votes
2 answers
4
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 892 views
2 votes
1 answer
5
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 632 views
1 vote
1 answer
6
$\begin{align*} & a[n] = \{x_1,x_2,x_3,x_4,....,x_n\} \text{ is an array of integers where } n,x_i > 0. \\ & A = \left [ \text{min}\left ( x_i,x_j \right ) \right ] \cdot \left ( j-i \right ) \text{ where } j > i \text{ and } i,j \leq n \\ & \text{What is the best time complexity to find out the value of } A_{\bf max} \; ? \end{align*}$
asked May 27, 2017 in Algorithm Challenges dd 296 views
1 vote
0 answers
7
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
1 vote
1 answer
8
main() { int arr2D[3][3]; printf("%d\n", ((arr2D==* arr2D)&&(* arr2D == arr2D[0])) ); }
asked May 15, 2016 in Puzzles Desert_Warrior 317 views
1 vote
1 answer
9
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 679 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 281 views
0 votes
0 answers
11
Given a non negative integer A, following code tries to find all pair of integers (a, b) such that a and b are positive integers a <= b, and a2 + b2 = A. 0 <= A <= 100000 However, the code has a small bug. Correct the bug and submit the code. vector<vector<int> > ... a + b * b == A) { vector<int> newEntry; newEntry.push_back(a); newEntry.push_back(b); ans.push_back(newEntry); } } } return ans; }
asked Oct 24, 2018 in Puzzles Shaina Singh 261 views
0 votes
1 answer
12
Input You are given a template in which you need to implement a function whose signature is given below. C int findWordInAGrid(char grid[128][128], int m, int n, char word[32]) /* return 0 for false, 1 for true. */ C++ bool findWordInAGrid(char grid[128][128], ... are: abc abedhi efgh Output: The output of the above example should be: abc: true abedhi: true efgh: false Constraints 1 ≤ m,n ≤ 100
asked Sep 6, 2017 in Puzzles Priyanka Sen 167 views
0 votes
0 answers
13
Given an arithmetic expression involving *, + only write an object oriented code for its representation and evaluation
asked Jun 6, 2016 in Algorithm Challenges Arjun 278 views
0 votes
2 answers
14
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 410 views
0 votes
4 answers
15
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 679 views
To see more, click for the full list of questions or popular tags.
...