search
Log In

Recent questions and answers in Tier 1 Placement Questions

6 votes
4 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)
answered Sep 7 in Puzzles jayeshasawa001 892 views
17 votes
7 answers
2
Let $f(n)= Ω(n), g(n)= O(n)$ and $h(n)= Ѳ(n)$. Then $[f(n). g(n)] + h(n)$ is: Ω (n) O (n) Ѳ (n) None of these
answered Jun 14, 2019 in Algorithms yuviabhi 6.8k views
1 vote
4 answers
3
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".
answered Feb 18, 2019 in Algorithm Challenges Debargha Bhattacharj 733 views
0 votes
0 answers
4
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 320 views
0 votes
1 answer
5
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
answered Sep 13, 2017 in Puzzles habedo007 185 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*}$
answered May 28, 2017 in Algorithm Challenges dd 336 views
2 votes
2 answers
7
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.
answered Feb 14, 2017 in Algorithm Challenges amuchand47 967 views
3 votes
2 answers
8
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?
answered Oct 2, 2016 in Algorithm Challenges Ahwan 1k views
0 votes
2 answers
9
Write a function (proper programming code) for multiplying two integers without using '*' operator and considering all corner cases.
answered Jun 6, 2016 in Algorithm Challenges ManojK 436 views
1 vote
0 answers
10
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 168 views
0 votes
0 answers
11
Given an arithmetic expression involving *, + only write an object oriented code for its representation and evaluation
asked Jun 6, 2016 in Algorithm Challenges Arjun 354 views
2 votes
1 answer
12
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.
answered May 30, 2016 in Algorithm Challenges Arjun 673 views
3 votes
1 answer
13
How to generate permutation of a string? What will be the complexity?
answered May 30, 2016 in Algorithm Challenges Arjun 320 views
1 vote
1 answer
14
main() { int arr2D[3][3]; printf("%d\n", ((arr2D==* arr2D)&&(* arr2D == arr2D[0])) ); }
answered May 15, 2016 in Puzzles vijaycs 351 views
1 vote
1 answer
16
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?
answered Apr 29, 2016 in Algorithm Challenges Shashank Kumar 310 views
1 vote
1 answer
17
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 ?
answered Apr 10, 2016 in Algorithm Challenges Riya Roy(Arayana) 775 views
Help get things started by asking a question.
...