Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions and answers 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
by
rk231219
1.0k
views
6
votes
4
answers
2
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
answered
in
Puzzles
Sep 7, 2020
by
jayeshasawa001
2.3k
views
puzzle
puzzles
placement-questions
1
vote
4
answers
3
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
answered
in
Algorithm Challenges
Feb 18, 2019
by
Debargha Bhattacharj
1.4k
views
placement-questions
interview
0
votes
0
answers
4
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; }
Shaina Singh
asked
in
Puzzles
Oct 24, 2018
by
Shaina Singh
1.1k
views
0
votes
1
answer
5
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
by
habedo007
376
views
algorithms
1
vote
1
answer
6
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*}$
dd
answered
in
Algorithm Challenges
May 28, 2017
by
dd
609
views
algorithms
time-complexity
2
votes
2
answers
7
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.
amuchand47
answered
in
Algorithm Challenges
Feb 14, 2017
by
amuchand47
2.0k
views
algorithm-challenge
placement-questions
dynamic-programming
3
votes
2
answers
8
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?
Ahwan
answered
in
Algorithm Challenges
Oct 2, 2016
by
Ahwan
1.9k
views
linked-list
algorithms
amazon-interview
0
votes
2
answers
9
Multiplication without '*'
Write a function (proper programming code) for multiplying two integers without using '*' operator and considering all corner cases.
ManojK
answered
in
Algorithm Challenges
Jun 6, 2016
by
ManojK
701
views
placement-questions
1
vote
0
answers
10
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.
Arjun
asked
in
Algorithm Challenges
Jun 6, 2016
by
Arjun
311
views
algorithm-challenge
placement-questions
0
votes
0
answers
11
Evaluate an arithmetic expression
Given an arithmetic expression involving *, + only write an object oriented code for its representation and evaluation
Arjun
asked
in
Algorithm Challenges
Jun 6, 2016
by
Arjun
678
views
algorithm-challenge
placement-questions
2
votes
1
answer
12
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
answered
in
Algorithm Challenges
May 30, 2016
by
Arjun
1.0k
views
array
combinatory
placement-questions
3
votes
1
answer
13
Permutation of String
How to generate permutation of a string? What will be the complexity?
Arjun
answered
in
Algorithm Challenges
May 30, 2016
by
Arjun
608
views
combinatory
non-gate
1
vote
1
answer
14
interview\ C program\ What is output
main() { int arr2D[3][3]; printf("%d\n", ((arr2D==* arr2D)&&(* arr2D == arr2D[0])) ); }
vijaycs
answered
in
Puzzles
May 15, 2016
by
vijaycs
1.9k
views
programming-in-c
output
pointers
13
votes
3
answers
15
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 ?
srestha
answered
in
Puzzles
Apr 30, 2016
by
srestha
1.3k
views
puzzles
puzzle
iiith-pgee
verbal-aptitude
2
votes
1
answer
16
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?
Shashank Kumar
answered
in
Algorithm Challenges
Apr 29, 2016
by
Shashank Kumar
757
views
algorithm-challenge
placement-questions
1
vote
1
answer
17
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 ?
Riya Roy(Arayana)
answered
in
Algorithm Challenges
Apr 10, 2016
by
Riya Roy(Arayana)
1.5k
views
algorithm-challenge
placement-questions
Help get things started by
asking a question
.
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
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 Posts
Aptitude Overflow Book
Participate in Machine Learning benchmarking
GATE Overflow Tikz Templates
UPSC One Time Registration OTR Online Form 2022
DRDO CEPTAM 10 Online Form 2022
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(8.9k)
Digital Logic
(3.2k)
Programming and DS
(5.7k)
Algorithms
(4.5k)
Theory of Computation
(6.5k)
Compiler Design
(2.2k)
Operating System
(4.8k)
Databases
(4.4k)
CO and Architecture
(3.6k)
Computer Networks
(4.4k)
Non GATE
(1.2k)
Others
(2.5k)
Admissions
(644)
Exam Queries
(838)
Tier 1 Placement Questions
(17)
Puzzles
(5)
Algorithm Challenges
(12)
Job Queries
(72)
Projects
(9)
Unknown Category
(851)
Recent questions and answers in Tier 1 Placement Questions
Recent Blog Comments
previous years than GATE 2010 paper
Which link are you referring to?
@Arjun I am not able to see GATE 2010...
Should be working now
@Arjun Sir but it is not working. i dont know...