IVP (Indus Valley Partners) Aptitude and Interview Preparation Guide for Associate Software Engineer

27 min readDec 30, 2025

I have combined all the interview experiences and questions available online asked by IVP in their interview process.

Indus Valley Partners (IVP) ASE Role — Interview Experiences

Interview Experience 1

Round 1: Online Test

Section 1: SQL, OOPS, C#, JavaScript Exact questions not provided, but be prepared with basics and scenario-based MCQs or code snippets in these domains.

Round 2: 1st Technical Interview

Data Structures & Algorithms:

Question 1: Write code to reverse a string.

Question 2: Implement merge sort algorithm.

SQL:

Question 3: Write a SQL query to remove duplicate entries from a table.

Puzzle:

Question 4: 10 Coins Puzzle — Out of 10 coin stacks, one has fake coins that weigh differently. You have a weighing machine. Find the fake stack using just one weighing.

Core Subjects:

OOPS Concepts — Be clear with principles like:

Inheritance
Polymorphism
Abstraction
Encapsulation
Interface vs Abstract class

DBMS — Basic concepts like:

Normalization
ACID properties
Indexes
Joins

Round 3: 2nd Technical Interview

Focus Areas:

Resume-based questions
Explanation of your projects
In-depth OOPS and declaration-based coding questions

Question 1: Explain your major project, tech stack used, and your role.

Question 2: OOPS-based Code — Implement class inheritance with virtual functions.

Question 3: Difference between overriding and overloading.

Question 4: Use of this pointer in C++ or super() in Java.

Question 5: Declaration-based Coding (e.g., structure vs class, const correctness, static variables, access specifiers).

Round 4: HR Round

Question 1: Tell me about yourself.

Question 2: What are your strengths and weaknesses?

Question 3: Describe a time you led a team/project.

Question 4: How do you handle conflicts in a team?

Question 5: Why do you want to join IVP?

Question 6: Where do you see yourself in 5 years?

Question 7: Are you comfortable with relocation and long working hours?

Question 8: What if you’re assigned to a technology you don’t like?

Interview Experience 2

Round 1: Online Assessment (OA)

Total: 65 MCQs across 4 sections

C# (20 Questions): Topics — Syntax, OOPs, Loops, Error Handling, Output Prediction

JavaScript (15 Questions): Topics — Functions, Scope, DOM, Event Handling, Arrays

OOPs (15 Questions): Topics — Concepts, Inheritance, Polymorphism, Interfaces, Abstraction

SQL (15 Questions): Topics — Joins, Group By, Aggregate Functions, Subqueries, Ranking

Be ready for moderate-to-hard MCQs, especially in OOPs and SQL.

Round 2: Technical Interview (30 minutes)

Behavioral/Intro:

Question 1: Tell me about yourself.

Question 2: Why are you interested in software engineering despite being from ICE (Instrumentation and Control Engineering)?

Data Structures (Theory + Coding):

Question 3: Define the following data structures:

Arrays
Dynamic Arrays
Trees
Linked Lists
Stacks
Queues

Question 4: Implement a singly linked list.

Question 5: Convert the singly linked list into a circular linked list.

Question 6: Remove duplicate elements from an array without using extra space.

OOPs Concepts:

Question 7: Explain key OOPs concepts like:

Inheritance
Polymorphism
Abstraction
Encapsulation

SQL:

Question 8: Find the third highest salary from the employee table.

Round 3: DAD Round (Director/Associate Director)

Resume & Projects:

Question 1: Explain one project in detail (without using too much technical jargon).

Question 2: Explain skills listed in your resume (e.g., basic hands-on React questions).

OOPs Deep Dive:

Question 3: What is association, aggregation, and composition?

Question 4: Explain other OOPs concepts with examples.

Coding Question:

Question 5: Find two numbers in an array whose sum equals a given number.

Operating Systems:

Question 6: Do you know anything about OS?

Aptitude:

Question 7: Cut a cake into 8 equal pieces using 3 cuts.

SQL Queries:

Question 8: Find the top 5 customers with the highest order amount.

Round 4: HR Interview

Question 1: Tell me about yourself.

Question 2: How did your previous interview rounds go?

Question 3: What are your strengths and weaknesses?

Question 4: What if you got the same offer from another company in Hyderabad?

Question 5: Tell me about Indus Valley Partners and its CEO.

Interview Experience 3

Round 1: Online Test

Section 1: Quantitative Ability (15 Questions)

Topics included:

Distance between trains
Simple Interest / Compound Interest
Ratio and Proportion
Profit and Loss
Time and Work
Mixtures and Alligations
Percentages
Averages
Speed, Time, and Distance

Be ready for standard aptitude questions from CAT-level or placement preparation books.

Section 2: Technical Section (18 Questions)

Code snippets were given with multiple choice answers (output-based, error detection).

Covered topics:

Basic syntax and logic in C/C++/Java/C#
Loop behavior, recursion, conditions
Basic DBMS concepts:
Normalization
Keys (Primary, Foreign)
Transactions
ACID properties

Section 3: Coding Section (2 Questions)

DSA Coding Problem:

Question 1: Find unique numbers till the index in the array

Example: Input: [1, 2, 1, 3, 2] Output: [1, 2, 2, 3, 3] (Counts unique numbers from start till that index)

SQL Coding Question:

Question 2: Medium-level SQL query question involving joins/subqueries or aggregations.

Round 2: Technical Interview (30 minutes)

Question 1: Introduce yourself.

Question 2: What are the four pillars of OOPs?

Inheritance
Polymorphism
Abstraction
Encapsulation

Question 3: Why are interfaces used in OOPs?

Question 4: What are the different SQL commands?

DDL, DML, DCL, TCL, etc.

Question 5: Explain your final year project.

Question 6: Write a SQL query based on joins.

Round 3: Director Round

Question 1: Explain your projects.

Question 2: Do you know about financial terms like SIP, mutual funds, etc.?

Question 3: Questions asked by candidate to director at the end — You should always prepare 2–3 good questions for the interviewer.

Round 4: HR Interview

Question 1: Introduce yourself.

Question 2: What skills have you learned from internships, projects, and team experiences?

Question 3: What soft skills have you gained from working in committees or teams?

Question 4: Why do you want to join IVP?

Question 5: Who are the higher authorities of IVP (CEO, CTO)?

Question 6: What do you know about IVP and what the company does?

Question 7: Do you have financial knowledge (like SIPs, mutual funds, etc.)?

Interview Experience 4

Round 1: Aptitude + Reasoning + Coding MCQs

Total Questions: 35 Duration: 30 minutes

Question Types:

Aptitude (e.g., profit & loss, time/speed/distance, percentage)
Logical Reasoning (e.g., number series, pattern detection, arrangements)
OOPS-based MCQs (conceptual + code snippets)

Time management was key due to a tight time limit.

Round 2: Pen & Paper Coding (30 minutes)

3 Coding Questions — No pseudocode allowed

Question 1: Sorting problem (5 marks) Details not specified, but it wasn’t a direct sort — may include constraints or partial sorting logic.

Question 2: Convert fraction a/b into its simplest form (10 marks) Example: 6/8 to 3/4 using GCD

Question 3: Matrix-based real-world problem (15 marks) Most likely pathfinding, sub-matrix detection, or transformation logic.

Coding could be done in any language. You had to write complete code, not pseudocode.

Round 3: Technical Interview (60 minutes)

Behavioral + Resume:

Question 1: Tell me about yourself.

Question 2: What are your hobbies?

Question 3: Describe your web development project.

Question 4: What is the front-end and back-end tech stack used?

Question 5: Explain the database schema of your project.

Question 6: How is data validated and stored?

Question 7: What improvements would you suggest in your project?

Question 8: Difference between HTML5 and previous versions.

Domain-Based & Scenario:

Question 9: What algorithm does IRCTC use for ticket booking?

Question 10: What happens if two users book the same seat at the same time?

Question 11: What is your approach for race condition in this case? Candidate answered: Timestamp + synchronization.

OOPS Concepts:

Question 12: Why do we need OOPS?

Question 13: What are the 4 pillars of OOPS?

Inheritance
Polymorphism
Encapsulation
Abstraction

Question 14: What is a constructor?

Question 15: What is inheritance?

Question 16: Explain static vs dynamic binding.

Question 17: When are objects initialized in memory?

Question 18: What are interfaces and when are they needed?

DBMS + SQL:

Question 19: What are ACID properties?

Question 20: What is normalization?

Question 21: Write a SQL query using JOIN.

Question 22: Write a SQL query with ORDER BY.

Algorithm + Data-Based Problem:

Question 23: You’re given hourly share market data for 24 hours. Find entry and exit points to maximize profit. This is a variation of the “Best Time to Buy and Sell Stock” problem.

Puzzle:

Question 24: A puzzle related to cricket (Based on user’s hobby — may be logic-based or probability-oriented).

Round 4: Director Interview (25 minutes)

Behavioral + Project:

Question 1: What have you done in college (projects, activities)?

Question 2: What are your hobbies and passions?

Question 3: Tell me about one of your Android projects.

Puzzle + Algorithm:

Question 4: Solve a puzzle. (Exact type not mentioned — likely logic or trick-based)

Question 5: Write an algorithm to compute sum of 1 to n with constraints. Later optimized collaboratively during discussion.

Round 5: HR Interview (40 minutes)

Personal & Behavioral:

Question 1: Tell me something about yourself.

Question 2: Tell me about your background.

Question 3: Why do you want to join IVP?

Question 4: What do you think about your institute/campus life?

Question 5: How do you handle conflict of opinions with others?

Question 6: Describe a real-life scenario where you had to resolve a conflict.

Question 7: What did you like in the IVP interview process?

Question 8: What did you dislike in the process?

Question 9: Do you have any questions for us?

Interview Experience 5

Round 1: Aptitude + Reasoning + OOPs-Based MCQs

Total Questions: 35 Duration: 30 minutes

Topics Covered:

Aptitude:

Percentages
Time & Work
Speed, Time, Distance
Profit & Loss
Ratio and Proportion

Reasoning:

Series
Patterns
Logical sequencing
Blood relations

OOPs + Basic Programming MCQs:

Inheritance, Polymorphism
Output-based C++/Java snippets
Interface vs Abstract class
Constructor behavior
Object initialization

Mostly easy-medium difficulty, but 30-minute limit was the major challenge.

Round 2: Pen & Paper Coding (30 minutes)

3 Coding Questions (No pseudocode allowed)

Question 1: Sorting problem (5 marks) Likely involved a twist (e.g., sort by custom order, multiple keys, etc.)

Question 2: Simplify a fraction a/b to its simplest form (10 marks) Example: 6/8 to 3/4 Use GCD to divide both numerator and denominator.

Question 3: Matrix-based real-world problem (15 marks) Could involve pathfinding, rotation, transformation, or search within a matrix.

Round 3: Technical Interview (60 minutes)

General & Resume:

Question 1: Tell me about yourself.

Question 2: What are your hobbies?

Project Questions:

Question 3: Describe your web development project.

Question 4: What front-end technologies did you use?

Question 5: What are the functionalities of the project?

Question 6: Describe the database schema.

Question 7: What kind of data did you store and how?

Question 8: How did you validate input and check for errors?

Question 9: How is HTML5 different from previous versions?

Question 10: What improvements can be made in your project?

System Design & Real-world Logic:

Question 11: What algorithm does IRCTC use for ticket booking?

Question 12: How does the system allocate seats when multiple people book simultaneously?

Question 13: How would you handle concurrency in this case? Candidate used timestamp + synchronization.

OOPS Concepts:

Question 14: Why is OOPS needed?

Question 15: What are the 4 pillars of OOPS?

Abstraction
Encapsulation
Inheritance
Polymorphism

Question 16: What is a constructor?

Question 17: What is inheritance?

Question 18: What is the difference between static and dynamic binding?

Question 19: When are objects initialized in memory?

Question 20: What is an interface? Why and when is it used?

DBMS & SQL:

Question 21: What are ACID properties?

Question 22: What is normalization?

Question 23: Write a SQL query using JOIN.

Question 24: Write a SQL query with ORDER BY.

Algorithm + Real-world Problem:

Question 25: You’re given hourly stock market data for 24 hours. Design an algorithm to find entry and exit points to maximize profit.

Puzzle:

Question 26: A puzzle related to cricket. (Hobby-based, probably involving logic or rules of the game)

Round 4: Director Interview (25 minutes)

Personal & Resume:

Question 1: What have you done in your college life?

Question 2: What are your hobbies and passions?

Question 3: Tell me about your Android project.

Problem Solving:

Question 4: Solve a puzzle. (Logic or trick-based; exact puzzle not specified)

Question 5: Write an algorithm to compute the sum from 1 to n under certain constraints. Discussed and optimized collaboratively.

Round 5: HR Interview (40 minutes)

HR + Personality Questions:

Question 1: Tell me something about yourself.

Question 2: Tell me about your background.

Question 3: Why do you want to join IVP?

Question 4: What do you think about your college and its campus?

Question 5: How would you handle a conflict of opinion with a teammate?

Question 6: Give a real-life scenario where you faced a conflict and how you resolved it.

Question 7: What did you like about the IVP interview process?

Question 8: What did you dislike about the process?

Question 9: Do you have any questions for us?

Interview Experience 6

Round 1: Written Test (60 minutes)

Topics:

Aptitude & Logical Puzzles
Basic Algorithms
Core Java Concepts

Round 2: Technical Interview (45–50 minutes)

Introductory:

Question 1: Tell us about yourself.

Question 2: Walk us through your projects.

Object-Oriented Programming (OOPs):

Question 3: What is compile-time polymorphism?

Question 4: What is run-time polymorphism?

Question 5: Explain the diamond problem.

Question 6: What is a virtual destructor?

Question 7: What is operator overloading?

Question 8: What is operator overriding?

Java-Specific:

Question 9: Explain threading in Java.

Question 10: Exception handling in Java.

Question 11: Differences between method overloading and overriding.

Algorithms & Data Structures:

Question 12: Explain searching algorithms.

Question 13: Explain sorting algorithms:

Quick Sort
Merge Sort
Insertion Sort
Selection Sort
Bucket Sort
Radix Sort
Count Sort

Question 14: Time and space complexities for each sorting technique.

Question 15: Use of auxiliary space in sorting.

SQL / DBMS:

Question 16: Write a query to find the second maximum element.

Question 17: Types of joins in SQL.

Question 18: Given a table, normalize it (Explain the steps).

Question 19: What is a schema in DBMS?

Question 20: How would you design a database schema?

Python (based on resume):

Question 21: Questions about your Python project.

Question 22: Questions about the Matlab project.

General/Behavioral:

Question 23: What is GSoC?

Question 24: What is GCI?

Question 25: Explain your role in the technical group for women.

Question 26: (Stress question) Why did you make a group only for females? Don’t you think that’s racial?

Puzzles / Logical Thinking:

Question 27: Binary Search-based logical puzzle.

Round 3: HR + Director Round (30 minutes)

HR Questions:

Question 1: What do you know about Indus Valley Partners (IVP)?

Question 2: What are your weaknesses?

Question 3: Why should we hire you?

Question 4: What are your hobbies?

Director Technical Questions:

Question 5: Questions about your projects again.

Question 6: Questions about sorting techniques (repeated from Round 2):

Name and explain different sorting algorithms
Their time and space complexity

Interview Experience 7

Round 1: Online Assessment (OA)

Total Questions: 65

Sections:

C# (20 questions) — syntax, logic, and code snippets
JavaScript (15 questions) — standard + few hard MCQs
OOPs (15 questions) — concepts and theory-based MCQs
SQL (15 questions) — query-based MCQs

Round 2: Technical Interview (30 minutes)

Introduction & Background:

Question 1: Tell me about yourself.

Question 2: Why are you interested in a software engineering role, even though you’re from Instrumentation and Control Engineering?

Data Structures:

Question 3: Define the following data structures:

Arrays
Dynamic Arrays
Trees
Linked Lists
Stacks
Queues

Question 4: Write code to implement a linked list.

Question 5: Convert it into a circular linked list.

Question 6: Remove duplicates from an array without using extra space.

Object-Oriented Programming:

Question 7: Standard OOPs questions (e.g., basic principles, usage, etc.)

SQL:

Question 8: Write a query to find the third highest salary from an employee table.

Round 3: DAD Round (Director/Associate Director)

Resume & Projects:

Question 1: Walk me through one of your projects in detail (avoid too much jargon).

OOPs Concepts:

Question 2: Explain with examples:

Association
Aggregation
Composition

Question 3: Additional OOPs-based questions.

Data Structures:

Question 4: General questions on DS concepts.

Question 5: Write code to find two numbers in an array whose sum equals a given number.

Databases & SQL:

Question 6: SQL queries such as: Top 5 customers with the highest order amount.

ReactJS:

Question 7: What is your experience with React?

Operating Systems:

Question 8: Do you know anything about operating systems?

Aptitude & Puzzle:

Question 9: Aptitude-based questions.

Question 10: Puzzle — Cut a cake into 8 equal pieces using only 3 cuts.

Round 4: HR Interview

Personal Questions:

Question 1: Tell me about yourself.

Question 2: What were your previous interview experiences?

Behavioral:

Question 3: What are your strengths and weaknesses?

Question 4: If you get the same salary from another company in Hyderabad, what would you choose?

Company Knowledge:

Question 5: What do you know about IVP?

Question 6: Who is the CEO of IVP?

Interview Experience 8

Round 1: Online Test (MCQ)

Total Sections: 4

C#
JavaScript
OOPs
SQL

MCQs only — exact questions not disclosed, but likely to include syntax, theory, and small code snippets.

Round 2: Technical Interview 1

Question 1: Introduce yourself.

Question 2: What is a B+ tree?

Get Shubham’s stories in your inbox

Join Medium for free to get updates from this writer.

Remember me for faster sign in

Question 3: What is its use in DBMS?

Question 4: How does inheritance work in OOP?

Question 5: Explain core OOP concepts (e.g., Encapsulation, Abstraction, Inheritance, Polymorphism).

Round 3: Technical Interview 2 (Coding + SQL)

Question 1: Introduce yourself.

Coding Questions (Google Docs):

Question 2: Find the first non-repeating character in a string.

Question 3: Find the smallest subarray with sum greater than K (sliding window expected).

SQL Query (Self-Join):

Question 4: Find employees having the same salary.

Round 4: HR Interview

Question 1: Introduce yourself.

Question 2: Tell me about your internships.

Question 3: What do you know about IVP?

Question 4: What is the highest point in your life?

Question 5: What is the lowest point in your life?

Question 6: Where do you see yourself in 5 years?

Question 7: Do you have any questions for me?

Interview Experience 9

Round 1: Online Coding + MCQ Test (Mettl Platform, 65 minutes)

Total Questions: 65 (Unproctored) Types: Coding + MCQ (JavaScript, OOPs, SQL, C#)

JavaScript:

Question 1: Show an example of a callback function using code in JavaScript.

OOPs (C#):

Question 2: Show how inheritance works in C# with an example.

Round 2: Technical Interview — Video Call (30 minutes)

Topics: Data Structures + SQL

DSA Coding:

Question 1: Reverse a singly linked list (Iterative approach preferred).

Question 2: Detect a cycle in a singly linked list (Use Floyd’s Cycle Detection Algorithm).

SQL:

Question 3: Write a query to find the Nth highest salary (Can use DENSE_RANK(), LIMIT OFFSET, or TOP in T-SQL).

Round 3: Technical Interview — Video Call (30 minutes)

Topics: SQL + Puzzle

SQL:

Question 1: Query to find the average salary of each department. Only include departments where the average salary is greater than 10,000.

Puzzle:

Question 2: 25 horses and only 5 race tracks. How do you find the top 3 fastest horses using the minimum number of races?

Interview Experience 10

Round 1: Online Coding + MCQ Test (Mettl Platform)

Duration: 65 minutes Type: Home-based, unproctored Total Questions: 65 (JavaScript, OOPs, SQL, C#)

Coding Problems:

Question 1: JavaScript Question — Show an example of a callback function using code.

Question 2: OOPs in C# — Show how inheritance works in C# with code.

Round 2: Technical Interview — Video Call

Duration: 30 minutes Focus: Data Structures & SQL

Coding Problems:

Question 1: Reverse a Linked List (Use iterative approach with 3 pointers: prev, curr, next).

Question 2: Cycle Detection in a Singly Linked List (Use Floyd’s Tortoise and Hare algorithm).

Question 3: SQL — Nth Highest Salary — Write an SQL query to find the Nth highest salary from an employee table.

Round 3: Technical Interview — Video Call

Duration: 30 minutes Focus: SQL + Logical Puzzles

Question 1: SQL — Department-wise Average Salary — Find the average salary of every department where the average is greater than 10,000.

Question 2: Puzzle — 25 Horses, 5 Tracks — How to determine the top 3 fastest horses with the minimum number of races.

Interview Experience 11

Round 1: Online Coding Test + MCQ

Date: 27 July 2022 Duration: 45 minutes Type: MCQs + Coding Topics Covered: OOPs, C#, SQL, JavaScript, DBMS

Coding Question:

Question 1: Print Series Without Loops

Problem: Given N and K, print a series by subtracting K from N until it becomes 0 or negative, then add K until it becomes N.

Constraint: No loops allowed

Example: Input: N = 5, K = 2 Output: [5, 3, 1, -1, 1, 3, 5]

Concepts: Recursion, Control flow

Round 2: Technical Interview — Video Call

Date: 27 Dec 2022 Duration: 30 minutes

Coding Question:

Question 1: Height of a Binary Tree

Problem: Find the height of a binary tree.

Definition: Height = number of nodes from root to the deepest leaf.

Approach: Recursively calculate the height of left and right subtrees, return max(left, right) + 1

Concepts: Tree traversal, recursion

Round 3: Technical Interview — Video Call

Date: 28 Dec 2022 Duration: 30 minutes

Puzzle:

Question 1: Cake Cutting Puzzle

Problem: You have a birthday cake. Cut it into 8 equal pieces with only 3 cuts.

Hint: Think in 3D — e.g., first two cuts perpendicular to each other, third cut horizontally slicing the already cut layers in half.

Round 4: HR Interview

Date: 30 Dec 2022 Duration: 15 minutes

HR Question:

Question 1: What will you do if you get a higher package from another company?

Expected Answer: Emphasize loyalty, company values, and growth opportunities.

Example: “I will consider long-term growth and alignment with company goals more important than just the salary figure.”

Indus Valley Partners (IVP) ASE Role (Some important questions)

These questions are for educational purposes only

Quantitative Ability Section

Question 1

Excluding stoppages, the speed of a train is 45 kmph and including stoppage, it is 36 kmph. For how many minutes does the train stop per hour?

Options:

Question 2

4 carpenters made 20 chairs in 5 days. How many chairs will 8 carpenters make in 10 days?

Options:

Question 3

John invested Rs. 35,000 in a business. After 2 years, Sam invested Rs. 35,000 in the business. What will be the ratio in which the profit would be divided between John and Sam, after 3 years?

Options:

Question 4

A dice is rolled twice. What is the probability that the sum of the numbers is 11?

Options:

1/36
1/18
None of the given options
1/9

Question 5

The ratio of patients undergoing a surgery to the ratio of patients surviving the surgery is 14:11. What is the percentage of patients who survive the surgery?

Options:

85.57%
70.25%
78.57%
73.57%

Question 6

If a book is marked at $25 and is sold at a discount of 20%, then what is its selling price?

Options:

$20
None of the given options
$22.50
$24

Question 7

The sum of series (5x+7y) + (8x+5y) + (11x+3y) + (14x+y) + … upto 25 terms is

Options:

1229x-600y
1025x-425y
1026x-425y
1230x+522y
1025x+425y

Question 8

The length, breadth and height of a room, in the shape of a cuboid, are increased by 10%, 20% and 50%, respectively. Find the percentage change in the volume of the room.

Options:

Question 9

Find the remainder of the following expression: (291 × 800 / 11 + (596 × 677 × 41)) / 19

Options:

Question 10

The average wages of a worker during a fortnight comprising 15 consecutive working days was Rs. 120 per day. During the first 7 days, his average wages was Rs. 110/day and the average wages during the last 7 days was Rs. 124/day. What was his wage on the 8th day?

Options:

Rs. 163
Rs. 162
Rs. 129
Rs. 135

Question 11

A color TV and a mobile phone are sold for Rs. 12,000 each. The TV is sold at a loss of 20% whereas the mobile phone is sold at a profit of 20%. Find the gain or loss in the whole transaction.

Options:

Rs. 1,040, loss
Rs. 960, loss
Rs. 1,000, loss
Rs. 1,200, loss

Question 12

What will a sum of Rs. 35,000 amount to after 2 years if a compound interest of 6% per annum is provided?

Options:

Rs. 41,987
Rs. 38,887
Rs. 39,326
Rs. 39,330

Coding Section

Question 1: Sour Candy

Problem Statement:

You are a candy shop owner who keeps a stock of sour candies with different powers of sourness. The customers are given X number of candies in an array A to choose from and they can select a subsequence of candies from this given array.

The sour candies have a unique property though, in a particular chosen subsequence the power of every candy will be equal to the minimum element (power of sourness) in that subsequence.

As the customers want the set of candies with the most sourness, your task is to help them find and return the maximum power of sourness you can achieve.

Input Specification:

input1: An integer X, representing the number of candies
input2: An integer array A, representing the sourness of each candy respectively

Output Specification: Return an integer value representing the maximum power of sourness you can achieve.

Example 1:

Input:
input1: 8
input2: {42, 4, 26, 39, 20, 46, 20, 40}

Output: 156Explanation:
By choosing the subsequence {42, 39, 46, 40}, the minimum is 39, so each candy's effective sourness becomes 39. Total = 39 + 39 + 39 + 39 = 156, which is the maximum possible.

Example 2:

Input:
input1: 9
input2: {49, 41, 2, 14, 13, 44, 47, 37, 34}

Output: 204Explanation:
One optimal subsequence is {49, 41, 44, 47, 37, 34}, minimum = 34, total = 34 × 6 = 204.

Python Template:

# Read only region start
class UserMainCode(object):
    @classmethod
    def sourCandy(cls, input1, input2):
        '''
        input1 : int
        input2 : int[]
        
        Expected return type : int
        '''
        # Read only region end
        # Write code here
        pass

Question 2: Coding Marathon

Problem Statement:

In a coding marathon, a participant cleverly solved a task by writing a program that identified if the digits of a number were primes and added those digits. When tested with various inputs, the code passed. Your task is to find and return an integer value representing the sum of the digits of a number N which are primes.

Note: Consider 1 as a prime number.

Input Specification:

input1: An integer value N

Output Specification: Return an integer value representing the sum of the digits of a number N that are primes.

Example 1:

Input:
input1: 232

Output: 7Explanation:
Here, the given integer is 232, and all the digits of this integer are primes. When we add them, we get 2 + 3 + 2 = 7. Therefore, 7 is returned as the output.

Example 2:

Input:
input1: 999

Output: 0Explanation:
Here, the given integer is 999, and all the digits of this integer are non-prime. Therefore, 0 is returned as the output.

Python Template:

# Read only region start
class UserMainCode(object):
    @classmethod
    def sumOfPrime(cls, input1):
        '''
        input1 : int
        
        Expected return type : int
        '''
        # Read only region end
        # Write code here
        pass

Question 3: Number Representation

Problem Statement:

Kevin designs a new number system where he sets 2 limits N and M. All the numbers lying below N will be written as they are. For the numbers between N and M (excluding M), when the number is even then it is represented by “E” otherwise “O”. Your task is to find and return a string displaying the numbers according to the new system.

Note: Exclude ‘0’ from the result obtained.

Input Specification:

input1: An integer N, representing the lower limit
input2: An integer M, representing the upper limit

Output Specification: Return a string displaying the numbers according to the new system.

Example 1:

Input:
input1: 6
input2: 12

Output: 12345EOEOEOExplanation:
Here, the lower limit is 6 (N) and the upper limit is 12 (M). Now the numbers below 6 are 1,2,3,4,5. Even numbers between 6 and 12 (6,8,10) are represented by "E" and odd numbers (7,9,11) are represented by "O". Therefore, 12345EOEOEO is returned as the output.

Example 2:

Input:
input1: 2
input2: 9

Output: 1EOEOEOEExplanation:
Here, the lower limit is 2 (N) and the upper limit is 9 (M). Now the numbers below 2 is 1. Even numbers between 2 and 9 (2,4,6,8) are represented by "E" and odd numbers (3,5,7) are represented by "O". Therefore, 1EOEOEOE is returned as the output.

Python Template:

# Read only region start
class UserMainCode(object):
    @classmethod
    def represent(cls, input1, input2):
        '''
        input1 : int
        input2 : int
        
        Expected return type : string
        '''
        # Read only region end
        # Write code here
        pass

Technical Question

Indus Valley Partners (IVP) ASE Role — Technical Section Questions

Technical Question 1

Assume that you have been assigned to customize a program that incorporates binary tree data structures. While performing unit testing, you find out that balancing the nodes in this binary tree system after every insertion/deletion operation takes too much time and does not provide quick results as required by the business logic of the application. What will you suggest as a viable approach to fix this issue?

Options:

Use a recursive approach while balancing nodes instead of iterative approaches
Implement QuickSort to sort the elements of the binary tree before balancing them
Implement AVL Regular Binary Trees to balance the nodes in order to ensure faster output
Increase the size of the node so that more information can be stored in one place

Technical Question 2

Assume that you are working on a software project that involves managing a circular linked list. The circular linked list supports various operations including deleting the last node from the list and deleting a specific node from the list. You are familiar with the algorithms and strategies for performing these deletions efficiently.

Given this scenario, which statement correctly describes the algorithm for deleting the last node from a circular linked list?

Options:

Traverse the list and keep track of the node before the last node. Update the next pointer of the node before the last node to NULL, then delete the last node
Traverse the list and locate the last node. Set its next pointer to point to NULL
Traverse the list and keep track of the node after the last node. Update the next pointer of the node after the last node to point to the head, then delete the last node
Traverse the list and keep track of the last node. Update the next pointer of the last node to NULL, then delete the last node

Technical Question 3

You are given a binary search tree B with integer values in its nodes. Determine an algorithm to obtain the values of the binary search tree in ascending order.

Options:

Option 1: In-order traversal (left → root → right)

void ascending(struct *BST)
{
    if (root == NULL)
        return;
    ascending(struct*BST->left)
    print (root_value)
    ascending(struct*BST->right)
}

More 2 option will be there

Option 2: Right → root → left traversal

void ascending(struct *BST)
{
    if (root == NULL)
        return;
    ascending(struct*BST->right)
    print (root_value)
    ascending(struct*BST->left)
}

Technical Question 4

What will be the output of the following program?

import java.util.*;
class Main {
    public static void main(String[] args){
        Hashtable<Integer, Integer> hashtable = new Hashtable<>();
        Hashtable<Integer, Integer> newHash = new Hashtable<>();
        hashtable.put(1,100);
        hashtable.put(100,1);
        hashtable.put(5,110);
        hashtable.put(110,5);
        hashtable.put(9,111);
        hashtable.put(111,9);
        Iterator<Integer> itr = hashtable.keySet().iterator();
        while(itr.hasNext()){
            System.out.print(hashtable.get(itr.next()) + " ");
        }
    }
}

Options:

5 100 1 9 110 111
111 110 9 1 100 5
100 1 110 5 111 9
111 110 100 9 5

Technical Question 5

Assume that you have implemented the queue data structure to store the elements, but due to some issue, you need to block the enqueue operation. Which statement is true regarding this operation?

Options:

Blocking the enqueue operation forces the queue to resize and allocate more memory to accommodate additional elements
Blocking the enqueue operation removes the oldest element in the queue to make room for the new element
Blocking the enqueue operation ensures that new elements are not added to the queue once its maximum capacity has been reached

Technical Question 6

Which of the following is/are attribute(s) of <object> tag in HTML?

Options:

All of the given options
shapes
codebase
tabindex

Technical Question 7

What will be the output of the following code snippet?

public class Test {
    public static void show() {
        System.out.print("1");
    }
    public static void main(String[] args) {
        Test t = new Test();
        t = null;
        t.show();
    }
}

Options:

NullPointerException
RuntimeException
1
Compile time error

Technical Question 8

Suppose you are being interviewed, and the interviewer provides you with a code snippet. Determine the correct output.

public class Main {
    int x = 2147483647;
    public static void main(String[] args) {
        Main myObj1 = new Main();
        Main myObj2 = new Main();
        System.out.println(myObj1.x);
        x++;
        System.out.println(myObj2.x);
    }
}

Options:

2147483647 -2147483648
2147483647 2147483647
2147483647 2147483648
-2147483648 2147483647

Technical Question 9

What will be the output when the following code is executed?

var object = {
    x : 1,
    y : 2,
    z : this.x + this.y,
    sum : function () {
        return this.x+this.y;
    }
}
var sum = object.sum;
console.log(sum());
console.log(object.sum());

Options:

NaN 3
NaN NaN
3 3
3 NaN

Technical Question 10

Identify the attribute being set by the constructor of the superclass in the code given below.

class Shape:
    def __init__(self):
        self.color = (255,0,255)

class Circle(Shape):
    circum = 0
    def __init__(self, radius):
        Shape.__init__(self)
        self.radius = radius
    def area(self):
        return(self.radius * self.radius * 22 / 7)
    def circumference(self):
        self.circum = self.radius * 2 * 22 / 7
        return(self.circum)circ = Circle(7)
print(circ.area())
print(circ.color)
print(circ.circumference())

Options:

value for area is set in the class Circle
attribute .color is set to (255,0,255) in the class Shape
attribute circum is set in the class Circle
attribute radius is set in the class Circle

Technical Question 11

Which of the following can not be declared as private?

a) Interface methods b) member functions c) abstract methods

Options:

Only a
Only c
Both a and c
Only b

Technical Question 12

Consider the given code. What will be the output of the code?

class Children {
    private final void flipper() {
        System.out.println("Children");
    }
}
public class Parent extends Children {
    public final void flipper() {
        System.out.println("Parent");
    }
    public static void main(String[] args) {
        new Parent().flipper();
    }
}

Options:

Parent Children
Children
Parent
Children Parent

Technical Question 13

The coder wants to write code with the following conditions:

A. Class Animal having methods sleep which prints “I am Animal and I am sleeping”, and eat method which prints “I am Animal, and I am eating”

B. Class AquaticAnimal which inherits Animal class having method sleep which prints “I am AquaticAnimal, and I am sleeping”

C. Class TerritorialAnimal which inherits Animal class having method eat which prints “I am TerritorialAnimal, and I am eating”

D. Create an object of 3 classes and call method sleep and eat from all the objects

Can the coder write code for the above scenario? If yes, then what will be the code and its output?

Technical Question 14

Assume that in a multi-threaded application, there are two threads that are utilizing shared resources, called Thread A and Thread B. After locking Resource 1, Thread A attempts to lock Resource 2, and after locking Resource 2, Thread B attempts to lock Resource 1. A deadlock is created in this scenario. In the above case, what is the main cause of this deadlock?

Options:

Circular Wait
Mutual Exclusion
No Preemption
Hold and Wait

Technical Question 15

Consider that you want to use a procedure in which you are allowed to combine the data of more than one table in a relational database. You want to use Nested Join, through which the physical joining of two tables is possible. Through this, it uses one joining table as an outer input table while the other one serves as an inner input table.

If one row from the outer table is retrieved with nested loop join, then which deduction is correctly related to the given case?

Options:

Then the row is searched for in the inner table; this process is repeated until all the output rows from the inner table have been searched for in the outer table
Then the row is searched for in the outer table; this process is repeated until all the input rows from the outer table have been searched for in the inner table
Then the row is searched for in the outer table; this process is repeated until all the input rows from the inner table have been searched for in the outer table
Then the row is searched for in the inner table; this process is repeated until all the output rows from the outer table have been searched for in the inner table

Technical Question 16

Which of the given values will be displayed when the following code is executed?

#include <stdio.h>
#define prod(p,q) p*q
int main(){
    int x=3,y=4;
    printf("%d",prod(x+2,y-1));
}

Options:

Technical Question 17

Which of the given values will be displayed when the following code is executed?

#include <stdio.h>
int main(){
    char *a;
    a="d\n";
    a++;
    a++;
    printf(a-2,300);
}

Options:

Technical Question 18

Identify the output of the following code snippet in C.

#include <stdio.h>
int aa(){
    printf("Hi");
}
int bb(){
    printf("hello");
}
int cc(){
    printf("bye");
}
int main(){
    int (*ptr[3]) ();
    ptr[0] = aa;
    ptr[1] = bb;
    ptr[2] = cc;
    ptr[2]();
}

Options:

Error
Hi
hello
bye

Technical Question 19

What will be the output of the following program in C?

#include<stdio.h>
int main(){
    int opt=2;
    switch(opt){
        case 1: printf("1 ");
                break;
        case 2: printf("2 ");
        case 3: printf("3 ");
        default: printf("4 ");
                 break;
    }
}

Options:

1 2 3 4
2 3 4
4
2

Technical Question 20

Given alongside are EmployeeDetails and EmployeeSalary Tables:

Table — EmployeeDetails

EmpId FullName ManagerId DateOfJoining 121 John Snow 321 01/31/2014 321 Walter White 986 01/30/2015 421 Kuldeep Rana 876 27/11/2016

Table — EmployeeSalary

EmpId Project Salary 121 P1 8000 321 P2 1000 421 P1 12000

Which query will fetch FullName and Salary of all the employees?

Options:

SELECT e.FullName, s.Salary FROM EmployeeDetails e INNER JOIN EmployeeSalary s ON e.EmpId = s.Salary;
SELECT e.FullName, s.Salary FROM EmployeeDetails e INNER JOIN EmployeeSalary s ON e.EmpId = s.EmpId;
SELECT e.FullName, s.Salary FROM EmployeeDetails e INNER JOIN EmployeeSalary s ON s.EmpId = s.EmpId;

Technical Question 21

The customer_name data values come from the CUSTOMER_NAME column in the CUSTOMERS table. The columns in the CUSTOMERS table are given. Which of the following statements will you use to produce the output “Dear Customer, customer_name”?

CUSTOMERS table columns:

CUSTOMER_ID NUMBER(4) NOT NULL
CUSTOMER_NAME VARCHAR2(100) NOT NULL
CUSTOMER_ADDRESS VARCHAR2(150)
CUSTOMER_PHONE VARCHAR2(20)

Options:

SELECT dear customer, customer_name, FROM customers;
SELECT “Dear Customer”, customer_name || ‘,’ FROM customers;
SELECT ‘Dear Customer ‘ || customer_name ‘, ‘ FROM customers;
SELECT ‘Dear Customer’, ‘ ‘ || customer_name FROM customers;

Technical Question 22

In an email application, there is no limit for content in the body. What should be the data type for it while designing the table structure?

Options:

BLOB
VARBINARY
TEXT
VARCHAR

Technical Question 23

Assume that a team is working on an inventory management system for a large e-commerce platform. The system handles multiple transactions simultaneously, including order processing, inventory updates, and product catalog changes. The system uses a database to store and manage inventory data. The team needs to ensure that concurrency control problems do not occur by following concurrency control protocols, i.e., locked-based protocols.

Which lock should be used by the team if they want only one transaction to update a data item at a given point in time?
Which kind of lock-based protocol should be used if the team wants the transaction only to release a lock once a commit is performed?

Options:

Exclusive Lock

Strict Two-Phase Locking Protocol

2. Exclusive Lock

Timestamp based Protocol

3. Shared Lock

Strict Two-Phase Locking Protocol

4. Single Lock

Two-Phase Locking Protocol

Technical Question 24

What will be the output of the following CSS program?

<html>
<head>
    <style type="text/css">
        #matrixDiv{
            width: 100px;
            height: 50px;
            background-color: red;
            border: 3px solid;
            margin-top: 50px;
            transform: matrix(1,0.2,-0.3,1,0,1);
        }
    </style>
</head>
<body>
    <div id="matrixDiv">
        This is matrix method
    </div>
</body>
</html>

Note: This question has visual output options showing a red box rotated/skewed in different ways.

Technical Question 25

Which of the following statement is correct for getJSON() method of jQuery?

Statement One — $.getJSON() send an AJAX request to server with POST method to get JSON data

Statement Two — $.getJSON() send an AJAX GET request to server to get JSON data

Statement Three — $.getJSON() send an synchronous request to server to get JSON data

Options:

Statement Two is correct
Statement One & Statement Three both are correct
Statement One is correct
Statement Three is correct