Question 1

Two Sum — Infosys Interview Question

Accepted Answer

"Two Sum" is a easy difficulty problem asked at Infosys interviews. It covers the following topics: Array, Hash Table. You can practice it on LeetCode: https://leetcode.com/problems/two-sum

Question 2

Find Building Where Alice and Bob Can Meet — Infosys Interview Question

Accepted Answer

"Find Building Where Alice and Bob Can Meet" is a hard difficulty problem asked at Infosys interviews. It covers the following topics: Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Monotonic Stack. You can practice it on LeetCode: https://leetcode.com/problems/find-building-where-alice-and-bob-can-meet

Question 3

Minimum Reverse Operations — Infosys Interview Question

Accepted Answer

"Minimum Reverse Operations" is a hard difficulty problem asked at Infosys interviews. It covers the following topics: Array, Breadth-First Search, Ordered Set. You can practice it on LeetCode: https://leetcode.com/problems/minimum-reverse-operations

Question 4

Count the Number of Ideal Arrays — Infosys Interview Question

Accepted Answer

"Count the Number of Ideal Arrays" is a hard difficulty problem asked at Infosys interviews. It covers the following topics: Math, Dynamic Programming, Combinatorics, Number Theory. You can practice it on LeetCode: https://leetcode.com/problems/count-the-number-of-ideal-arrays

Question 5

Transform Array by Parity — Infosys Interview Question

Accepted Answer

"Transform Array by Parity" is a easy difficulty problem asked at Infosys interviews. It covers the following topics: Array, Sorting, Counting. You can practice it on LeetCode: https://leetcode.com/problems/transform-array-by-parity

Question 6

Maximum Sum of Subsequence With Non-adjacent Elements — Infosys Interview Question

Accepted Answer

"Maximum Sum of Subsequence With Non-adjacent Elements" is a hard difficulty problem asked at Infosys interviews. It covers the following topics: Array, Divide and Conquer, Dynamic Programming, Segment Tree. You can practice it on LeetCode: https://leetcode.com/problems/maximum-sum-of-subsequence-with-non-adjacent-elements

#	Question Title	Difficulty	Frequency	Topics
1	Two Sum	EASY	100.0	ArrayHash Table
2	Find Building Where Alice and Bob Can Meet	HARD	94.9	ArrayBinary SearchStack+4
3	Minimum Reverse Operations	HARD	93.0	ArrayBreadth-First SearchOrdered Set
4	Count the Number of Ideal Arrays	HARD	90.9	MathDynamic ProgrammingCombinatorics+1
5	Transform Array by Parity	EASY	88.6	ArraySortingCounting
6	Maximum Sum of Subsequence With Non-adjacent Elements	HARD	88.6	ArrayDivide and ConquerDynamic Programming+1
7	Eat Pizzas!	MEDIUM	88.6	ArrayGreedySorting
8	Longest Substring Without Repeating Characters	MEDIUM	88.6	Hash TableStringSliding Window
9	Determine the Minimum Sum of a k-avoiding Array	MEDIUM	86.1	MathGreedy
10	Sort the People	EASY	86.1	ArrayHash TableString+1

Explore 450+ Companies

Companies

Infosys

Want to see more?

Infosys Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Infosys

Want to see more?

Infosys Interview Questions

Ai Assistant Kas