Indus Valley Partners interview experience Real time questions & tips from candidates to crack your interview

Advance ASE

Indus Valley Partners

3 rounds | 7 Coding problems

Anonymous

Fresher | Jul 2022

Rejected

Interview preparation journey

Preparation

Duration: 3 months

Topics: Data structures, Algorithms, OOPS, SQL, JavaScript

Tip

Tip 1 : Prepare DSA thoroughly with fundamentals.
Tip 2 : Prepare commonly asked SQL queries.

Application process

Where: Campus

Eligibility: 60% and above throughout (10th, 12th, UG, PG)

Resume tip

Tip 1 : Have atleast one project.
Tip 2 : Only put skills you are really comfortable with

Interview rounds

Round

Easy

Online Coding Interview

Duration65 Minutes

Interview date27 Jul 2022

Coding problem2

It was at 8:30 am. The test was to be given from home, online on mettl platform and it was not proctored in any way. 65 questions had to be done in 65 minutes.

1. Javascript question

Show an example of callback function with help of code in JavaScript.

Problem approach

I made a simple function to print a string and passed it as a callback in another function which had a setTimeOut method inside it. I then called the second function.

2. OOPS Question

Show how inheritance works in C# with help of code.

Problem approach

I made a parent class with 2 public data members, and then created a child class which inherits from parent class and made another public data member in it. I then instantiated the child class and showed all 3 data members being used.

Round

Medium

Video Call

Duration30 Minutes

Interview date27 Jul 2022

Coding problem3

It was in the afternoon around 3 pm. The interviewer was calm and polite and gave decent amount of time for me to come up with answers and also gave hints to some answers. Mostly DS and SQL questions were aksed.

1. Reverse Linked list

Moderate

15m average time

85% success

0/80

Asked in companies

Given a singly linked list of integers. Your task is to return the head of the reversed linked list.

For example:

The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.

Follow Up :

Can you solve this problem in O(N) time and O(1) space complexity?

Problem approach

I used the iterative approach. I initialized 3 pointers prev as NULL, curr as HEAD,and next as NULL.
I then used a while loop while current != NULL and did the following steps in loop
next=curr->next
curr->next = prev
prev=curr
curr=next

Try solving now

2. Cycle Detection in a Singly Linked List

Moderate

15m average time

80% success

0/80

Asked in companies

You are given a Singly Linked List of integers. Return true if it has a cycle, else return false.

A cycle occurs when a node's next points back to a previous node in the list.

Example:

In the given linked list, there is a cycle, hence we return true.

Problem approach

I explained floyd's algorithm to detect and also fix the loop.

Try solving now

3. DBMS Question

SQL query to find Nth highest salary

Problem approach

Tip 1: Practice commonly asked SQL queries

Round

Medium

Video Call

Duration30 minutes

Interview date8 Jul 2022

Coding problem2

It was around 12pm. The interview was mostly about DSA fundamentals and some SQL as well. The interviewer was a senior developer and was polite and helpful during the interview.