Recent questions and answers in Tier 1 Placement Questions

0 votes

4 answers

1

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

answered Feb 18 in Algorithm Challenges by Debargha Bhattacharj (225 points) | 524 views

0 votes

0 answers

2

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; }

asked Oct 24, 2018 in Puzzles by Shaina Singh (7 points) | 65 views

0 votes

0 answers

3

GeeksforGeeks Questions
Need Explanation for this question: int main() { static int i=5; if(--i) { printf("F=%d\n",i); main(); printf("Hai\n"); printf("%d\n",i); } } Output: F=4 F=3 F=2 F=1 Hai 0 Hai 0 Hai 0 Hai 0

asked Sep 23, 2018 in Algorithm Challenges by dinesh4756 (29 points) | 55 views

0 votes

0 answers

4

Question on Array
Caption

asked Sep 10, 2018 in Algorithm Challenges by Vaishnavi01 (217 points) | 67 views

0 votes

0 answers

5

ace quetion bank
the minimal finite automata accepting the set of all strings over { 0, 1} starting with 1 that interpreted as the binary representation of an integer are congruent to 0 modulo 5 has ______ states.

asked Aug 19, 2018 in Puzzles by shubham007 (19 points) | 90 views

0 votes

2 answers

6

time complexity
Given f(n) = θ(n), g(n) = Ω(n), h(n) = O(n). Then f(n) + [g(n) ⋅ h(n)] = ? how to solve??

answered Jul 26, 2018 in Puzzles by Rudra Pratap (473 points) | 116 views

0 votes

0 answers

7

ACM ICPC Elibility
Can anybody please tell me, what is the age limit for ACM ICPC? By next year, I'll be 24, so will I be eligible for the same?

asked Jun 22, 2018 in Puzzles by Lakshay Kakkar Active (2.1k points) | 128 views

+1 vote

0 answers

8

made-easy
A) Ω(n) B) θ(n2) C) Ω(n2) D) θ(n)

asked Jan 16, 2018 in Puzzles by Nils Junior (917 points) | 122 views

0 votes

1 answer

9

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

answered Sep 13, 2017 in Puzzles by habedo007 Active (2.4k points) | 121 views

+1 vote

0 answers

10

nielit
What is expected cut off of nielit held in july, 2017?

asked Aug 16, 2017 in Algorithm Challenges by Shivani Jaiswal (189 points) | 821 views

+1 vote

1 answer

11

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

answered May 28, 2017 in Algorithm Challenges by Debashish Deka Veteran (58k points) | 251 views

+2 votes

2 answers

12

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.

answered Feb 14, 2017 in Algorithm Challenges by amuchand47 Junior (639 points) | 748 views

+2 votes

2 answers

13

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?

answered Oct 2, 2016 in Algorithm Challenges by Ahwan Boss (11.7k points) | 846 views

0 votes

2 answers

14

Multiplication without '*'
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 by ManojK Boss (38.8k points) | 200 views

+1 vote

0 answers

15

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.

asked Jun 6, 2016 in Algorithm Challenges by Arjun Veteran (400k points) | 135 views

0 votes

0 answers

16

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

asked Jun 6, 2016 in Algorithm Challenges by Arjun Veteran (400k points) | 205 views

+2 votes

1 answer

17

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.

answered May 30, 2016 in Algorithm Challenges by Arjun Veteran (400k points) | 509 views

+3 votes

1 answer

18

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

answered May 30, 2016 in Algorithm Challenges by Arjun Veteran (400k points) | 243 views

+1 vote

1 answer

19

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

answered May 15, 2016 in Puzzles by vijaycs Boss (26.3k points) | 249 views

0 votes

2 answers

20

the no of positive integral solutions of 15 x 1+x2+x3<=20 is equal to

answered May 12, 2016 in Puzzles by Shashank Kumar Active (3.5k points) | 2.4k views

+1 vote

1 answer

21

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?

answered Apr 29, 2016 in Algorithm Challenges by Shashank Kumar Active (3.5k points) | 224 views

+6 votes

3 answers

22

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)

answered Apr 13, 2016 in Puzzles by pC Boss (22.6k points) | 521 views

+1 vote

1 answer

23

what is the best time complexity to find maximum product of exactly k elements in an array ?

answered Apr 10, 2016 in Algorithm Challenges by Riya Roy(Arayana) Loyal (7.5k points) | 553 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions and answers in Tier 1 Placement Questions

Recent Posts

Recent Blog Comments