This question was reportedly asked during an interview at ICICI Bank. For the full context, including the candidate's approach and the interview outcome, read the full interview experience on PrepLinc .

This question was reportedly asked during an interview at Quantrium. For the full context, including the candidate's approach and the interview outcome, read the full interview experience on PrepLinc .

Where do these interview questions come from?

All questions on PrepLinc are sourced directly from verified interview experiences shared by students from top universities. This ensures the questions are authentic and relevant to current hiring processes.

How can I filter questions for a specific company or role?

Use our powerful filtering tools at the top of the page. You can narrow down the question bank by company, job role (e.g., Software Engineer), specific topics (like 'Arrays' or 'System Design'), and even the interview stage.

Is this platform free to use?

Yes, PrepLinc is free for students and job seekers. Our mission is to democratize interview preparation by providing access to real, high-quality questions and experiences.

The Ultimate Interview Question Bank

Sourced directly from verified student experiences at top companies. Stop guessing and start practicing with the questions that are *actually* being asked.

Company

Topic

Forward and Back Propagation

Computer Networks

Tell about yourself

Behavioral

Can you optimize the time taken to train ANN?

Machine Learning

Explain any one of your projects.

Behavioral

Kth Largest number in an Array

Algorithms

Two Sum Problem

Algorithms

Find the maximum sum of a contiguous sub-array of size K with a twist: you can skip at most one element from the chosen sub-array to maximize the sum.

Sliding Window

What is the output of the following C++ code snippet involving virtual functions and polymorphism?

Object Oriented Programming (oop)

What is the time complexity of inserting an element into a Min-Heap?

Data Structures

O(1)

O(log n)

O(n)

O(n log n)

Given the root of a binary tree. Your task is to return the left view of the binary tree. The left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.

Binary Trees

Given a Linked list, the task is to print a singly linked list in a spiral fashion, starting from the mid and rotating clockwise. If the linked list has even nodes, then you have to choose the left mid.

Linked List

Sum of gp and product of gp - many question asked !

Aptitude

Synonyms and Antonyms

Aptitude

Time and work math problems

Aptitude

Find the largest element in binary heap tree .

Trees

Forward and Back Propagation

Computer Networks

Tell about yourself

Behavioral

Can you optimize the time taken to train ANN?

Machine Learning

Explain any one of your projects.

Behavioral

Kth Largest number in an Array

Algorithms

Two Sum Problem

Algorithms

Find the maximum sum of a contiguous sub-array of size K with a twist: you can skip at most one element from the chosen sub-array to maximize the sum.

Sliding Window

What is the output of the following C++ code snippet involving virtual functions and polymorphism?

Object Oriented Programming (oop)

What is the time complexity of inserting an element into a Min-Heap?

O(1)

O(log n)

O(n)

O(n log n)

Data Structures

Given the root of a binary tree. Your task is to return the left view of the binary tree. The left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.

Binary Trees

Linked List

Sum of gp and product of gp - many question asked !

Aptitude

Synonyms and Antonyms

Aptitude

Time and work math problems

Aptitude

Find the largest element in binary heap tree .

Trees

Forward and Back Propagation

Computer Networks

Tell about yourself

Behavioral

Can you optimize the time taken to train ANN?

Machine Learning

Explain any one of your projects.

Behavioral

Kth Largest number in an Array

Algorithms

Two Sum Problem

Algorithms

Find the maximum sum of a contiguous sub-array of size K with a twist: you can skip at most one element from the chosen sub-array to maximize the sum.

Sliding Window

What is the output of the following C++ code snippet involving virtual functions and polymorphism?

Object Oriented Programming (oop)

What is the time complexity of inserting an element into a Min-Heap?

Data Structures

O(1)

O(log n)

O(n)

O(n log n)

Given the root of a binary tree. Your task is to return the left view of the binary tree. The left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.

Binary Trees

Linked List

Sum of gp and product of gp - many question asked !

Aptitude

Synonyms and Antonyms

Aptitude

Time and work math problems

Aptitude

Find the largest element in binary heap tree .

Trees

Forward and Back Propagation

Computer Networks

Tell about yourself

Behavioral

Can you optimize the time taken to train ANN?

Machine Learning

Explain any one of your projects.

Behavioral

Kth Largest number in an Array

Algorithms

Two Sum Problem

Algorithms

Find the maximum sum of a contiguous sub-array of size K with a twist: you can skip at most one element from the chosen sub-array to maximize the sum.

Sliding Window

What is the output of the following C++ code snippet involving virtual functions and polymorphism?

Object Oriented Programming (oop)

What is the time complexity of inserting an element into a Min-Heap?

O(1)

O(log n)

O(n)

O(n log n)

Data Structures

Given the root of a binary tree. Your task is to return the left view of the binary tree. The left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.

Binary Trees

Linked List

Sum of gp and product of gp - many question asked !

Aptitude

Synonyms and Antonyms

Aptitude

Time and work math problems

Aptitude

Find the largest element in binary heap tree .

Trees