Visa Interview Experience

Last Updated : 21 Oct, 2025

Candidate Information:

  • Status: Third-year Computer Science student in a National Institute of Technology (NIT) college.
  • Interview Date: Oct 15, 2025
  • Software Engineering Internship

Overview of Interview Process:

The process consisted of an Initial Screening through an online coding round conducted through college labs, followed by a single combined Technical + HR round, conducted virtually from the Training and Placement Cell office.

Package offered: 90k per month (for 2 months) + 1Lakh for relocation assistance.

Initial Screening

  • Duration: 70 minutes only
  • Method: Online coding round conducted in college labs on the CodeSignal platform
  • Focus: Data Structures and Algorithms (DSA)
  • Key Questions: The test included 4 DSA questions:
  • First 2 questions: Easy-level, basic logic, no advanced algorithms required
  • Question 3: Medium-level, implementation-focused
  • Question 4: Medium to hard-level, required both algorithmic thinking and implementation
  • Each student received different questions, with some getting advanced topics like Segment Tree or Trie.
  • Only students who successfully solved all 4 questions were selected for the next round.
  • Obstacles: High competition: nearly 500 students appeared, but only 12 were selected. The main challenge was the complexity of the last two questions, which tested both problem-solving and coding speed.
  • ✅ I cleared this round successfully.

Technical + HR Round

  • Duration: 45–60 minutes
  • Method: Virtual online round conducted from the Training and Placement Cell office
  • Focus: Combination of DSA, Object-Oriented Programming (OOP) concepts, SQL, Operating Systems, and HR discussion
  • Experience: The interviewer was very experienced (23 years of experience), but friendly and approachable.
  • DSA Questions:
  • Greedy problem: Bricks with weights and costs — find the minimum bricks required for 100kg at least cost (brick fractions allowed)
  • Explain why greedy works, sorting order, and sorting method used- Explain Merge Sort in detail and its time complexity
  • Explain how to solve using Dynamic Programming
  • OOP Questions:
  • Preferred language discussion (C++ vs Java)
  • Overriding, overloading, static vs dynamic binding, and virtual functions in C++
  • Core CS Questions:
  • Difference between Arrays and Linked Lists, why arrays allow faster access
  • Internal implementation of arr[index] access in arrays
  • Simple SQL query and explanation of GROUP BY clause
  • Operating Systems: Difference between threads and processes, and how to create a thread
  • Project discussion: Not asked, but fully prepared
  • Behavioral / HR discussion:
  • Asked about the most complex code I’ve written — struggled to answer initially
  • Follow-up on longest code written — could not convey properly
  • Asked my questions about company projects, languages used, and work culture
  • Obstacles: Explaining complex coding approaches under time pressure
  • Difficulty recalling a suitable complex code example. Managing both technical and HR discussion in a single round
  • ✅ Outcome: Selected among 6 students for the internship
Comment

Explore