Siddhesh Jadhav

🚀 Interview Experience: Siemens Internship

Welcome to my Siemens Internship Interview Experience! I hope this helps future aspirants.

---

1. 🏢 Company & Role

• Company: Siemens
• Role: Intern
• Batch/Year of Graduation: 2026
• Branch: Computer Science/IT/EnTC

---

2. 🗓 Application Process

• How did you apply? On-Campus Recruitment Drive
• Timeline:
  • Application Date: January 2025
  • Online Assessment Date: Early February 2025
  • Interview Dates: February 2025
  • Offer Date: Mid-February 2025

---

3. 💬 Hiring Rounds

Round 1: Online Assessment

• Type: MCQ-based test (Aptitude, Coding, OOPS, Data Structures, C++)
• Duration: 1 hour
• Description:
  • The test consisted of aptitude questions and technical questions covering C++, Object-Oriented Programming, and Data Structures.
  • Around 120 candidates appeared, and 60 were shortlisted for interviews.
• Difficulty Level: Medium
• Experience: I found the coding and OOPS questions manageable as I had recently revised them.

Round 2: Technical Interview

• Type: In-person (Coding, Data Structures, OOPS, Projects, Research Paper Discussion)
• Duration: 45-50 minutes
• Interviewers: 2
• Description:
  • Personal Questions: Introduction, Family Background, Nervousness Level.
  • Project Discussion:
    • Asked to explain the project I worked on.
    • Requested to draw the workflow/architecture diagram of my project.
    • This project later won in the TechFiesta Hackathon, so the interviewers were already impressed.
  • Research Paper Discussion: Asked about my publication and contributions.
  • Data Structures & Algorithms:
    • I mentioned I was comfortable with Trees, Graphs, and DP (since I had recently practiced Striver’s Sheet), but they decided to focus on Linked Lists instead.
    • Questions Asked:
      1. Difference between Array/Vector and Linked List.
      2. Boilerplate code for Linked List.
      3. Auxiliary functions in Linked List.
      4. Why did I use class instead of struct for implementing a Node?
      5. Given an infinitely long Linked List, how to delete a node with a single pointer?
      6. How to detect a cycle in a Linked List?
      7. Types of Linked Lists and their differences.
  • OOPS Concepts:
    • 3-4 questions related to Object-Oriented Programming.
  • Puzzle:
    • Given matchsticks, shift them to form three squares.
  • Closing: They asked if I had any questions. I asked 3-4 questions, which made them happy.
• Difficulty Level: Medium to Hard
• Experience: I felt confident because I had recently practiced DSA. The project discussion and research paper questions were my strong points.

Round 3: HR Interview

• Type: Online
• Duration: 20-30 minutes
• Description:
  • Personal Questions:
    • You're from Kolhapur but studying in Pune, which city is better?
    • Asked about my internship and project work.
  • Situational Questions:
    • Given a scenario related to my internship project, how would I handle it?
  • Company & Future Plans:
    • Why should we choose you?
    • Any plans for Masters/MBA?
    • What is the motto of Siemens? (I had read it beforehand.)
  • Closing: She asked if I had any questions.
• Difficulty Level: Easy
• Experience: I was confident, and the HR was friendly. Having read about Siemens beforehand helped.

---

4. 📊 Overall Experience & Tips

• Overall Interview Experience: Very Positive! The interviewers were friendly and encouraging.
• What to prepare? 💯
  • DSA: Linked Lists, Trees, Graphs, Dynamic Programming
  • OOPS: Classes, Objects, Polymorphism, Inheritance
  • Aptitude: Logical Reasoning, Quantitative
  • Projects: Be clear about architecture and implementation
  • HR Round: Learn about Siemens, its values, and motto
• Tips for Aspirants: ✨
  • Be confident and engage with interviewers.
  • Revise DSA, OOPS if applying for Siemens.
  • Know about your projects.
  • Ask questions at the end—they appreciate it!

---

Verdict: Selected ✅

---

• Siemens values diversity and innovation, and they were keen on understanding my research work.
• The technical interview was quite detailed, so be well-prepared.