Problem database last updated: June 20, 2025
7 problems · 1 Easy, 5 Medium, 1 Hard · Ranked #187 of 458
1 Easy
14% · avg 23%
5 Medium
71% · avg 59%
1 Hard
14% · avg 18%
Based on 7 reported problems, Info Edge interviews are in line with industry averages - 14% Hard vs 18% overall. The majority (71%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Info Edge puts unusual emphasis on hash-table (42.9% of problems, 1.9x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (71.4%), hash-table (42.9%), linked-list (14.3%), math (14.3%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Find the Minimum and Maximum Number of Nodes Between Critical Points A critical point in a linked list is defined as either a local maxima or a local minima. | Medium | Very Likely | linked-list | Solve |
Find The Maximum Factor Score Of Array You are given an integer array nums. The factor score of an array is defined as the product of the LCM and GCD of all elements of that array. Return the maximum... | Medium | Very Likely | arraymathnumber-theory | Solve |
Count Almost Equal Pairs I You are given an array nums consisting of positive integers. Two integers x and y are called almost equal if both integers can become equal after performing the... | Medium | Very Likely | arrayhash-tablecounting | Solve |
Two Out of Three Given three integer arrays nums1, nums2, and nums3, return a distinct array containing all the values that are present in at least two out of the three arrays.... | Easy | Very Likely | arrayhash-tablebit-manipulation | Solve |
Subrectangle Queries Implement the class SubrectangleQueries which receives a rows x cols rectangle as a matrix of integers in the constructor and supports two methods: | Medium | Likely | arraydesignmatrix | Solve |
Bus Routes You are given an array routes representing bus routes where routes[i] is a bus route that the ith bus repeats forever. | Hard | Likely | arrayhash-tablebreadth-first-search | Solve |
Longest Palindromic Substring Given a string s, return the longest palindromic substring in s. | Medium | Likely | two-pointersstringdynamic-programming | Solve |
Find the Minimum and Maximum Number of Nodes Between Critical Points
SolveA critical point in a linked list is defined as either a local maxima or a local minima.
Find The Maximum Factor Score Of Array
SolveYou are given an integer array nums. The factor score of an array is defined as the product of the LCM and GCD of all elements of that array. Return the maximum...
Count Almost Equal Pairs I
SolveYou are given an array nums consisting of positive integers. Two integers x and y are called almost equal if both integers can become equal after performing the...
Two Out of Three
SolveGiven three integer arrays nums1, nums2, and nums3, return a distinct array containing all the values that are present in at least two out of the three arrays....
Subrectangle Queries
SolveImplement the class SubrectangleQueries which receives a rows x cols rectangle as a matrix of integers in the constructor and supports two methods:
Bus Routes
SolveYou are given an array routes representing bus routes where routes[i] is a bus route that the ith bus repeats forever.
Longest Palindromic Substring
SolveGiven a string s, return the longest palindromic substring in s.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Info Edge interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Info Edge interviews focus heavily on array, hash-table, linked-list problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Info Edge interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Info Edge has been reported to ask 7 distinct coding problems. The most common topics are array, hash-table, linked-list. 1 are Easy difficulty, 5 are Medium, and 1 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 7 reported problems, Info Edge interviews are in line with industry averages - 14% Hard vs 18% overall. 71% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, hash-table, linked-list. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Info Edge coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Info Edge interview with AIarrow_forward
