Register

Recent questions and answers in Tier 1 Placement Questions

1.6k
views
0 answers
0 votes
Make Equal Subarray Problem Statement You are given two arrays (A and B) each of size N. You want to change A to B.
Make Equal SubarrayProblem StatementYou are given two arrays (A and B) each of size N.You want to change A to B. Changing the i-th element of A to i-th element of B costs...
User Avatar
6.2k
views
4 answers
6 votes
Wine Bottle
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. Fort...
User Avatar
2.1k
views
4 answers
1 votes
Maximum length substring with k unique characters
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 wil...
User Avatar
1.5k
views
0 answers
0 votes
InterView Bit
Given a non negative integer A,following code tries to find all pair of integers (a, b) such thata and b are positive integersa <= b, anda2 + b2 = A.0 <= A <= 100000Howev...
User Avatar
568
views
1 answers
0 votes
Coding String
InputYou 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[...
User Avatar
1.2k
views
1 answers
1 votes
Finding best time complexity
$\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 ...
User Avatar
3.2k
views
2 answers
2 votes
Maximum Continuous Sum in an Array
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 1Answer is 35.
User Avatar
2.4k
views
2 answers
3 votes
Amazon Interview question on Linked list
Given a linked list :1->2->3->4->5->6,make the following changes1->6->2->5->3->4What would be the most effiicient way to make this change?
User Avatar
1.4k
views
2 answers
0 votes
Multiplication without '*'
Write a function (proper programming code) for multiplying two integers without using '*' operator and considering all corner cases.
User Avatar
473
views
0 answers
1 votes
Equivalence of Boolean Expressions
Write an object oriented code for representing boolean expressions and then a function for checking the equivalence of two boolean expressions.
User Avatar
1.1k
views
0 answers
0 votes
Evaluate an arithmetic expression
Given an arithmetic expression involving *, + only write an object oriented code for its representation and evaluation
User Avatar
1.8k
views
1 answers
2 votes
Zigzag Arrangement
Given an array with possible repeating elements you have to rearrange such that elements are alternatively decreasing and increasing (strict increase/decrease). For examp...
User Avatar
1.1k
views
1 answers
3 votes
Permutation of String
How to generate permutation of a string? What will be the complexity?
User Avatar
2.7k
views
1 answers
1 votes
interview\ C program\ What is output
main() { int arr2D[3][3]; printf("%d\n", ((arr2D==* arr2D)&&(* arr2D == arr2D[0])) ); }
User Avatar
2.2k
views
3 answers
13 votes
IIITH-PGEE 2016
An anthropologist is visiting the island of knights and knaves one after the other.. This particular island is a very peculiar place, for it has only two kinds of inhabit...
User Avatar
1.5k
views
1 answers
2 votes
Open the lock
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 assumin...
User Avatar
2.3k
views
1 answers
1 votes
what is the best time complexity to find maximum product of exactly k elements in an array ?
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...
User Avatar
Help get things started by asking a question.