π HackWithInfy 2026 (23 April) β L3 Role Experience
- Posted
- 25 Apr 2026
Summary
I participated in the HackWithInfy coding test and virtual technical interview for an L3 role, solved one problem completely, partially solved another, and received a friendly interview focused on approach.
How it went
Hi everyone,
I recently appeared for HackWithInfy (23 April 2026) for the L3 role, and wanted to share my experience.
π§ Round 1: Coding Test (Duration: ~1+ hour)
There were 2 coding questions:
- Spiral Matrix
π https://leetcode.com/problems/spiral-matrix/description/
Standard traversal problem
Required careful handling of boundaries (top, bottom, left, right) - Palindrome Pairs (Similar Problem)
π https://leetcode.com/problems/palindrome-pairs/description/
Slight variation of this problem
Involved string manipulation + checking palindrome combinations efficiently
Optimal solution would involve hashing / trie concepts
π My performance:
- Solved Q1 completely
- Solved Q2 partially (half)
π» Round 2: Technical Interview (Same Day)
The interview was conducted virtually with a panel.
- OOPS Concepts
- Computer Networks
- Frontend (ReactJS + NextJS)
- System Design
πββοΈ My Experience
I was able to answer almost all the questions
Interviewer was very friendly and supportive
They focused more on approach and understanding rather than just correct answers
π€ Final Thoughts
Iβm not completely sure about the result yet π€
Letβs see what happens!
π‘ Tips for Future Candidates
- Practice standard DSA problems (especially strings & arrays)
- Be strong with OOPS fundamentals
- Revise CN basics
- Have a basic understanding of React / modern web tech
- Be clear in your approach while explaining
Questions asked (2)
- 01
Spiral Matrix
Data Structures & Algorithms Β· Easy
Open the problemStandard traversal problem. Required careful handling of boundaries (top, bottom, left, right).
- 02
Palindrome Pairs
Data Structures & Algorithms Β· Hard
Open the problemSlight variation of the Palindrome Pairs problem. Involved string manipulation and checking palindrome combinations efficiently. Optimal solution would involve hashing/trie concepts.
How they prepared
- Practice standard DSA problems (especially strings & arrays)
- Be strong with OOPS fundamentals
- Revise computer networks basics
- Understand React / modern web technologies
- Explain approaches clearly during interviews