Company sheets › Infosys
Infosys interview preparation
One of India’s top IT services companies with large campus and off-campus drives. Roles include Systems Engineer, Digital Specialist Engineer and Specialist Programmer; HackWithInfy is a coding contest that can lead to the higher roles.
Infosys hiring process
- Online assessment — Logical and quantitative aptitude, verbal ability, pseudocode / puzzle questions; higher roles add hard coding problems.
- Technical interview — DSA basics, your projects, OOP, DBMS and sometimes a program on paper or screen.
- HR interview — Background, strengths, relocation and willingness to learn new technologies.
The process changes from year to year — check the official notice for the exact pattern.
Aptitude topics to practise
- percentages
- profit and loss
- time and work
- time speed distance
- number series
- coding decoding
- blood relations
- reading comprehension
- syllogisms
- ranking and order
- sentence correction
Interview topics
Tips
- Pseudocode questions test whether you can trace code by hand — practise dry-running loops and recursion.
- For the Specialist Programmer role, expect Medium–Hard DSA (DP, graphs, greedy).
- Have one project you can explain end to end, including what you would improve.
Infosys DSA problems (90)
- Sum of Two Numbers — Easy
- Even or Odd — Easy
- Count Digits — Easy
- Reverse a Number — Easy
- Palindrome Number — Easy
- GCD and LCM — Easy
- Prime Check — Easy
- Sum of Digits — Easy
- Factorial — Easy
- Armstrong Number — Easy
- All Divisors — Easy
- Leap Year — Easy
- Decimal to Binary — Easy
- Perfect Number — Easy
- Prime Factorization — Easy
- Floyd's Triangle — Easy
- Star Pyramid — Easy
- Count Primes up to N — Medium
- Maximum in an Array — Easy
- Second Largest Element — Easy
- Check if Array is Sorted — Easy
- Remove Duplicates from Sorted Array — Easy
- Left Rotate by K — Easy
- Move Zeros to End — Easy
- Missing Number — Easy
- Max Consecutive Ones — Easy
- Leaders in an Array — Easy
- Pascal's Triangle Row — Easy
- Merge Two Sorted Arrays — Easy
- Range Sum Queries — Easy
- Union of Two Sorted Arrays — Easy
- Rotate Array Right by K — Easy
- Repeating and Missing Number — Medium
- Reverse a String — Easy
- Check Palindrome — Easy
- Count Vowels — Easy
- Valid Anagram — Easy
- First Non-Repeating Character — Easy
- Longest Common Prefix — Easy
- String Compression — Easy
- Roman to Integer — Easy
- Check String Rotation — Easy
- Remove Outermost Parentheses — Easy
- Largest Odd Number in a String — Easy
- Maximum Nesting Depth of Parentheses — Easy
- Pangram Check — Easy
- Reverse Words in a String — Medium
- Frequency of Elements — Easy
- Contains Duplicate — Easy
- Intersection of Two Arrays — Easy
- Squares of a Sorted Array — Easy
- Happy Number — Easy
- Pair Sum in a Sorted Array — Easy
- Maximum Sum Subarray of Size K — Easy
- Longest Subarray with Sum K — Medium
- Lower Bound — Easy
- Square Root (Floor) — Easy
- Search Insert Position — Easy
- Floor and Ceil in a Sorted Array — Easy
- Row with Maximum 1s — Easy
- Binary Search — Medium
- Nth Root of an Integer — Medium
- Fibonacci Number — Easy
- Permutations of a String — Medium
- Tower of Hanoi — Medium
- Rat in a Maze — Medium
- Reverse a Linked List — Easy
- Middle of a Linked List — Easy
- Palindrome Linked List — Easy
- Merge Two Sorted Lists — Easy
- Remove Duplicates from Sorted List — Easy
- Delete All Occurrences of a Key — Easy
- Detect a Cycle in a Linked List — Easy
- Implement Queue using Stacks — Easy
- Evaluate Postfix Expression — Medium
- Infix to Postfix — Medium
- Minimum Cost to Connect Ropes — Easy
- Height of a Binary Tree — Easy
- Inorder Traversal — Easy
- Climbing Stairs — Easy
- Unique Grid Paths — Easy
- Frog Jump — Easy
- Assign Cookies — Easy
- Lemonade Change — Easy
- Minimum Coins (Greedy) — Easy
- Fractional Knapsack — Medium
- Count Set Bits — Easy
- Power of Two — Easy
- Check if Kth Bit is Set — Easy
- Minimum Bit Flips — Easy