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 Algorithm Challenges
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
by
rk231219
1.6k
views
1
vote
4
answers
2
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
2.0k
views
placement-questions
interview
1
vote
1
answer
3
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 27, 2017
by
dd
1.1k
views
algorithms
time-complexity
2
votes
2
answers
4
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
3.0k
views
algorithm-challenge
placement-questions
dynamic-programming
3
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?
Ahwan
answered
in
Algorithm Challenges
Oct 2, 2016
by
Ahwan
2.4k
views
linked-list
algorithms
amazon-interview
0
votes
2
answers
6
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
1.3k
views
placement-questions
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.
Arjun
asked
in
Algorithm Challenges
Jun 6, 2016
by
Arjun
455
views
algorithm-challenge
placement-questions
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
Arjun
asked
in
Algorithm Challenges
Jun 6, 2016
by
Arjun
1.1k
views
algorithm-challenge
placement-questions
2
votes
1
answer
9
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.7k
views
array
combinatory
placement-questions
3
votes
1
answer
10
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
1.0k
views
combinatory
non-gate
2
votes
1
answer
11
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
1.4k
views
algorithm-challenge
placement-questions
1
vote
1
answer
12
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)
2.1k
views
algorithm-challenge
placement-questions
Help get things started by
asking a question
.
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Puzzles
(5)
Algorithm Challenges
(12)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions and answers in Algorithm Challenges
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...