InterviewDigestTechnical Questions
494 real questions extracted from Technical rounds.
What is the difference between an abstract class and an interface in Java?
Java programming concepts, including the final keyword, static keyword, and the differences between abstract classes and interfaces.
Introduce yourself for about 5 minutes.
Introduction and discussion about the candidate's background and final year project.
What is the difference between delete and truncate operations?
Discussion on database management systems, including concepts like atomicity, consistency, and the differences between delete and truncate operations.
Explain the OSI layers.
Discussion on networking concepts, including the OSI model, URL working, and the differences between TCP and UDP protocols.
Explain atomicity and consistency in DBMS.
Discussion on database management systems, including concepts like atomicity, consistency, and the differences between delete and truncate operations.
Explain the static keyword in Java.
Java programming concepts, including the final keyword, static keyword, and the differences between abstract classes and interfaces.
Explain your final year project in detail.
Discussion about the candidate's final year project and summer internship experiences.
Explain the final keyword in Java.
Java programming concepts, including the final keyword, static keyword, and the differences between abstract classes and interfaces.
Balance a given string of parentheses.
Coding round focusing on string manipulation, parentheses balancing, and identifying duplicate parentheses in a string.
What are the differences between TCP and UDP?
Discussion on networking concepts, including the OSI model, URL working, and the differences between TCP and UDP protocols.
Find duplicate parentheses in a string.
Coding round focusing on string manipulation, parentheses balancing, and identifying duplicate parentheses in a string.
Solve string swap without using extra memory and without using the + or - operator. Explain the approach and provide the solution.
Coding round focusing on string manipulation, parentheses balancing, and identifying duplicate parentheses in a string.
Describe how a URL works.
Discussion on networking concepts, including the OSI model, URL working, and the differences between TCP and UDP protocols.
System architectural questions based on a frontend project prototype
The first round involved two interviewers. The candidate discussed their recent project, including the technology used, approach, and differences from existing projects. They also demonstrated a frontend project prototype and answered system architectural questions. The round concluded with an assignment to be completed within a week.
Handling large traffic scenarios
The second round involved three interviewers, including two from the previous round and a new interviewer likely focused on system architecture. The candidate demonstrated the assignment given in the first round and answered questions about implementation, technology used, and handling large traffic.
Implementation details of the assignment given in the first round
The second round involved three interviewers, including two from the previous round and a new interviewer likely focused on system architecture. The candidate demonstrated the assignment given in the first round and answered questions about implementation, technology used, and handling large traffic.
Discussion about a recent project: technology used, approach, and differences from existing projects
The first round involved two interviewers. The candidate discussed their recent project, including the technology used, approach, and differences from existing projects. They also demonstrated a frontend project prototype and answered system architectural questions. The round concluded with an assignment to be completed within a week.
Technology used in the assignment
The second round involved three interviewers, including two from the previous round and a new interviewer likely focused on system architecture. The candidate demonstrated the assignment given in the first round and answered questions about implementation, technology used, and handling large traffic.
Find the Missing Number
25-minute DSA round. Introduction (5 mins), followed by basic questions about projects mentioned in the resume. One coding question and one SQL query were asked.
Efficiently merging two sorted arrays with O(1) extra space
25-minute DSA round. Introduction (5 mins), followed by basic questions from JavaScript mentioned in the resume. One coding question and one SQL query were asked.
SQL query to find the 2nd highest salary and others
25-minute DSA round. Introduction (5 mins), followed by basic questions about projects mentioned in the resume. One coding question and one SQL query were asked.
SQL query
25-minute DSA round. Introduction (5 mins), followed by basic questions from JavaScript mentioned in the resume. One coding question and one SQL query were asked.
Explain how Docker works and where it was used in your resume
Face-to-face technical interview with the Senior Manager. Cross-questioning on Docker based on the candidate's introduction. Coding problems involving linked list operations, including adding nodes at runtime and at a specific position.
Difference between linked list and array, including advantages and disadvantages
50-60 minute face-to-face technical interview. Questions covered OOP concepts, function overloading and overriding, linked lists vs arrays, hashmaps, stacks vs queues, and coding problems. DBMS questions included SQL queries and differences between delete, drop, and truncate.
Finding the square of a given number
20-30 technical multiple-choice questions covering basic coding, data structures and algorithms, DBMS, sorting, and searching. Four coding questions: one easy, two medium, and one hard, primarily based on arrays and strings.
Explain how a hashmap works
50-60 minute face-to-face technical interview. Questions covered OOP concepts, function overloading and overriding, linked lists vs arrays, hashmaps, stacks vs queues, and coding problems. DBMS questions included SQL queries and differences between delete, drop, and truncate.
Modify the linked list code to add a node at a specific position
Face-to-face technical interview with the Senior Manager. Cross-questioning on Docker based on the candidate's introduction. Coding problems involving linked list operations, including adding nodes at runtime and at a specific position.
Array and string manipulation problems
20-30 technical multiple-choice questions covering basic coding, data structures and algorithms, DBMS, sorting, and searching. Four coding questions: one easy, two medium, and one hard, primarily based on arrays and strings.
Function overloading and function overriding
50-60 minute face-to-face technical interview. Questions covered OOP concepts, function overloading and overriding, linked lists vs arrays, hashmaps, stacks vs queues, and coding problems. DBMS questions included SQL queries and differences between delete, drop, and truncate.
Stack vs queue
50-60 minute face-to-face technical interview. Questions covered OOP concepts, function overloading and overriding, linked lists vs arrays, hashmaps, stacks vs queues, and coding problems. DBMS questions included SQL queries and differences between delete, drop, and truncate.
Find the third largest salary from the Employee table
50-60 minute face-to-face technical interview. Questions covered OOP concepts, function overloading and overriding, linked lists vs arrays, hashmaps, stacks vs queues, and coding problems. DBMS questions included SQL queries and differences between delete, drop, and truncate.
Write code to create a linked list with user input at runtime and display all values
Face-to-face technical interview with the Senior Manager. Cross-questioning on Docker based on the candidate's introduction. Coding problems involving linked list operations, including adding nodes at runtime and at a specific position.
Explain OOP concepts with examples
50-60 minute face-to-face technical interview. Questions covered OOP concepts, function overloading and overriding, linked lists vs arrays, hashmaps, stacks vs queues, and coding problems. DBMS questions included SQL queries and differences between delete, drop, and truncate.
Explain different types of SQL joins
50-60 minute face-to-face technical interview. Questions covered OOP concepts, function overloading and overriding, linked lists vs arrays, hashmaps, stacks vs queues, and coding problems. DBMS questions included SQL queries and differences between delete, drop, and truncate.
Difference between delete, drop, and truncate
50-60 minute face-to-face technical interview. Questions covered OOP concepts, function overloading and overriding, linked lists vs arrays, hashmaps, stacks vs queues, and coding problems. DBMS questions included SQL queries and differences between delete, drop, and truncate.
Find the third largest element in an array
50-60 minute face-to-face technical interview. Questions covered OOP concepts, function overloading and overriding, linked lists vs arrays, hashmaps, stacks vs queues, and coding problems. DBMS questions included SQL queries and differences between delete, drop, and truncate.
Find the frequency of each character in a string
50-60 minute face-to-face technical interview. Questions covered OOP concepts, function overloading and overriding, linked lists vs arrays, hashmaps, stacks vs queues, and coding problems. DBMS questions included SQL queries and differences between delete, drop, and truncate.
Given a 100rs note, return change using specific denominations (1x50rs, 2x20rs, 3x2rs, 4x1rs). Explain the logic behind the solution.
Technical interview round where the candidate was asked about projects mentioned in the resume and two DSA questions.
Reverse all elements from index 1 to N-1 in an array (e.g., transform [1, 2, 3, 4, 5] to [1, 5, 4, 3, 2]).
Technical interview round where the candidate was asked about projects mentioned in the resume and two DSA questions.
Explain OOPs concepts and discuss a project.
A technical interview with one interviewer. Questions included OOPs concepts, a discussion on the candidate's project, and two pseudo-code problems: printing a pyramid number pattern and checking if a string is a palindrome (or reversing it if not a string).
Write pseudo code to check if a string is a palindrome or reverse the string if it is not a palindrome.
A technical interview with one interviewer. Questions included OOPs concepts, a discussion on the candidate's project, and two pseudo-code problems: printing a pyramid number pattern and checking if a string is a palindrome (or reversing it if not a string).
Write pseudo code to print a pyramid number pattern.
A technical interview with one interviewer. Questions included OOPs concepts, a discussion on the candidate's project, and two pseudo-code problems: printing a pyramid number pattern and checking if a string is a palindrome (or reversing it if not a string).
Set Matrix Zeroes (with constant space constraint)
Held on BluePages platform for 1 hour and 45 minutes. Focused on optimal solutions and in-depth discussion on a project. Two DSA questions were asked.
Approach to merge two sorted linked lists
Held on BluePages platform for 1 hour. Focused on DSA with questions designed to assess thought process and coding skills.
Widest Vertical Area Between Two Points Containing No Points
Held on BluePages platform for 1 hour. Focused on DSA with questions designed to assess thought process and coding skills.
Valid Mountain Array
Held on BluePages platform for 1 hour. Focused on DSA with questions designed to assess thought process and coding skills.
Determine if two binary trees are the same or not (optimized for space)
Held on BluePages platform for 1 hour and 45 minutes. Focused on optimal solutions and in-depth discussion on a project. Two DSA questions were asked.
Simple implementation-based coding question with output verification
Focused on object-oriented design. Two design-based questions discussed for 30-35 minutes, followed by a simple implementation-based coding question with output verification. Topics included Binary Search, Dynamic Programming, and Implementation.
Staircase problem and another coding question (details not recalled)
Two coding questions (one was a staircase problem) and one puzzle. Both coding questions were solved successfully. The puzzle was discussed for around 15 minutes.
Two design-based questions (details not specified)
Focused on object-oriented design. Two design-based questions discussed for 30-35 minutes, followed by a simple implementation-based coding question with output verification. Topics included Binary Search, Dynamic Programming, and Implementation.
Diagonal view of a binary tree
Face-to-face interview (1 hour 30 mins) where the interviewer reviewed the candidate's resume and asked two technical questions.
Height of a binary tree
Face-to-face interview (1 hour 30 mins) where the interviewer asked three technical questions and discussed OOPs concepts.
Longest Increasing Subsequence
Face-to-face interview (1 hour 30 mins) where the interviewer reviewed the candidate's resume and asked two technical questions.
Zig-zag traversal of a binary tree
Face-to-face interview (1 hour 30 mins) where the interviewer asked three technical questions and discussed OOPs concepts.
OOPs-related questions and implementation
Face-to-face interview (1 hour 30 mins) where the interviewer asked three technical questions and discussed OOPs concepts.
Trapping Rain Water (with discussion on O(n) space and O(1) space approaches)
Face-to-face interview (1 hour 30 mins) where the interviewer asked three technical questions and discussed OOPs concepts.
Given a 2-D grid of characters and a string, determine if the string can be found by traversing adjacent cells (sharing common edges) in the grid. Solve using backtracking.
45-minute interview conducted via Zoom. Two coding questions: evaluating a postfix expression using a stack and solving a word search problem using backtracking.
Given a list of numbers in the form of a string array, find the largest possible number that can be created by appending these numbers one after another. Approach involves lexicographical sorting of the array in decreasing order and appending the strings.
45-minute interview conducted via Zoom. One coding question: largest number formed by appending strings from a given list, solved using lexicographical sorting.
Evaluate a given postfix expression using a stack data structure.
45-minute interview conducted via Zoom. Two coding questions: evaluating a postfix expression using a stack and solving a word search problem using backtracking.
Basic Staircase problem (LeetCode equivalent)
45-minute interview focused on solving two coding problems after a brief introduction.
Easy string manipulation problem (LeetCode easy level)
45-minute interview focused on solving two coding problems after a brief introduction.
Identify errors in code
Technical round: Resume discussion, OOP concepts, error identification in code, OS questions, and coding implementation of OOP concepts
Explain IoT
Technical round: Resume discussion, OOP concepts, error identification in code, OS questions, and coding implementation of OOP concepts
Search for an element in a Rotated sorted array
Coding round: Search for an element in a Rotated sorted array, general OS questions
Write a code that implements all four OOP concepts
Technical round: Resume discussion, OOP concepts, error identification in code, OS questions, and coding implementation of OOP concepts
Explain OOP concepts
Technical round: Resume discussion, OOP concepts, error identification in code, OS questions, and coding implementation of OOP concepts
Explain technologies used in a project (Node.js, Express.js, Bootstrap, Tailwind CSS, MongoDB Atlas).
Detailed discussion about projects, including technologies used (Node.js, Express.js, Bootstrap, Tailwind CSS, MongoDB Atlas). SQL query and coding problem on word counting in a sentence with special symbols.
Connect backend code to a database using ODM Mongoose.
Detailed discussion about projects, including technologies used (Node.js, Express.js, Bootstrap, Tailwind CSS, MongoDB Atlas). SQL query and coding problem on word counting in a sentence with special symbols.
Explain C++ OOP concepts like polymorphism and encapsulation.
Discussion about projects, followed by coding and technical questions. Topics included data structures, algorithms, C++ OOP concepts, and JavaScript basics.
Difference between 'var' and 'let' in JavaScript.
Discussion about projects, followed by coding and technical questions. Topics included data structures, algorithms, C++ OOP concepts, and JavaScript basics.
Find the K’th largest element in an unsorted array with approaches like sorting, bubble sort, and optimization using a min-heap.
Discussion about projects, followed by coding and technical questions. Topics included data structures, algorithms, C++ OOP concepts, and JavaScript basics.
Count the number of vowels in a given sentence.
Discussion about projects, followed by coding and technical questions. Topics included data structures, algorithms, C++ OOP concepts, and JavaScript basics.
Write an SQL query to find the employee with the maximum salary for each department given two tables (employee and department).
Detailed discussion about projects, including technologies used (Node.js, Express.js, Bootstrap, Tailwind CSS, MongoDB Atlas). SQL query and coding problem on word counting in a sentence with special symbols.
Count the number of words in a sentence containing special symbols like ',', '-', or numbers.
Detailed discussion about projects, including technologies used (Node.js, Express.js, Bootstrap, Tailwind CSS, MongoDB Atlas). SQL query and coding problem on word counting in a sentence with special symbols.
structure member alignment & padding in C
Technical Interview
threading, computer architecture & operating systems question
Technical Interview
Rotate a given matrix by 90 degrees in a clockwise direction.
Two coding problems were discussed.
Implement a constant time O(1) Least Recently Used (LRU) caching mechanism.
Discussion about work-related areas followed by a coding problem.
Implement the iterator operator for a vector in C++.
Discussion about work-related areas followed by a coding problem.
Find the index of the first occurrence of 1 in an infinite sorted array consisting of 0s and 1s.
Two coding problems were discussed.
Implement a method to copy data from one memory space to another using C++
Round 2 was an interview on MS Teams, focusing on graphics development and problem-solving questions.
Implement a method to copy data from one memory space to another
Round 2 was a 2-hour interview on MS Teams, focusing on graphics development and problem-solving questions, including implementing programs in C++ and discussing Vulkan raytracing extensions
Questions on raytracing and acceleration structures
Round 4 was a 1-hour interview, focusing on Vulkan development, raytracing, and acceleration structures, with a discussion on the candidate's post-graduation plans and feedback
DSA questions and functions commonly used in computer graphics
Round 2 was a 2-hour interview on MS Teams, focusing on graphics development and problem-solving questions, including implementing programs in C++ and discussing Vulkan raytracing extensions
Questions on vectors
Round 3 was a 1-hour interview, focusing on problem-solving approach and DSA questions, with an emphasis on communication and approach over optimal solutions
Questions on Vulkan development
Round 4 was a 1-hour interview, focusing on Vulkan development, raytracing, and acceleration structures, with a discussion on the candidate's post-graduation plans and feedback
System design for scalable graphics systems
System design for scalable graphics systems
Explain ring oscillators, setup and hold time, Static Timing Analysis (STA), binary search algorithm with pseudocode and complexity, op-amp circuits (summing, negative feedback, terminal interchange), clock distribution issues (skew, uncertainty, jitter), 2-FF synchronizers, cache memory concepts (lines, dirty bits, SRAM vs DRAM, volatility), Verilog implementation of AND gate using MUX, stack properties, and two logic puzzles involving gate flipping and shortest path on a cube.
The second technical round was a comprehensive assessment covering digital design, computer architecture, circuit theory, and logical aptitude.
Introduce yourself, discuss projects, explain interest in Qualcomm and 5-year career plan, and solve array-based C programming problems including merge sort implementation, finding the second largest element, and analyzing time complexity.
The first technical round focused on project discussions, career goals, and basic C programming proficiency.
Bit manipulation: Setting the nth bit of a number
Technical Interview 2
Evolution of mobile communications from 1G to 5G
Technical Interview 1
Detecting a loop in a linked list
Technical Interview 2
In-depth discussion on 5G technology
Technical Interview 1
Count subsequence of length three in a given string
Online Round with MCQs and coding questions
Write code to heapify
Technical Round with system design and coding questions
Find count of substrings with all 5 vowels
Online Round with MCQs and coding questions
Maximum profit by buying and selling a share at most twice
Technical Round with DP question
How heap is allocated for a program
Technical Round with system design and coding questions
Find minimum flips to convert string to all 0's
Online Round with MCQs and coding questions
Design elevator system
Technical Round with system design and coding questions
Delete directory in file system that occupies more space and is far from root
Technical Round with project discussion and file system question
Next successor of inorder traversal in O(log n) space and O(1) time
Technical Round with questions on project and data structures
Make a given bracket a regular bracket sequence
Technical Round with questions on project and SQL queries
Count pairs with difference equal to k
Coding Round with 9 MCQs and 3 Coding Problems
Zigzag tree traversal
Technical Round with questions on project and SQL queries
Traveling is Fun
Coding Round with 9 MCQs and 3 Coding Problems
Minimize the sum of the array after k operations
Coding Round with 9 MCQs and 3 Coding Problems
Create a data structure with O(1) time for insert, delete, contains, and get random
Technical Round with questions on project and data structures
Final Keyword
Interview Round 2 with questions on DSA and OOPs
normalization
Interview Round 1 with questions on DSA, OS, and DBMS
deadlocks
Interview Round 1 with questions on DSA, OS, and DBMS
BCNF
Interview Round 1 with questions on DSA, OS, and DBMS
ACID properties
Interview Round 1 with questions on DSA, OS, and DBMS
finding median of multiple points
Online round with coding questions and MCQs
Heapify and coding it
Interview Round 1 with questions on DSA, OS, and DBMS
finding Anagrams in a string using prime numbers
Interview Round 2 with questions on DSA and OOPs
virtual memory
Interview Round 1 with questions on DSA, OS, and DBMS
HASHING
Interview Round 2 with questions on DSA and OOPs
converting binary tree to linked list
Interview Round 1 with questions on DSA, OS, and DBMS
finding duplicates using sets in cpp
Online round with coding questions and MCQs
dp with strings
Online round with coding questions and MCQs
valid parenthesis length with and without using stack
Interview Round 1 with questions on DSA, OS, and DBMS
difference between Process and Thread
Interview Round 1 with questions on DSA, OS, and DBMS
polymorphism
Interview Round 2 with questions on DSA and OOPs
Static Keyword
Interview Round 2 with questions on DSA and OOPs
What is array in java
SQL queries based on scenarios
Three persons interviewed the candidate
Why you are interested in this role
The interview process involved questions about interest in the role
logical questions
The interview process included technical questions.
python
The interview process included technical questions.
sql based queries
The interview process included technical questions.
managerial questions
The interview process included technical questions.
Design and implement a calendar manager class with unit tests
Candidate was asked to design and implement a calendar manager class along with unit tests.
Given three strings, write code to check if the third string is a shuffle of the first two strings. The third string is a shuffle if it can be formed by interleaving the characters of the first and second strings while maintaining the left-to-right ordering of characters from each string.
Coding round focused on string manipulation and dynamic programming.
three coding questions
Coding Round OA with three coding questions
Leetcode hard: Number of Atoms
DSA question - Leetcode hard: Number of Atoms
Implementation of a thread-safe LRU cache
Implementation of a thread-safe LRU cache
Implement the pool from scratch
Concurrency round with implementation of pool from scratch
Number of atoms
Online Coding Round with 3 questions
A robot is at origin and has to move to (6, 6) in a 2D plane. It can only move right or up. In how many ways can it reach its destination without the first and last step being the same
The interview involved solving a problem where a robot moves in a 2D plane
Expected maximum when n m-sided dice are rolled
The interview involved a game based on the expected maximum when n m-sided dice are rolled.
Calculate the expected number of coin tosses required to get n heads in a row.
A single technical round focused on probability and expected value calculations.
Based on the previous work
Questions were based on previous work
ability to handle pressure
The interview assessed the candidate's ability to handle pressure
Previous experience, comfort with certain responsibilities, describe difficult situations
The interview involved questions about previous experience and comfort with certain responsibilities.
Example of projects in a similar scope and stakeholder level
The interview asked for an example of projects in a similar scope and stakeholder level
What is primary key and secondary key
Introduction and technical questions
Technical knowledge, different fields question
Technical questions were asked
UI design and foundations
The questions were about general UI design and foundations
Given an integer array representing money in houses arranged in a circle where adjacent houses cannot be robbed, determine the maximum amount of money that can be stolen.
The candidate was asked to solve a dynamic programming problem involving circular constraints.
Difference between global and local declarations
Face-to-face interview with basic programming questions and concepts. Topics included pointers, memory allocation, swapping elements with and without pointers, global and local declarations, and puzzles.
Explanation of swapping elements with and without pointers
Face-to-face interview with basic programming questions and concepts. Topics included pointers, memory allocation, swapping elements with and without pointers, global and local declarations, and puzzles.
Basics of pointers, their usage, and memory allocation
Face-to-face interview with basic programming questions and concepts. Topics included pointers, memory allocation, swapping elements with and without pointers, global and local declarations, and puzzles.
Types of memory allocations
Face-to-face interview with basic programming questions and concepts. Topics included pointers, memory allocation, swapping elements with and without pointers, global and local declarations, and puzzles.
Find the longest palindromic substring in a given string.
The round focused on technical knowledge, primarily based on projects listed in the resume. The interviewer reviewed live projects or GitHub repositories. Questions included basic topics from computer networks, a coding problem to find the longest palindromic substring in a given string, and a discussion about what happens when a link is clicked in a browser, including the process chain and DNS lookup.
Explain what happens when you hit a link in your browser, including the process chain and DNS lookup.
The round focused on technical knowledge, primarily based on projects listed in the resume. The interviewer reviewed live projects or GitHub repositories. Questions included basic topics from computer networks, a coding problem to find the longest palindromic substring in a given string, and a discussion about what happens when a link is clicked in a browser, including the process chain and DNS lookup.
Database and SQL optimization questions
25-minute technical round focused on resume projects, system design scenarios, SQL optimization, and database concepts.
Explain projects mentioned in the resume in detail and design systems for given scenarios
25-minute technical round focused on resume projects, system design scenarios, SQL optimization, and database concepts.
Standard DSA problem (e.g., knapsack or dynamic programming problem)
Interviewer asked two questions: one DSA problem (standard knapsack/DP problem) and another on time complexity. Discussion focused on a CV project involving a simulation using ASCII characters in a C++ terminal, including implementation details and mathematical concepts involved. Candidate discussed their favorite DSA algorithm (Dijkstra's algorithm) and explained its greedy approach and efficiency using a priority queue.
Explanation of Dijkstra's algorithm, its greedy approach, and efficiency using a priority queue
Interviewer asked two questions: one DSA problem (standard knapsack/DP problem) and another on time complexity. Discussion focused on a CV project involving a simulation using ASCII characters in a C++ terminal, including implementation details and mathematical concepts involved. Candidate discussed their favorite DSA algorithm (Dijkstra's algorithm) and explained its greedy approach and efficiency using a priority queue.
Question on time complexity analysis
Interviewer asked two questions: one DSA problem (standard knapsack/DP problem) and another on time complexity. Discussion focused on a CV project involving a simulation using ASCII characters in a C++ terminal, including implementation details and mathematical concepts involved. Candidate discussed their favorite DSA algorithm (Dijkstra's algorithm) and explained its greedy approach and efficiency using a priority queue.
Implementation details and mathematical concepts behind a simulation project using ASCII characters in a C++ terminal
Interviewer asked two questions: one DSA problem (standard knapsack/DP problem) and another on time complexity. Discussion focused on a CV project involving a simulation using ASCII characters in a C++ terminal, including implementation details and mathematical concepts involved. Candidate discussed their favorite DSA algorithm (Dijkstra's algorithm) and explained its greedy approach and efficiency using a priority queue.
Types of delegates in C#
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain ActionResult in .NET Core
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain filters and their types in .NET Core
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain serialization and deserialization in C#
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain OOPs concepts with examples for each
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Difference between managed and unmanaged code in .NET
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain joins and their types in SQL
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain AutoMapper in .NET Core
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain stored procedures in SQL
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Difference between read-only and constant in C#
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain LINQ aggregate functions
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Difference between Select and SelectMany in LINQ
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain the 'run' and 'use' methods in .NET Core middleware
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Purpose of appsettings and launchSettings files in .NET Core
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain Web API in .NET Core
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain garbage collection and its types in .NET
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain status codes and their types in .NET Core
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
How to handle exceptions in C#
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain UNION and UNION ALL in SQL
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain sealed classes and delegates in C#
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain assembly, namespace, and CLR in .NET
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Difference between overloading and overriding in OOPs
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain static class and static constructor in C#
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Critical features of .NET Core
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain transient, singleton, and scoped lifetimes in .NET Core
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain middleware in .NET Core
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain abstraction, encapsulation, and interfaces in OOPs
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Explain Entity Framework in .NET Core
The round focused on assessing the candidate's knowledge of OOPs concepts, C#, .NET Core, SQL, and related topics. The interviewer asked conceptual questions and expected detailed explanations with examples.
Design a customer relation tool and explain the process for gathering requirements.
Candidate was asked to design a customer relation tool and explain how they would gather requirements.
Alignment with Barclays values (RISES) professionally
30-minute interview focusing on Java, OOP concepts, SQL, and HR-based questions.
SQL-related questions about tables and their relations in the candidate's project
30-minute interview focusing on Java, OOP concepts, SQL, and HR-based questions.
Handling team members not meeting deadlines as a project lead
30-minute interview focusing on Java, OOP concepts, SQL, and HR-based questions.
Difference between the 'unique' keyword and the 'distinct' keyword in Java
30-minute interview focusing on Java, OOP concepts, SQL, and HR-based questions.
Preparedness for observing a server as a daily job and suggestions for additional tasks in such a role
Third round was an interview consisting of questions based on the candidate's internship, tech stack used in the internship, OOP basics, and scenario-based questions. The interview also included questions about future ambitions, daily time management, and job role preparedness.
Future ambitions and daily time management
Third round was an interview consisting of questions based on the candidate's internship, tech stack used in the internship, OOP basics, and scenario-based questions. The interview also included questions about future ambitions, daily time management, and job role preparedness.
OOP basic question
Third round was an interview consisting of questions based on the candidate's internship, tech stack used in the internship, OOP basics, and scenario-based questions. The interview also included questions about future ambitions, daily time management, and job role preparedness.
Write an API using Node.js
Third round was an interview consisting of questions based on the candidate's internship, tech stack used in the internship, OOP basics, and scenario-based questions. The interview also included questions about future ambitions, daily time management, and job role preparedness.
coding questions
First Interview Round: Technical Interview
OOP questions
First Interview Round: Technical Interview
SQL query involving joining three tables and a subquery
First Interview Round: Technical Interview
Java and C++ output-based questions
Online Assessment
medium difficulty coding question
Online Assessment
GitHub contributions
First Interview Round: Technical Interview
project development process
First Interview Round: Technical Interview
Explain the differences between HTTP and HTTPS, HTML parsing, and the JavaScript script execution process.
Questions focused on web fundamentals, JavaScript, React.js, and performance optimization.
Why are promises not used in a specific situation? Discuss their disadvantages and replacements.
Questions focused on web fundamentals, JavaScript, React.js, and performance optimization.
What is the difference between async and defer scripts? Provide an example of async/await implementation in code.
Questions focused on web fundamentals, JavaScript, React.js, and performance optimization.
Compare different React.js hooks and explain why React.js was chosen over other technologies. Describe its performance benefits and the concept of the Virtual DOM in React.
Questions focused on web fundamentals, JavaScript, React.js, and performance optimization.
How to handle multiple promises simultaneously in React?
Questions focused on web fundamentals, JavaScript, React.js, and performance optimization.
Draw the recursion tree for the function Fun(n) defined as: if (n < 0) return; Fun(--n); print n; Fun(--n);
Problem involving recursion tree analysis for a given recursive function.
Find the second largest element in an array, including edge case discussions.
Discussion around Data Structures and Algorithms (DSA) with a focus on medium/easy level problems.
Explain virtual functions in C++ and their applicability in programming.
Questions related to C++ concepts, specifically virtual functions and their applicability.
A medium-level question based on Binary-Search on answer
Coding round with 3 questions on topics including quadratic equations, priority queue, and binary search
Difference between horizontal and vertical scaling
Technical round focusing on OOPS skills, system design, and operating systems
An easy-medium question that was based on the priority queue of queues
Coding round with 3 questions on topics including quadratic equations, priority queue, and binary search
Stages of SDLC
Technical round focusing on theory concepts and puzzles
A cakewalk brute force question solved using simple quadratic equations formula
Coding round with 3 questions on topics including quadratic equations, priority queue, and binary search
Define and implement OOPS concepts like inheritance, virtual functions, friend functions, and static keywords
Technical round focusing on OOPS skills, system design, and operating systems
How will you synchronize ticket booking across multiple locations in the IRCTC app?
Technical round focusing on OOPS skills, system design, and operating systems
Diff b/w Process and Threads, Semaphores
Technical round focusing on OOPS skills, system design, and operating systems
Semaphores
Technical round focusing on theory concepts and puzzles
How can you make 3 equilateral triangles using 6 matchsticks without breaking them?
Technical round focusing on theory concepts and puzzles
What is testing and what types of testing?
Technical round focusing on theory concepts and puzzles
partition a set into two subsets with minimum difference of subset sums and additional constraints
Coding round with two medium-to-hard-level questions
Leetcode medium-level question
Online Assessment with coding questions
Leetcode hard-level question
Online Assessment with coding questions
How does inheritance work in OOP, and can you provide an example?
The interview consisted of a single round, which included both coding and HR questions. The round lasted over an hour and required the candidate to be prepared for a range of questions and topics.
What is polymorphism, and how is it implemented?
The interview consisted of a single round, which included both coding and HR questions. The round lasted over an hour and required the candidate to be prepared for a range of questions and topics.
What is an abstract class, and how is it different from an interface?
The interview consisted of a single round, which included both coding and HR questions. The round lasted over an hour and required the candidate to be prepared for a range of questions and topics.
How do you handle transactions in a database?
The interview consisted of a single round, which included both coding and HR questions. The round lasted over an hour and required the candidate to be prepared for a range of questions and topics.
A simple swapping number question.
The interview consisted of a single round, which included both coding and HR questions. The round lasted over an hour and required the candidate to be prepared for a range of questions and topics.
What are some key features of Oracle databases, and how do they differ from other databases?
The interview consisted of a single round, which included both coding and HR questions. The round lasted over an hour and required the candidate to be prepared for a range of questions and topics.
Difference between C and C++
The interview consisted of a single round, which included both coding and HR questions. The round lasted over an hour and required the candidate to be prepared for a range of questions and topics.
Java and core programming
Online assessment with coding problems and MCQs
Data structures and algorithms
Online assessment with coding problems and MCQs
Object-oriented programming
Online assessment with coding problems and MCQs
Problem-solving questions
Interview Round 1 (Technical)
Explain types of machine learning algorithms
Interview Round 1 (Technical)
What is Docker and its need?
Interview Round 2 (Technical)
Describe how LSTM works and its advantages over conventional RNNs
Interview Round 1 (Technical)
How to achieve Asynchronicity in JS
Personal Interview Round 2
Differentiate among AI, ML, DL
Personal Interview Round 2
Javascript Execution sequence
Personal Interview Round 1
What is the effect of LLM parameters on its responses and accuracy
Personal Interview Round 2
Given record of employee and mgr in map, print employees in a hierarchical manner
Personal Interview Round 2
Difference between interface and abstract class
Personal Interview Round 1
Why do we need an isolated environment
Personal Interview Round 2
What are Status Codes of HTTP
Personal Interview Round 2
Given an n × m grid, find the number of cells such that all other elements in the same row and the same column are identical, except for the cell itself
Online Assessment
Find all the indices in an array where the element is greater than both its immediate neighbours
Online Assessment
Given an array of distinct elements, repeatedly find the smallest peak, remove it, and continue this process until the array becomes empty
Online Assessment
Given Arrays A and B and queries of 2 types
Online Assessment
SQL query to identify all reliable customers who spent more than $1000 in the past month
Personal Interview Round 2
SQL query to find all duplicate entries in a table
Personal Interview Round 1
Explain the differences between threads and processes and describe the thread creation process.
A combined technical and HR interview covering core computer science fundamentals, data structures, and behavioral questions.
Explain Merge Sort in detail, including time complexity and how to solve the problem using Dynamic Programming.
A combined technical and HR interview covering core computer science fundamentals, data structures, and behavioral questions.
Discuss the most complex code written and answer questions regarding company culture and projects.
A combined technical and HR interview covering core computer science fundamentals, data structures, and behavioral questions.
Discuss C++ vs Java, including concepts of overriding, overloading, static vs dynamic binding, and virtual functions.
A combined technical and HR interview covering core computer science fundamentals, data structures, and behavioral questions.
Solve a greedy problem involving bricks with weights and costs to reach a target weight at minimum cost, explain the greedy strategy, and discuss the sorting approach used.
A combined technical and HR interview covering core computer science fundamentals, data structures, and behavioral questions.
Explain the differences between arrays and linked lists, the internal memory access mechanism for arrays, and provide a SQL query demonstrating the GROUP BY clause.
A combined technical and HR interview covering core computer science fundamentals, data structures, and behavioral questions.
Easy-Medium question 2
Online coding round with 4 questions of varying difficulty
OOP concepts with code snippets
Technical interview focusing on DSA, Java, Spring Boot, and previous project experience
Hard question 4
Online coding round with 4 questions of varying difficulty
Graph problems (BFS focused)
Technical interview focusing on DSA, Java, Spring Boot, and previous project experience
Design Patterns (especially Singleton)
Technical interview focusing on DSA, Java, Spring Boot, and previous project experience
Medium question 3
Online coding round with 4 questions of varying difficulty
Easy question 1
Online coding round with 4 questions of varying difficulty
Java and Spring Boot fundamentals
Technical interview focusing on DSA, Java, Spring Boot, and previous project experience
Given an array of strings and an array of characters, for each string, count how many characters from the given character array appear in it. If the count is even, keep the string unchanged; if odd, reverse the string. Return a new array of strings with the processed results.
Coding problem involving string manipulation and character matching.
Update the my_malloc and my_free functions to manage a memory pool expanded to 64 rows (each row remains 64 bits wide) using 32-bit registers.
Candidates were asked to implement memory management functions for a hardware register-based memory pool. The problem involved writing my_malloc and my_free functions for a 32-row memory pool and then extending the solution to a 64-row pool using 32-bit registers.
Implement my_malloc and my_free functions to manage a 32-bit hardware register-based memory pool with 32 rows of 64 bits each. The functions should handle allocation and deallocation of memory within this pool.
Candidates were asked to implement memory management functions for a hardware register-based memory pool. The problem involved writing my_malloc and my_free functions for a 32-row memory pool and then extending the solution to a 64-row pool using 32-bit registers.
Check if a linked list is a palindrome with O(1) space complexity.
A single technical round focused on data structures and algorithms.
Analyze a 250-line C program to identify errors in logic, function calls, stack implementation, and typecasting. Fix the errors and discuss solutions to avoid stack overflow/underflow without explicit checks. Explain memory allocation, linked lists vs arrays, and memory management concepts like paging.
Live coding round where the candidate analyzed a 250-line C program to identify errors. The program involved converting a Binary Tree into a Doubly Linked List in spiral fashion. Errors included incorrect function calls, lack of stack overflow/underflow checks, and typecasting issues. The candidate was then asked to fix the code and discuss memory allocation, linked lists vs arrays, and memory management concepts like paging.
Explain different IPC mechanisms and their differences, including the pros and cons of d-bus.
1-hour interview with a mid-senior level engineer focused on understanding the candidate's work experience and problem-solving approach. Questions covered programming, embedded systems concepts, and project-specific details.
Describe how Boost.Asio works and its usage in projects.
1-hour interview with a mid-senior level engineer focused on understanding the candidate's work experience and problem-solving approach. Questions covered programming, embedded systems concepts, and project-specific details.
Reverse a singly linked list with optimizations.
1-hour interview with a mid-senior level engineer focused on understanding the candidate's work experience and problem-solving approach. Questions covered programming, embedded systems concepts, and project-specific details.
Determine whether the stack grows downwards or upwards in memory and how the heap grows in relation to it.
1-hour interview with a mid-senior level engineer focused on understanding the candidate's work experience and problem-solving approach. Questions covered programming, embedded systems concepts, and project-specific details.
Explain constructors, destructors, the difference between delete and free, and how a new object is created in C++.
1-hour interview with a technical manager focusing on architecture, debugging, and project-specific concepts.
Count the number of bits set in a number and demonstrate two methods with their pros and cons.
1-hour interview with a technical manager focusing on architecture, debugging, and project-specific concepts.
Describe what GDB is and its usage in debugging.
1-hour interview with a technical manager focusing on architecture, debugging, and project-specific concepts.
Discuss more questions on d-bus and its significance in the project.
1-hour interview with a technical manager focusing on architecture, debugging, and project-specific concepts.
Discuss project-specific questions and concepts used in previous projects.
1-hour interview with a senior-level engineer focusing on embedded systems, endianness, and programming challenges.
Implement a custom memcpy function, including handling memory overlapping.
1-hour interview with a senior-level engineer focusing on embedded systems, endianness, and programming challenges.
Explain how a vector works internally and when to use it.
1-hour interview with a mid-senior level engineer focused on understanding the candidate's work experience and problem-solving approach. Questions covered programming, embedded systems concepts, and project-specific details.
Discuss project-specific questions based on the resume.
1-hour interview with a mid-senior level engineer focused on understanding the candidate's work experience and problem-solving approach. Questions covered programming, embedded systems concepts, and project-specific details.
Find the missing number in an array and optimize the solution.
1-hour interview with a mid-senior level engineer focused on understanding the candidate's work experience and problem-solving approach. Questions covered programming, embedded systems concepts, and project-specific details.
Determine if an architecture is Little-Endian or Big-Endian.
1-hour interview with a senior-level engineer focusing on embedded systems, endianness, and programming challenges.
Explain how d-bus facilitates IPC and the different ways it communicates between processes, including follow-up questions.
1-hour interview with a senior-level engineer focusing on embedded systems, endianness, and programming challenges.
Convert a hexadecimal string to a decimal number.
1-hour interview with a senior-level engineer focusing on embedded systems, endianness, and programming challenges.
Explain the difference between RISC and CISC architectures and compare ARM and x86.
1-hour interview with a technical manager focusing on architecture, debugging, and project-specific concepts.
Define cross-compilation and its usage in projects.
1-hour interview with a technical manager focusing on architecture, debugging, and project-specific concepts.
Solve a LeetCode hard-level dynamic programming problem involving partitioning an array into two arrays to minimize the sum difference. Start with brute-force, discuss time and space complexity, and optimize to the final solution.
Offline technical interview with two questions. The interviewer was supportive and the discussion focused on problem-solving approach, edge cases, and optimization.
Solve a LeetCode hard-level problem involving Trie (similar to 'Delete Duplicate Folders in System'). Discuss edge cases, approach, and implement the solution while debugging errors during dry runs.
Offline technical interview with two questions. The interviewer was supportive and the discussion focused on problem-solving approach, edge cases, and optimization.
Provide solutions to nine distinct cloud-based scenario problems.
A 1-hour technical interview with 10 questions: one medium-level DSA graph question and nine cloud-based scenario questions requiring solution proposals.
Solve a medium-level DSA graph problem.
A 1-hour technical interview with 10 questions: one medium-level DSA graph question and nine cloud-based scenario questions requiring solution proposals.
Given parent nodes and their child nodes, find the root node and construct the tree by linking all nodes.
A 1-hour technical interview focusing on two DSA questions: one involving linked lists (adding two numbers) and another tree-based problem (finding the root node and constructing the tree from given parent-child relationships).
Solve a linked list problem involving adding two numbers represented as linked lists.
A 1-hour technical interview focusing on two DSA questions: one involving linked lists (adding two numbers) and another tree-based problem (finding the root node and constructing the tree from given parent-child relationships).
Design APIs and microservices architecture for a system handling multiple queries
A system design round focused on designing APIs and microservices to handle multiple queries efficiently.
Measure and optimize delivery partner efficiency during peak order hours using data
Discussion-based round focusing on data-driven problem-solving and optimization strategies.
Diagnose the reasons behind increased order delivery times in a specific city using a metric debugging case.
A metric debugging case was presented where the candidate was asked to diagnose why order delivery times had increased in a specific city.
What does Javascript do in Nodejs?
The interviewer discussed the candidate's experience and asked questions about Nodejs, asynchronous coding, and database concepts.
What is Single Threaded Programming?
The interviewer discussed the candidate's experience and asked questions about Nodejs, asynchronous coding, and database concepts.
What is asynchronous coding in Nodejs?
The interviewer discussed the candidate's experience and asked questions about Nodejs, asynchronous coding, and database concepts.
Design a database schema for Quora
The interviewer asked the candidate to design a database schema for a project like Quora and write queries based on it.
What does an API call do in your firm?
The interviewer discussed the candidate's experience and asked questions about Nodejs, asynchronous coding, and database concepts.
What do SQL and NOSQL databases mean?
The interviewer discussed the candidate's experience and asked questions about Nodejs, asynchronous coding, and database concepts.
Write queries for Quora database schema
The interviewer asked the candidate to design a database schema for a project like Quora and write queries based on it.
Design a class-based approach for a browser tab scenario
The interviewer asked the candidate to design a class-based approach for a browser tab scenario.
Write a function to schedule a meeting of a certain duration with a co-worker
The interviewer asked the candidate to solve a DSA problem and write code for it.
Search in sorted matrix 2
Introduction and discussion of work experience
Medium-level DSA question
Second round was a DSA and system design round, involving a medium-level DSA question and discussion of internship experiences and learnings.
Implement functionality for an app using data structures such as maps and heaps
First round was a DSA round with medium-level questions, focusing on implementing app functionality using data structures like maps and heaps.
Best team with no conflicts Leetcode problem
First round is a coding challenge
Write the code of postorder traversal without using recursion
First round is a coding challenge
Find permutations of numbers with an O(N) time complexity constraint.
A 90-minute technical round focused on two medium-level DSA problems. The candidate was required to write and execute code on a compiler while addressing follow-up optimizations.
Solve a problem involving recursion and binary search, including implementing optimized approaches and handling follow-up requirements.
A 90-minute technical round focused on two medium-level DSA problems. The candidate was required to write and execute code on a compiler while addressing follow-up optimizations.
System design elements, such as URL shorteners or e-commerce platforms
The second round combined DSA challenges with system design elements, and also included a discussion on internship experiences.
Devising app functionalities using maps and heaps
The first round was a DSA session with medium-level questions, focusing on data structures such as maps and heaps.
Explain different mechanisms of IPC (Inter Process Communication), semaphores, scheduling algorithms in multicore processors, process vs thread, storage classes in C, and how interrupts work.
30-minute virtual interview covering topics like IPC mechanisms, semaphores, scheduling algorithms in multicore processors, process vs thread, storage classes in C, interrupts, and DSA questions. DSA questions included linked list operations, bit manipulation, and endianness detection.
Detect a cycle in a linked list.
30-minute virtual interview covering topics like IPC mechanisms, semaphores, scheduling algorithms in multicore processors, process vs thread, storage classes in C, interrupts, and DSA questions. DSA questions included linked list operations, bit manipulation, and endianness detection.
Write code to detect whether a system uses little-endian or big-endian architecture.
30-minute virtual interview covering topics like IPC mechanisms, semaphores, scheduling algorithms in multicore processors, process vs thread, storage classes in C, interrupts, and DSA questions. DSA questions included linked list operations, bit manipulation, and endianness detection.
Write code to swap the most significant bit (MSB) and least significant bit (LSB) of an integer.
30-minute virtual interview covering topics like IPC mechanisms, semaphores, scheduling algorithms in multicore processors, process vs thread, storage classes in C, interrupts, and DSA questions. DSA questions included linked list operations, bit manipulation, and endianness detection.
Write SQL queries involving joins, group by, and aggregate functions based on a given scenario.
The round focused on data structures, algorithms, core technical concepts, and system design fundamentals.
Explain inheritance, polymorphism, encapsulation, and abstraction in Object-Oriented Programming with examples from academic or project work.
The round focused on data structures, algorithms, core technical concepts, and system design fundamentals.
Discuss process synchronization, deadlocks, and memory management (paging vs. segmentation) in Operating Systems.
The round focused on data structures, algorithms, core technical concepts, and system design fundamentals.
Explain and implement the bubble sort algorithm.
The round focused on data structures, algorithms, core technical concepts, and system design fundamentals.
Reverse an array of integers.
The round focused on data structures, algorithms, core technical concepts, and system design fundamentals.
Write a program to reverse a given integer.
The round focused on data structures, algorithms, core technical concepts, and system design fundamentals.
Find if a pair with a given sum exists in an array.
Technical interview focused on 3 DSA coding questions and resume-based discussions.
Check if a linked list has a cycle.
Technical interview focused on 3 DSA coding questions and resume-based discussions.
Print all duplicates in an array.
Technical interview focused on 3 DSA coding questions and resume-based discussions.
Python and Data Structures-related questions
Focused on technical skills, including Cloud and JavaScript. Questions also covered Python and Data Structures.
Cloud and JavaScript-related questions
Focused on technical skills, including Cloud and JavaScript. Questions also covered Python and Data Structures.
Find a specific word within a vector of strings.
On-site coding round involving a problem related to strings. Candidates were given a vector of strings and asked to find a specific word within it.
Explain the difference between Docker and virtualization.
In-person interview round covering resume-based questions, scenario-based problem, SQL query, coding task, and conceptual topics.
Print the alphabet 'N' using any programming language.
In-person interview round covering resume-based questions, scenario-based problem, SQL query, coding task, and conceptual topics.
Write a SQL query using the GROUP BY clause.
In-person interview round covering resume-based questions, scenario-based problem, SQL query, coding task, and conceptual topics.
Implement a system to apply discounts on a cart during checkout, including credit card validation and order amount considerations.
In-person interview round covering resume-based questions, scenario-based problem, SQL query, coding task, and conceptual topics.
Explain projects listed on the resume, reasons for choosing the degree, and details about the gap year in education.
In-person interview round covering resume-based questions, scenario-based problem, SQL query, coding task, and conceptual topics.
Discuss an experience where you had to learn a new technology or tech stack within a limited time frame.
In-person round covering resume-based questions, C++/OOPS concepts, coding, general experience, and puzzles.
For runtime polymorphism in C++, what else is necessary besides the function being virtual?
In-person round covering resume-based questions, C++/OOPS concepts, coding, general experience, and puzzles.
Given a rope that burns out in 1 hour, measure 45 minutes using it.
In-person round covering resume-based questions, C++/OOPS concepts, coding, general experience, and puzzles.
Explain what RAG is.
In-person round covering resume-based questions, C++/OOPS concepts, coding, general experience, and puzzles.
Explain shallow copy and deep copy in C++.
In-person round covering resume-based questions, C++/OOPS concepts, coding, general experience, and puzzles.
Explain the 'virtual' keyword in C++.
In-person round covering resume-based questions, C++/OOPS concepts, coding, general experience, and puzzles.
Explain v-table in C++.
In-person round covering resume-based questions, C++/OOPS concepts, coding, general experience, and puzzles.
Explain the SOLID principles in OOAD.
In-person round covering resume-based questions, C++/OOPS concepts, coding, general experience, and puzzles.
Given a string like 'abbcddeee', output 'ab2cd2e3' where adjacent similar characters are compressed while maintaining input order.
In-person round covering resume-based questions, C++/OOPS concepts, coding, general experience, and puzzles.
What is the minimum number of cuts required to divide a cake into 8 equal parts?
In-person round covering resume-based questions, C++/OOPS concepts, coding, general experience, and puzzles.
Given a k-ary tree, design a method to store the tree in an array such that it can be reconstructed, specifically defining the index mapping for children nodes.
Three technical interview rounds were conducted. The questions were generally straightforward, focusing on data structures, algorithms, and previous internship experience.
Find the second minimum element in an array using an optimized approach with fewer than 2n comparisons.
Three technical interview rounds were conducted. The questions were generally straightforward, focusing on data structures, algorithms, and previous internship experience.
Given an array containing 0 or 1 only, find maximum subarray with equal number of zeroes and ones?
This round was totally DSA, with 4 coding questions.
Find maximum palindrome in a string?
This round was totally DSA, with 4 coding questions.
Design a parking lot system with proper exception handling.
A machine coding round requiring the design of a parking lot system with robust exception handling within 90 minutes.
Find the number of distinct islands in a 2D matrix.
A one-hour coding assessment consisting of two algorithmic problems.
Find the number of subarrays with a sum exactly equal to k.
A one-hour coding assessment consisting of two algorithmic problems.
custom algorithm for route optimization considering time, distance, and vehicle capacity
Technical deep dive on project architecture and scalability
Given an array of integers representing feature importance scores, find the maximum possible performance score defined as min(score[i], score[j]) × |i - j| for any pair of indices (i, j).
A single technical problem focused on optimizing a performance score calculation.
Given a string of lowercase English letters, design a mapping of each letter to a distinct positive integer (≤100) such that the bitwise XOR of the mapped sequence is minimized.
A problem involving string mapping and bitwise XOR optimization.
Check if a given string is a palindrome and write test cases to prove correctness.
1:1 Algo/DS round with 1 easy and 1 medium-level question. Candidate was required to write test cases for the solutions.
Find the longest palindromic substring in a given string and write test cases to prove correctness.
1:1 Algo/DS round with 1 easy and 1 medium-level question. Candidate was required to write test cases for the solutions.
Debug and fix a pre-written code snippet containing bugs within a given timeframe.
60-minute video interview focused on debugging and problem-solving. Candidate was given a pre-written buggy code snippet and required to debug and fix it within a timeframe.
Implement a stack using two queues and explain the operations.
The round focused on Data Structures and Algorithms (DSA) with questions on stacks and queues, and a two-pointers technique.
Solve a problem using the two-pointers technique.
The round focused on Data Structures and Algorithms (DSA) with questions on stacks and queues, and a two-pointers technique.
Draw architecture of current project
Discussion on current project architecture, multithreading questions, and behavioral questions.
Design an API using proper design patterns
Discussion on SOLID principles, Singleton Design Pattern, Lambda expression problem, Multithreading Concepts, and API design using SpringBoot.
Multithreading questions
Discussion on current project architecture, multithreading questions, and behavioral questions.
Convert linked list to queue
Discussion on current project and architecture, followed by DSA questions and Java advanced concepts.
Multithreading Concepts
Discussion on SOLID principles, Singleton Design Pattern, Lambda expression problem, Multithreading Concepts, and API design using SpringBoot.
Singleton Design Pattern
Discussion on SOLID principles, Singleton Design Pattern, Lambda expression problem, Multithreading Concepts, and API design using SpringBoot.
SOLID principles
Discussion on SOLID principles, Singleton Design Pattern, Lambda expression problem, Multithreading Concepts, and API design using SpringBoot.
Out Of Memory Error solution
Discussion on current project and architecture, followed by DSA questions and Java advanced concepts.
JAVA Memory Model
Discussion on current project and architecture, followed by DSA questions and Java advanced concepts.
Permutations of String
Discussion on current project and architecture, followed by DSA questions and Java advanced concepts.
Lambda expression problem
Discussion on SOLID principles, Singleton Design Pattern, Lambda expression problem, Multithreading Concepts, and API design using SpringBoot.
Docker/AWS/Kubernetes fundamentals
Discussion on current project and architecture, followed by Docker/AWS/Kubernetes fundamentals and behavioral questions.
map data structure question
Technical test round with coding questions related to map and stack data structures.
stack data structure question
Technical test round with coding questions related to map and stack data structures.
largest number having both positive and negative values present in the array
Online assessment with two coding questions on arrays and strings
remove three consecutive duplicates string
Online assessment with two coding questions on arrays and strings
explain any OOPs concept and give real world application
Technical interview with questions about Java and coding
reverse a string
Technical interview with questions about Java and coding
handle exceptions if string is NULL
Technical interview with questions about Java and coding
fibonacci series
Technical interview with questions about Java and coding
What challenges did you face in the past and how did you resolve them?
The candidate was asked about past challenges and their resolutions
Why did I want to work here
The candidate was asked about their motivation
Do you have experience working with regulators such as the SEC or CFTC?
The candidate was asked about their professional background regarding regulatory compliance.
Basics spring boot questions
The interview focused on fundamental programming concepts and framework knowledge.
Basic Java questions
The interview focused on fundamental programming concepts and framework knowledge.
Prepaid Journal related questions
The interview focused on accounting principles and journal entries.
Situation based questions involving simulations
The interview focused on situational questions involving technical simulations.
Project-based questions
The interview focused on fundamental computer science concepts and project-related discussions.
Core subjects
The interview focused on fundamental computer science concepts and project-related discussions.
Object-oriented programming
The interview focused on fundamental computer science concepts and project-related discussions.
Data structures
The interview focused on fundamental computer science concepts and project-related discussions.
Database management systems
The interview focused on fundamental computer science concepts and project-related discussions.
Computer networks
The interview focused on fundamental computer science concepts and project-related discussions.
Overall understanding of marketing operations
The interview focused on the candidate's understanding of marketing operations.
Merge two sorted arrays and find the kth element
The candidate was asked to solve a coding problem involving array manipulation.
What was problem you faced during the development of a project and how you tackled it.
The interviewer asked about a technical challenge encountered during a past project and the methodology used to resolve it.
What is an amplifier
A technical interview covering C programming, electronics fundamentals, and personal background.
Explain microcontrollers
A technical interview covering C programming, electronics fundamentals, and personal background.
Explain DAC and ADC
A technical interview covering C programming, electronics fundamentals, and personal background.
What is an embedded system
A technical interview covering C programming, electronics fundamentals, and personal background.
Explain storage classes in C
A technical interview covering C programming, electronics fundamentals, and personal background.
Find the largest of three numbers using conditional operators
A technical interview covering C programming, electronics fundamentals, and personal background.
Divide a number by 2 without using the division operator
A technical interview covering C programming, electronics fundamentals, and personal background.
Multiply a number by 2 without using the multiplication operator
A technical interview covering C programming, electronics fundamentals, and personal background.
Project-related questions
Interview focused on electronics, programming concepts, project work, and previous internships. Candidates were asked to explain their coding solutions from the OA.
C programming concepts
Interview focused on electronics, programming concepts, project work, and previous internships. Candidates were asked to explain their coding solutions from the OA.
Explanation of OA coding solutions
Interview focused on electronics, programming concepts, project work, and previous internships. Candidates were asked to explain their coding solutions from the OA.
Find all prime numbers up to n
The interview focused on project work, C++ concepts, OOP principles, and basic data structure problems.
Check if a year is a leap year
The interview focused on project work, C++ concepts, OOP principles, and basic data structure problems.
Explain Polymorphism, runtime vs compile-time polymorphism with examples
One-hour technical interview with a Lead Associate Engineer focusing on OOPS concepts, C/C++ fundamentals, and coding problems.
What are Armstrong numbers?
One-hour technical interview with a Lead Associate Engineer focusing on OOPS concepts, C/C++ fundamentals, and coding problems.
What is OOPS in layman's terms?
One-hour technical interview with a Lead Associate Engineer focusing on OOPS concepts, C/C++ fundamentals, and coding problems.
Find prime numbers
One-hour technical interview with a Lead Associate Engineer focusing on OOPS concepts, C/C++ fundamentals, and coding problems.
Fibonacci series (iterative and recursive)
One-hour technical interview with a Lead Associate Engineer focusing on OOPS concepts, C/C++ fundamentals, and coding problems.
Work and time aptitude problem
One-hour technical interview with a Lead Associate Engineer focusing on OOPS concepts, C/C++ fundamentals, and coding problems.
What are constructors and destructors and their purpose?
One-hour technical interview with a Lead Associate Engineer focusing on OOPS concepts, C/C++ fundamentals, and coding problems.
Swap two numbers without a third variable
One-hour technical interview with a Lead Associate Engineer focusing on OOPS concepts, C/C++ fundamentals, and coding problems.
What are pointers and their use in OOPS?
One-hour technical interview with a Lead Associate Engineer focusing on OOPS concepts, C/C++ fundamentals, and coding problems.
Difference between C and C++
One-hour technical interview with a Lead Associate Engineer focusing on OOPS concepts, C/C++ fundamentals, and coding problems.
Definition and examples of dynamic data structures
A technical interview focusing on OOPS concepts, C programming, and data structures, including a project discussion and a coding task.
Definition and examples of abstraction
A technical interview focusing on OOPS concepts, C programming, and data structures, including a project discussion and a coding task.
Difference between Structural and Object-Oriented Programming
A technical interview focusing on OOPS concepts, C programming, and data structures, including a project discussion and a coding task.
Definition and types of polymorphism
A technical interview focusing on OOPS concepts, C programming, and data structures, including a project discussion and a coding task.
Write a program for Fibonacci series
A technical interview focusing on OOPS concepts, C programming, and data structures, including a project discussion and a coding task.
PWM and efficiency formula
A 50-minute technical interview covering project experience, core electronics concepts, and basic programming.
Palindrome of a number
A 50-minute technical interview covering project experience, core electronics concepts, and basic programming.
Motor related circuits
A 50-minute technical interview covering project experience, core electronics concepts, and basic programming.
Resistor color configuration and calculation
A 50-minute technical interview covering project experience, core electronics concepts, and basic programming.
BJT, Zener diode, and MOSFET advantages and uses
A 50-minute technical interview covering project experience, core electronics concepts, and basic programming.
Faraday's law
A 50-minute technical interview covering project experience, core electronics concepts, and basic programming.
Circuit explanation
A 50-minute technical interview covering project experience, core electronics concepts, and basic programming.
Use of relay and two-way switches
A 50-minute technical interview covering project experience, core electronics concepts, and basic programming.
OOP concepts (inheritance, encapsulation)
Virtual interview focusing on core computer science subjects and problem-solving.
Computer Networks
Virtual interview focusing on core computer science subjects and problem-solving.
Operating Systems
Virtual interview focusing on core computer science subjects and problem-solving.
Object-Oriented Programming (OOPs)
Virtual interview focusing on core computer science subjects and problem-solving.
Database Management Systems (DBMS)
Virtual interview focusing on core computer science subjects and problem-solving.
Bit manipulation problems
Virtual interview focusing on core computer science subjects and problem-solving.
Explain your microcontroller-based projects
The interview focused on project deep-dives and core programming concepts. The candidate discussed a microcontroller-based project in detail and answered technical questions regarding C++.
Three technical questions related to C++
The interview focused on project deep-dives and core programming concepts. The candidate discussed a microcontroller-based project in detail and answered technical questions regarding C++.
How did you build the automated vacuum cleaner project?
The interview focused on project deep-dives and core programming concepts. The candidate discussed a microcontroller-based project in detail and answered technical questions regarding C++.
How do you approach teamwork vs. working independently?
An AI-proctored interview consisting of 13 questions where candidates had 20 seconds to prepare and 2 minutes to record each response.
Share your best travel experience.
An AI-proctored interview consisting of 13 questions where candidates had 20 seconds to prepare and 2 minutes to record each response.
Key learnings from the project.
An AI-proctored interview consisting of 13 questions where candidates had 20 seconds to prepare and 2 minutes to record each response.
What method do you follow during your meeting commitments?
An AI-proctored interview consisting of 13 questions where candidates had 20 seconds to prepare and 2 minutes to record each response.
What is overfitting, and how can it be prevented?
An AI-proctored interview consisting of 13 questions where candidates had 20 seconds to prepare and 2 minutes to record each response.