Dark Mode

Recent activity in Tier 1 Placement Questions

0 votes

0 answers

1

Make Equal Subarray Problem Statement You are given two arrays (A and B) each of size N. You want to change A to B.

rk231219 asked in Algorithm Challenges Jan 5, 2022

1.6k views

2 votes

1 answer

2

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 assuming it opens if any of the consecutive 4 digits matches the code. Also how to get one such sequence?

Shiva Sagar Rao answer edited in Algorithm Challenges May 27, 2021

by Shiva Sagar Rao

1.4k views

1 vote

1 answer

3

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 in lesser time ?

Shiva Sagar Rao answer edited in Algorithm Challenges May 25, 2021

by Shiva Sagar Rao

2.1k views

0 votes

0 answers

4

Evaluate an arithmetic expression
Given an arithmetic expression involving *, + only write an object oriented code for its representation and evaluation

Shiva Sagar Rao retagged in Algorithm Challenges May 25, 2021

by Shiva Sagar Rao

1.1k views

1 vote

0 answers

5

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.

Shiva Sagar Rao retagged in Algorithm Challenges May 25, 2021

by Shiva Sagar Rao

455 views

2 votes

2 answers

6

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 1 Answer is 35.

Shiva Sagar Rao retagged in Algorithm Challenges May 25, 2021

by Shiva Sagar Rao

3.0k views

13 votes

3 answers

7

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 inhabitants, namely, knights and knaves! Now, knights always tell the truth and knaves always lie! There are cluster of ... B: A is a knave, and this is the island of Maya. Is this the island of Maya? What are A and B ?

gatecse recategorized in Puzzles Apr 25, 2021

2.1k views

6 votes

4 answers

8

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. Fortunately (or say unfortunately) the bad king's guards catch the servant after he has only poisoned one ... in mind of the king, how will he be able to do so ? (of course he has less then 1000 prisoners in his prisons)

jayeshasawa001 commented in Puzzles Sep 7, 2020

by jayeshasawa001

5.7k views

3 votes

2 answers

9

Amazon Interview question on Linked list
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?

soujanyareddy13 retagged in Algorithm Challenges May 22, 2020

by soujanyareddy13

2.4k views

1 vote

4 answers

10

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 will be 4 for the substring "daad".

Debargha Bhattacharj answer edited in Algorithm Challenges Feb 18, 2019

by Debargha Bhattacharj

2.0k views

0 votes

0 answers

11

InterView Bit
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 ... b * b == A) { vector<int> newEntry; newEntry.push_back(a); newEntry.push_back(b); ans.push_back(newEntry); } } } return ans; }

aambazinga commented in Puzzles Oct 26, 2018

1.5k views

1 vote

1 answer

12

interview\ C program\ What is output
main() { int arr2D[3][3]; printf("%d\n", ((arr2D==* arr2D)&&(* arr2D == arr2D[0])) ); }

Salazar commented in Puzzles Jan 22, 2018

2.6k views

0 votes

1 answer

13

Coding String
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] ... abc abedhi efgh Output: The output of the above example should be: abc: true abedhi: true efgh: false Constraints 1 ≤ m,n ≤ 100

habedo007 answered in Puzzles Sep 13, 2017

544 views

2 votes

1 answer

14

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 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.

Arjun retagged in Algorithm Challenges Jun 25, 2017

by Arjun

1.7k views

3 votes

1 answer

15

Permutation of String
How to generate permutation of a string? What will be the complexity?

Arjun retagged in Algorithm Challenges Jun 25, 2017

by Arjun

1.0k views

1 vote

1 answer

16

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 \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*}$

air1 commented in Algorithm Challenges May 28, 2017

by air1

1.1k views

0 votes

2 answers

17

Multiplication without '*'
Write a function (proper programming code) for multiplying two integers without using '*' operator and considering all corner cases.

ManojK answer edited in Algorithm Challenges Jun 11, 2016

by ManojK

1.3k views

To see more, click for all the questions in this category.

Recent activity in Tier 1 Placement Questions