Listen to this Post
Excited to share my Specialist Programmer (SP) interview journey at Infosys Ltd, Noida.
📌 Step 1: Online Coding Test – 3 Hours
The assessment had 3 DSA problems of increasing difficulty:
1️⃣ Queue + Greedy (Medium)
2️⃣ DP + GCD (Medium-Hard)
3️⃣ DP + HashMap + Prime Factorization (Hard)
📌 Step 2: The Technical Interview – But First, Another Coding Test! 🤯
In previous years, Infosys interviews began directly without any assessments at their office. However, this time, they introduced a live online coding assessment before the actual interview, conducted at their office. Additionally, for the first time, candidates were asked to prepare and present a PPT as part of the process. So, upon arriving at the Infosys Noida campus, I was required to take another live coding assessment on their platform. However, there was a twist—it had to be completed in front of the interviewer!😮
2 coding problems (Medium to Hard difficulty)
💡Problem 1: DP/BFS
💡Problem 2: Binary Tree
Choose any one question and I had 40 minutes to implement the solution.
Once I completed this assessment, my interview began immediately!🚀
1️⃣ Self- & PPT Presentation
The interviewer started the discussion by asking me to introduce myself and present the PPT.
2️⃣ AI Specialization Discussion
Since my specialization is AI, the interviewer was curious about:
✅ Why did I choose AI?
✅ How have I used AI technology in my projects?
✅ Core AI concepts with real-world applications
3️⃣ Java Programming Discussion
Since I mentioned Java as my primary programming language💻:
✅ OOPs Concepts with real-world examples (I used a Banking System analogy)
✅ Interfaces in Java
✅ Call by Value/Call by Reference
✅ Memory Management
✅ Why doesn’t Java support Multiple Inheritance?
4️⃣ Internship Discussion
The interviewer asked me in-depth questions about my internships:
✅ What projects did I work on?
✅ What technologies did I use?
5️⃣ Projects Discussion – A Surprising Turn!
I was ready for deep technical questions about my projects, but surprisingly, the interviewer was satisfied with just the problem statement and its real-world impact!
✨Lesson: Sometimes, the ability to identify and solve real-world problems is just as important as the tech stack!
6️⃣ Coding Discussion
This part was all about my problem-solving approach:
✅ Explain my approach to the problem I solved in the pre-interview assessment
✅ Discuss time and space complexity
✅ Write a recursive Fibonacci function and analyze its time and space complexity
7️⃣ My Turn to Ask!
I inquired about technologies to focus on before joining, and the interviewer shared key industry trends.
My Final Thoughts
The process was structured, engaging, and insightful. The interviewer made it feel more like a discussion than an evaluation.
A huge thanks to Infosys for this opportunity! If you’re preparing for this role, I hope this experience helps.
Good luck🍀
You Should Know:
1. Dynamic Programming (DP) in Java
Dynamic Programming is a crucial concept for coding interviews. Here’s an example of a DP solution for the Fibonacci sequence:
public class Fibonacci {
public static int fibonacci(int n) {
if (n <= 1) return n;
int[] dp = new int[n + 1];
dp[0] = 0;
dp[1] = 1;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + dp[i - 2];
}
return dp[n];
}
public static void main(String[] args) {
int n = 10;
System.out.println("Fibonacci of " + n + " is: " + fibonacci(n));
}
}
2. Binary Tree Traversal in Java
Binary Tree problems are common in coding interviews. Here’s an example of Inorder Traversal:
class Node {
int data;
Node left, right;
public Node(int item) {
data = item;
left = right = null;
}
}
class BinaryTree {
Node root;
BinaryTree() {
root = null;
}
void inorderTraversal(Node node) {
if (node == null) return;
inorderTraversal(node.left);
System.out.print(node.data + " ");
inorderTraversal(node.right);
}
public static void main(String[] args) {
BinaryTree tree = new BinaryTree();
tree.root = new Node(1);
tree.root.left = new Node(2);
tree.root.right = new Node(3);
tree.root.left.left = new Node(4);
tree.root.left.right = new Node(5);
System.out.println("Inorder Traversal:");
tree.inorderTraversal(tree.root);
}
}
3. Linux Commands for Developers
As a developer, familiarity with Linux commands is essential. Here are some useful commands:
- Check System Information:
uname -a
-
Search for Files:
find /path/to/search -name "filename"
-
Monitor System Processes:
top
-
Compress Files:
tar -czvf archive.tar.gz /path/to/files
4. Windows Commands for Developers
For Windows users, here are some useful commands:
-
Check IP Configuration:
ipconfig
-
Ping a Server:
ping google.com
-
List Directory Contents:
dir
-
Check System Information:
systeminfo
What Undercode Say:
The Infosys Specialist Programmer interview process emphasizes both technical expertise and problem-solving skills. Mastering core concepts like Dynamic Programming, Binary Trees, and Object-Oriented Programming is essential. Additionally, familiarity with Linux and Windows commands can give you an edge in real-world development scenarios. Practice coding problems regularly, and don’t forget to focus on real-world applications of your projects.
Expected Output:
- Fibonacci Sequence Implementation
- Binary Tree Traversal Code
- Linux Commands for System Monitoring
- Windows Commands for Network Configuration
References:
Reported By: Jagmohan Kushwaha – Hackers Feeds
Extra Hub: Undercode MoN
Basic Verification: Pass ✅
