preloader
  • Home
  • Previous Questions

Contains previous problem statements given by various recruitors during their selection process.

1st Jan, 0001

Infosys

IDQuestions
1Two Sum
3Longest Substring Without Repeating Characters
5Longest Palindromic Substring
7Reverse Integer
153Sum
184Sum
22Generate Parentheses
26Remove Duplicates from Sorted Array
55Jump Game
62Unique Paths
75Sort Colors
88Merge Sorted Array
121Best Time to Buy and Sell Stock
125Valid Palindrome
152Maximum Product Subarray
189Rotate Array
198House Robber
300Longest Increasing Subsequence
315Count of Smaller Numbers After Self
354Russian Doll Envelopes
387First Unique Character in a String
540Single Element in a Sorted Array
560Subarray Sum Equals K
886Score of Parentheses
902Minimum Number of Refueling Stops
1013Fibonacci Number
1034Subarrays with K Different Integers
1219Longest Well-Performing Interval
1458Sort Integers by The Number of 1 Bits
1647Can Convert String in K Moves
1930Maximum Number of Consecutive Values You Can Make
2002Stone Game VIII
2077Largest Number After Mutating Substring
2162Partition Array Into Two Arrays to Minimize Sum Difference
2329Maximum Product After K Increments
2415Count the Number of Ideal Arrays
2466Maximum Segment Sum After Removals
2502Sort the People
2544Minimum Addition to Make Integer Beautiful
2554Minimum Total Distance Traveled
2584Number of Nodes With Value One
2696The Number of Beautiful Subsets
2726Minimum Reverse Operations
2811Determine the Minimum Sum of a k-avoiding Array
3017Number of Beautiful Integers in the Range
3026Find the Minimum Possible Sum of a Beautiful Array
3181Find Building Where Alice and Bob Can Meet