askIITians interview experience Real time questions & tips from candidates to crack your interview

Teaching Assistant

askIITians

3 rounds | 3 Coding problems

Aayush Jha

Fresher | Oct 2023

Selected

Interview preparation journey

Journey

I recently had an interview with askIITians for a position. The process consisted of three rounds. The first round was an introduction and a brief overview of my resume, where I highlighted my background and experiences. The second round was technical, focusing on the basics of Data Structures and Algorithms (DSA). The interviewer asked detailed questions to assess my understanding of fundamental DSA concepts. The final round was with HR, which covered general questions about my career goals, work ethic, and cultural fit within the company. Overall, the interview process was well structured and thorough, giving me a good opportunity to showcase my skills and experiences.

Application story

I applied for the position at askIITians through Naukri.com. Shortly after submitting my application, I received a call from HR to discuss my background and experience. They explained the interview process and scheduled the first round. The entire process from the initial application to the interview rounds was well-coordinated and efficiently managed by the HR team.

Why selected/rejected for the role?

I was selected for this role due to my strong foundation in Data Structures and Algorithms, relevant experience as a Teaching Assistant, and my ability to effectively communicate complex concepts. My preparation and familiarity with the interview topics helped me perform well in the technical round, and my enthusiasm and alignment with the company's values impressed the HR team.

Preparation

Duration: 6 Months

Topics: Data Structures, Algorithms, Sorting and Searching, Dynamic Programming, Trees and Graphs

Tip

Tip 1: Practice at least 100 questions from each topic.
Tip 2: Review and understand the underlying concepts thoroughly.
Tip 3: Take mock interviews to simulate the actual interview environment.

Application process

Where: Campus

Eligibility: No

Resume tip

Tip 1: For fresher make sure you have relevant problem-solving skills.

Tip 2: At least one strong project which you can convey to the interviewer.

Interview rounds

Round

Easy

Telephonic

Duration10 Minutes

Interview date20 Oct 2023

Coding problem1

The round was conducted over the phone in the afternoon. The environment was professional, and the interviewer was punctual and courteous. They asked questions about my resume and previous experiences, followed by a few problem-solving questions to assess my analytical abilities. The interviewer was friendly and encouraged me to explain my thought process while solving the problems.

1.

I was provided with some real world problem about global warming which I was supposed to provide the solution to according to the question asked by the HR.

Problem approach

Tip 1: Carefully read and understand the problem statement before attempting to solve it. T

ip 2: Break down the problem into smaller parts and tackle each part systematically.

Tip 3: Always test your solution with different inputs to ensure its correctness and efficiency.

Round

Easy

Online Coding Interview

Duration25 Minutes

Interview date31 Oct 2023

Coding problem1

The round was conducted online via Google Meet. The environment was well-organized and smooth, with no technical issues. The interviewer was professional and clear in their instructions. The round included both multiple-choice questions (MCQs) and coding problems.

1. Maximum Subarray Sum

Moderate

25m average time

75% success

0/80

Asked in companies

Given an array of integers, write a function to find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. This problem is commonly solved using Kadane's Algorithm.

Problem approach

Tip 1: Initialize two variables: max_current to keep track of the maximum sum of the current subarray, and max_global to store the maximum sum found so far.

Tip 2: Iterate through the array, updating max_current as the maximum of the current element and the sum of max_current and the current element. Update max_global whenever max_current exceeds it.

Tip 3: Make sure to handle edge cases, such as when the array contains only negative numbers or when the array is empty.

Try solving now

Round

Easy

HR Round

Duration5 Minutes

Interview date5 Nov 2023

Coding problem1

It was a HR round basically finalizing my role