The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions in Algorithm Challenges
Recent
Hot!
Most votes
Most answers
Most views
Featured
Previous GATE
Recent
Hot!
Most votes
Most answers
Most views
Featured
Previous GATE
0
votes
0
answers
1
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

95
views
0
votes
0
answers
2
Question on Array
Caption
asked
Sep 11, 2018
in
Algorithm Challenges
by
Vaishnavi01

190
views
algorithms
arrays
+1
vote
0
answers
3
nielit
What is expected cut off of nielit held in july, 2017?
asked
Aug 16, 2017
in
Algorithm Challenges
by
Shivani Jaiswal

982
views
nielitjuly2017
+1
vote
1
answer
4
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 ( ji \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*}$
asked
May 28, 2017
in
Algorithm Challenges
by
dd

285
views
algorithms
timecomplexity
+2
votes
2
answers
5
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?
asked
Jul 22, 2016
in
Algorithm Challenges
by
sh!va

939
views
linkedlists
algorithms
amazoninterview
+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.
asked
Jul 3, 2016
in
Algorithm Challenges
by
Arjun

847
views
placementquestions
dynamicprogramming
+1
vote
0
answers
7
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

154
views
placementquestions
0
votes
0
answers
8
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

253
views
placementquestions
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.
asked
Jun 6, 2016
in
Algorithm Challenges
by
Arjun

302
views
placementquestions
0
votes
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".
asked
Jun 6, 2016
in
Algorithm Challenges
by
Arjun

654
views
placementquestions
interview
+3
votes
1
answer
11
Permutation of String
How to generate permutation of a string? What will be the complexity?
asked
May 30, 2016
in
Algorithm Challenges
by
Arjun

292
views
combinatory
nongate
+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.
asked
May 27, 2016
in
Algorithm Challenges
by
Arjun

592
views
arrays
combinatory
placementquestions
+1
vote
1
answer
13
what is the best time complexity to find maximum product of exactly k elements in an array ?
asked
Apr 10, 2016
in
Algorithm Challenges
by
radha gogia

634
views
placementquestions
+1
vote
1
answer
14
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?
asked
Apr 10, 2016
in
Algorithm Challenges
by
Arjun

261
views
algorithmchallenge
placementquestions
To see more, click for the
full list of questions
or
popular tags
.
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
Interview Experience for MS(R)IIT Delhi (School of Information Technology)
How am I preparing
PGEE 2020 (CSE) Experience
IIT Tirupati MS Interview 2020
IIT Bombay Mtech RA  interview experience (2020)
Subjects
All categories
General Aptitude
2k
Engineering Mathematics
8.2k
Digital Logic
2.9k
Programming and DS
5k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.2k
Operating System
4.6k
Databases
4.2k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.2k
Others
1.5k
Admissions
595
Exam Queries
562
Tier 1 Placement Questions
23
Puzzles
9
Algorithm Challenges
14
Job Queries
71
Projects
19
Unknown Category
1k
Recent questions in Algorithm Challenges
Recent Blog Comments
........
After getting so many mails from you...
Refund will be given for such cases if applied...
@sreejit007 they don't publish any cutoff or...
@ranjanabhi Can you please elaborate what did...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,315
questions
60,430
answers
201,762
comments
95,241
users