AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
AD3I Systems Interview Questions and Answers
Be the first one to contribute and help others!
Interview questions from similar companies
Anonymous
I was interviewed before Apr 2021.
(6 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Started with the discussion why do you want to join DE shaw. Since prior to my current company, I was working with a finance based company so they asked why do you want to come back to finance base company. So they asked my about debentures, bonds, mortgages and other financial jargons.
Then they asked questions related to DSA, OS etc.
- Q1.
Find Triplets with Given Sum Problem Statement
Given an array
ARRconsisting ofNintegers, your task is to identify all distinct triplets within the array that sum up to a given integerK.Explanation:
... - Ans.
The task is to find all distinct triplets in an array that sum up to a given integer.
Iterate through the array and use nested loops to find all possible triplets.
Use a set to store unique triplets and avoid duplicates.
Check if the sum of the triplet equals the target sum.
Return the list of valid triplets or -1 if no such triplet exists.
- Q2.
Minimum Number of Platforms Problem
Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.
Explanation:
Given two arrays:
AT- represent...
- Ans.
Determine the minimum number of platforms needed at a railway station so that no train has to wait.
Sort the arrival and departure times arrays in ascending order.
Initialize two pointers for arrival and departure times, and a variable to keep track of the maximum number of platforms needed.
Increment the platform count when a train arrives and decrement when a train departs.
Update the maximum platform count as needed.
Ret...
- Q3. What is the difference between internal fragmentation and external fragmentation in operating systems?
- Ans.
Internal fragmentation occurs when memory is allocated in fixed-size blocks, leading to wasted space within a block. External fragmentation occurs when free memory is fragmented into small chunks, making it difficult to allocate contiguous blocks.
Internal fragmentation is caused by allocating fixed-size blocks of memory, leading to wasted space within a block.
External fragmentation occurs when free memory is fragmented...
- Q4. Write an SQL query to find the employee with the nth highest salary.
- Ans.
SQL query to find the employee with the nth highest salary
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT clause to select the nth highest salary
Join the employee table with the salary table to get the employee details
- Q5. How is Java platform independent?
- Ans.
Java is platform independent due to its bytecode and JVM.
Java code is compiled into bytecode, which can run on any platform with a Java Virtual Machine (JVM)
JVM acts as an intermediary between the Java code and the underlying platform, ensuring portability
Developers write code once and it can be executed on any platform that has a compatible JVM
Examples: Windows, macOS, Linux all can run Java programs without any chang
- Q6. What is the difference between an abstract class and an interface in Java?
- Ans.
Abstract class can have both abstract and non-abstract methods, while interface can only have abstract methods.
Abstract class can have constructor, member variables, and methods with implementation.
Interface can only have abstract methods and constants.
A class can implement multiple interfaces but can only extend one abstract class.
Example: Abstract class - Animal with abstract method 'eat' and non-abstract method 'sle
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I was interviewed before Apr 2021.
(4 Questions)
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on Core Subjects mainly.
- Q1. What is the difference between C and C++?
- Ans.
C is a procedural programming language while C++ is an object-oriented programming language with features like classes and inheritance.
C is a procedural programming language, while C++ is a multi-paradigm language with support for object-oriented programming.
C does not support classes and objects, while C++ does.
C uses structures for data organization, while C++ uses classes for data organization.
C does not have featur...
- Q2. What is a virtual function?
- Ans.
A virtual function is a function in a base class that is declared using the keyword 'virtual' and can be overridden by a function with the same signature in a derived class.
Virtual functions allow for dynamic polymorphism in object-oriented programming.
They are used to achieve runtime binding and enable the implementation of the function to be determined during runtime.
Example: virtual void display() = 0; in a base cla...
- Q3. What is inheritance in object-oriented programming?
- Ans.
Inheritance is a concept in object-oriented programming where a class inherits properties and behaviors from another class.
Allows for code reusability by creating a new class based on an existing class
Child class inherits attributes and methods of the parent class
Can have multiple levels of inheritance (e.g. grandparent, parent, child classes)
Example: class Dog extends Animal, where Dog inherits properties and methods
- Q4. What is the difference between a Default Constructor and a Copy Constructor in Object-Oriented Programming?
- Ans.
Default Constructor is a constructor that is automatically called when an object is created without any arguments. Copy Constructor is used to create a new object as a copy of an existing object.
Default Constructor has no parameters, while Copy Constructor takes an object of the same class as a parameter.
Default Constructor initializes the object with default values, while Copy Constructor creates a new object with the...
(5 Questions)
Round duration - 40 minutes
Round difficulty - Easy
Technical Interview round with questions on Core Subjects mainly.
- Q1. What are the types of access modifiers in C++?
- Ans.
The types of access modifiers in C++ are public, private, and protected.
Public: accessible from outside the class
Private: only accessible within the class
Protected: accessible within the class and its subclasses
- Q2. What is the difference between DDL (Data Definition Language) and DML (Data Manipulation Language)?
- Ans.
DDL is used to define the structure of database objects, while DML is used to manipulate data within those objects.
DDL is used to create, modify, and delete database objects like tables, indexes, etc.
DML is used to insert, update, delete, and retrieve data from database tables.
DDL statements include CREATE, ALTER, DROP, TRUNCATE, etc.
DML statements include INSERT, UPDATE, DELETE, SELECT, etc.
- Q3. What are the key differences between a Primary Key and a Unique Key in a database management system?
- Ans.
Primary Key uniquely identifies each record in a table, while Unique Key ensures that all values in a column are distinct.
Primary Key does not allow NULL values, while Unique Key allows one NULL value.
A table can have only one Primary Key, but multiple Unique Keys.
Primary Key is automatically indexed, while Unique Key may or may not be indexed.
Primary Key is used to establish relationships between tables, while Unique ...
- Q4. What is the difference between DBMS and RDBMS?
- Ans.
DBMS is a software system that manages databases, while RDBMS is a type of DBMS that stores data in a structured format using tables.
DBMS stands for Database Management System, which is a software system that allows users to interact with a database.
RDBMS stands for Relational Database Management System, which is a type of DBMS that stores data in a structured format using tables with rows and columns.
RDBMS uses Struct...
- Q5. What are the objectives of normalization in database management systems?
- Ans.
Normalization in database management systems aims to reduce data redundancy, improve data integrity, and optimize database performance.
Eliminate data redundancy by breaking down data into smaller tables
Reduce update anomalies by ensuring data is stored in a logical and consistent manner
Improve data integrity by enforcing referential integrity constraints
Optimize database performance by reducing the amount of redundant
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Interview Preparation Tips
Experience: Though technical questions were not that difficult but the quant section was way too hard and almost impossible to solve completely in given time limit.
Tips: It’s better if you attempt less questions (in quant) but do them right (I attempted less than 40% quant and still got through).
Round: Technical Interview
Experience: Next they would have 2-3 technical rounds where they cover most of the areas of CS. Some of the areas where they concentrated more would be Algorithms, OOPS Concepts and Logical Puzzles.
Tips: Brush up important concepts from various areas such as Operating System, OOPS, Software Engineering. Be ready for some really challenging questions in Algorithms. Also they do ask quite a few logical puzzles so it’s important you practice a lot of them online before the interview.
General Tips: D E Shaw selects very few candidates + comes in starting weeks of placement season, so competition is immense. Multiple companies come on same day, so it becomes a little tedious. Surely I wasn't the better candidate that day.
Skill Tips: D E Shaw focuses more on your ability to solve logical problems, so make sure you are in best state of your mind and speak while solving any problem because what they are looking for is not the right answer (well of course they are) but also how are you approaching the problem.
Skills: Operating System, OOPS, Algorithms, CS, logical puzzles, Quant
College Name: NIT SURATHKAL
I was interviewed before Apr 2021.
(1 Question)
Round duration - 40 minutes
Round difficulty - Medium
The test has 3 sections :
1. Quantitative contains 20 questions. These questions are easy to me. If u practice quant, you can easily solve it.
2. Technical contains 20 questions. Some questions are on C , C++ , java outputs. Remaining are based on DSA. If u Know all the time complexities of algorithms then it is easy . In technical they gave one DSA problem.
3. Essay: They have given one picture and then asked to write an essay by seeing the picture.
- Q1.
Dijkstra's Algorithm for Shortest Path
Given an undirected graph with 'V' vertices labeled from 0 to V-1 and 'E' edges. Each edge has a weight that represents the distance between two nodes 'X' and 'Y'.
...
- Ans.
Dijkstra's algorithm is used to find the shortest path distances from a source node to all other vertices in a graph.
Dijkstra's algorithm is a greedy algorithm that finds the shortest path from a source node to all other nodes in a graph.
It uses a priority queue to select the node with the smallest distance and relaxes its neighbors.
The algorithm maintains a distance array to keep track of the shortest distances from t...
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
3 persons are there in panel. They are asking questions on basic concepts in subjects and some advanced concepts.
- Q1. What is a Daemon Process?
- Ans.
A daemon process is a background process that runs continuously to perform system tasks.
Daemon processes do not have a controlling terminal.
They typically run in the background and perform tasks such as managing hardware devices, network services, or system maintenance.
Examples of daemon processes include cron, sshd, and apache.
Daemon processes are often started during system boot and run until the system is shut down.
- Q2. What are the advantages of system calls in operating systems?
- Ans.
System calls provide a way for user-level processes to interact with the operating system kernel.
System calls allow user programs to request services from the operating system.
They provide a secure and controlled way for applications to access system resources.
System calls enable processes to perform tasks such as file operations, network communication, and process management.
Examples of system calls include open(), re
- Q3. Can you explain the select() system call?
- Ans.
The select() system call is used in Unix-like operating systems to monitor multiple file descriptors for activity.
select() allows a program to wait for multiple I/O operations to complete on multiple file descriptors.
It takes three sets of file descriptors as arguments - readfds, writefds, and errorfds.
The function will block until an activity is detected on one of the file descriptors or until a timeout occurs.
select(...
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I was interviewed before Apr 2021.
(2 Questions)
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
- Q1.
Binary Tree Mirror Conversion Problem
Given a binary tree, your task is to convert it into its mirror tree.
A binary tree is a data structure where each parent node has at most two children.
The mirror ...
- Ans.
Convert a binary tree into its mirror tree by interchanging left and right children of non-leaf nodes.
Traverse the binary tree in postorder fashion and swap the left and right children of each non-leaf node.
Use recursion to solve the problem efficiently.
Remember to handle null child nodes represented by -1 in the input.
- Q2.
Maximum Sum Subarray Problem Statement
Given an array of integers, find the maximum sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Output:
137
Exp...
- Ans.
Find the maximum sum of any contiguous subarray within an array in O(N) time complexity.
Iterate through the array and keep track of the maximum sum of subarrays encountered so far
At each index, decide whether to include the current element in the subarray or start a new subarray
Update the maximum sum if a new maximum is found
Example: For array [34, -50, 42, 14, -5, 86], the maximum sum subarray is [42, 14, -5, 86] with
(2 Questions)
Round duration - 45 minutes
Round difficulty - Hard
Technical Interview round with questions on DSA.
- Q1.
Find the Largest BST Subtree in a Given Binary Tree
Your task is to determine the size of the largest subtree of a given binary tree which is also a Binary Search Tree (BST).
BST Definition:
- The left...
- Ans.
Find the size of the largest subtree in a binary tree that is also a Binary Search Tree (BST).
Traverse the binary tree in a bottom-up manner to check if each subtree is a BST.
Keep track of the size of the largest BST subtree encountered so far.
Use the properties of a BST to determine if a subtree is a valid BST.
Consider edge cases such as empty tree or single node tree.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1
- Q2.
Next Higher and Previous Lower Number with Same Number of Set Bits
Given a positive integer
n, the task is to find the next smallest integer and the previous largest integer that contain the exact same nu... - Ans.
Find next smallest and previous largest integers with same number of set bits as given integer.
Count the number of set bits in the given integer using bitwise operations.
For next smallest integer, find the next number with same number of set bits by iterating through numbers greater than the given integer.
For previous largest integer, find the previous number with same number of set bits by iterating through numbers sm
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Interview Preparation Tips
Experience: The first round had two sections. First section consisted of general aptitude and technical aptitude questions. In the second section we were given one coding question, for which we had to write the code in a language of our preference (C,C++,Java). Around 20 students were selected in the first round.
Round: Technical Interview
Experience: The second round was a technical interview. Two interviewers were present and the interview duration was 1-1.5 hours. Questions on Computer Networks, Databases, Operating Systems, Algorithms were asked. But they were more concerned about coding fundamentals especially C++ and Java. 6 students were selected in the second round.
Round: Technical Interview
Experience: Third round was again a technical interview. The interview process was same as previous second round.
Round: HR Interview
Experience: All the 6 students who were selected for the third round had a HR interview.
General Tips: The technical interview process was exhausting as the interview duration was 1-1.5 hours and challenging as they asked questions from all major fields of computer science.
Skill Tips: Prepare a decent resume and have at least 3-4 hard copies of it available with you all the times.Also do carry passport size photos with you. While going for interviews wear proper formals,carry 2-3 copies of resume and a pen.
Skills: C, Basic coding questions, Database, Data structures, Computer Networks, OS, Algorithms
College Name: NIT SURATHKAL
Interview Questionnaire
12 Questions
- Q1. Find maximum length BST in a given binary tree?
- Ans.
To find the maximum length BST in a given binary tree.
Traverse the tree in post-order fashion
For each node, check if it satisfies the BST property
If it does, calculate the size of the BST rooted at that node
Keep track of the maximum size seen so far
- Q2. Write an algorithm to find the absolute max subsequence of an array containing both positive and negative numbers in O(n) time ?
- Ans.
Algorithm to find absolute max subsequence of an array with positive and negative numbers in O(n) time.
Initialize max_so_far and max_ending_here as 0
Loop through the array and for each element, add it to max_ending_here
If max_ending_here becomes negative, reset it to 0
If max_ending_here is greater than max_so_far, update max_so_far
Return max_so_far
- Q3. Given an array eliminate the duplicates and print it. Linear time complexity?
- Ans.
Eliminate duplicates in an array of strings and print it in linear time complexity.
Use a hash set to keep track of unique elements
Iterate through the array and add non-duplicate elements to the hash set
Print the hash set elements to get the final array
- Q4. Balancing of Btrees / AVL trees?
- Ans.
Balancing of Btrees / AVL trees is important for efficient search and insertion operations.
Btrees and AVL trees are self-balancing binary search trees.
Balancing ensures that the height of the tree is minimized, leading to faster search and insertion operations.
Btrees are used in databases while AVL trees are used in memory.
Balancing is achieved by performing rotations and node splitting.
AVL trees have a stricter balanc...
- Q5. Two cops and a robber are located on opposite corners of a cube and move along its edges. They all move at the same rate. Is it possible for the cops to catch the robber. [Each of the 3 people can see each...
- Q6. In some tournament 139 teams have participated. Tournament is knock out. what is the number of matches to choose the champion to be held?
- Ans.
139 teams in a knock-out tournament, find the number of matches to choose the champion.
In a knock-out tournament, each team plays only one match per round.
The number of matches required to choose the champion is one less than the number of teams.
Therefore, the number of matches required is 138.
- Q7. OS concepts – Threading, Deadlocks, Paging etc
- Q8. Databases Questions – Transactions, ACID etc
- Q9. Project details in your resume?
- Ans.
My resume includes projects such as a web-based inventory management system and a mobile app for tracking fitness goals.
Developed a web-based inventory management system using PHP and MySQL
Created a mobile app for tracking fitness goals using React Native
Implemented RESTful APIs for communication between front-end and back-end
Utilized version control tools such as Git for collaborative development
Designed and implement...
- Q10. Given a 7mt long gold bar , need to cut and give to worker for 7 days (1 meter long) How many min cuts?
- Q11. Write algo to mirror a given Binary Tree?
- Ans.
Algorithm to mirror a given Binary Tree
Create a function to swap left and right child nodes of a given node
Recursively call the function on left and right child nodes
Base case: if node is null, return
Call the function on the root node of the binary tree
- Q12. Find the next largest int of a given int such that it has same number of 1′s in binary?
- Ans.
Find the next largest int with same number of 1's in binary.
Count the number of 1's in the binary representation of the given int.
Increment the given int until a number with the same number of 1's is found.
Return the next largest int with same number of 1's.
Interview Preparation Tips
College Name: NA
Skills evaluated in this interview
Interview Questionnaire
21 Questions
- Q1. Hobbies and interests
- Q2. Questions regarding java
- Q3. OOP concepts in Java
- Ans.
OOP concepts in Java
Encapsulation - hiding implementation details
Inheritance - creating new classes from existing ones
Polymorphism - ability of objects to take on multiple forms
Abstraction - focusing on essential features and ignoring the rest
Example: A Car class can inherit from a Vehicle class
Example: A Dog class can have a bark() method that overrides the Animal class's makeSound() method
Example: A Shape class can h...
- Q4. OOP Java Design problems
- Ans.
Answering OOP Java design problems
Identify the problem domain and create a class hierarchy
Use encapsulation to hide implementation details
Apply inheritance to reuse code and create subtypes
Implement polymorphism to allow objects to take on multiple forms
Avoid tight coupling and favor composition over inheritance
Use design patterns to solve common problems
Consider SOLID principles for maintainable code
- Q5. C++ Virtual Functions
- Q6. What is the difference between C and C++?
- Ans.
C++ is an extension of C with object-oriented programming features.
C++ supports classes and objects while C does not.
C++ has better support for polymorphism and inheritance.
C++ has a standard template library (STL) which C does not have.
C++ allows function overloading while C does not.
C++ has exception handling while C does not.
- Q7. What is inheritance?
- Ans.
Inheritance is a mechanism in object-oriented programming where a new class is created by inheriting properties of an existing class.
Inheritance allows code reusability and saves time and effort in programming.
The existing class is called the superclass or parent class, and the new class is called the subclass or child class.
The subclass inherits all the properties and methods of the superclass and can also add its own...
- Q8. What is the difference between default and copy constructor?
- Ans.
Default constructor is provided by the compiler if no constructor is defined. Copy constructor creates a new object by copying an existing object.
Default constructor initializes member variables to default values.
Copy constructor creates a new object with the same values as an existing object.
Default constructor is called automatically by the compiler if no constructor is defined.
Copy constructor is called when an obje...
- Q9. What are access specifiers?
- Ans.
Access specifiers are keywords in object-oriented programming languages that determine the visibility and accessibility of class members.
Access specifiers are used to restrict access to class members.
There are three types of access specifiers: public, private, and protected.
Public members can be accessed from anywhere in the program.
Private members can only be accessed within the class.
Protected members can be accessed...
- Q10. What is library functions?
- Ans.
Library functions are pre-written code that can be reused to perform common tasks.
Library functions save time and effort by providing pre-written code.
They are often included in programming languages or external libraries.
Examples include functions for string manipulation, mathematical calculations, and file input/output.
Library functions can be called from within a program to perform specific tasks.
They can also be cu
- Q11. What is the difference between DML and DLL?
- Ans.
DML is Data Manipulation Language used to manipulate data in a database. DLL is Data Definition Language used to define database schema.
DML is used to insert, update, delete data in a database.
DLL is used to create, alter, drop database objects like tables, views, indexes.
DML statements include INSERT, UPDATE, DELETE.
DLL statements include CREATE, ALTER, DROP.
DML affects data in a database, DLL affects the structure of
- Q12. What is the difference between primary key and unique key?
- Ans.
Primary key uniquely identifies a record in a table, while unique key ensures that all values in a column are distinct.
Primary key can't have null values, while unique key can have one null value.
A table can have only one primary key, but multiple unique keys.
Primary key is used as a foreign key in other tables, while unique key is not.
Example: Primary key - employee ID, Unique key - email address.
- Q13. What is a stack?
- Ans.
A stack is a data structure that follows the Last-In-First-Out (LIFO) principle.
Elements are added to the top of the stack and removed from the top.
Common operations include push (add element) and pop (remove element).
Stacks can be implemented using arrays or linked lists.
Examples include the call stack in programming and the undo/redo feature in text editors.
- Q14. What is an Assembly?
- Ans.
Assembly is a low-level programming language that is used to write programs that can directly interact with computer hardware.
Assembly language is specific to a particular computer architecture.
It is a low-level language that is difficult to read and write.
Assembly language programs are faster and more efficient than programs written in high-level languages.
Examples of assembly language include x86, ARM, and MIPS.
Assem...
- Q15. What are class access modifiers?
- Ans.
Class access modifiers are keywords used to control the visibility and accessibility of class members.
There are four access modifiers in Java: public, private, protected, and default
Public members can be accessed from anywhere
Private members can only be accessed within the same class
Protected members can be accessed within the same class, subclasses, and same package
Default members can be accessed within the same packa
- Q16. What is serialization?
- Ans.
Serialization is the process of converting an object into a format that can be stored or transmitted.
Serialization is used to save the state of an object and recreate it later.
It is commonly used in network communication to transmit data between different systems.
Examples of serialization formats include JSON, XML, and binary formats like Protocol Buffers.
Deserialization is the opposite process of converting serialized
- Q17. What is the purpose of Normalisation?
- Ans.
Normalisation is the process of organizing data in a database to reduce redundancy and improve data integrity.
Normalisation helps to eliminate data redundancy and inconsistencies
It ensures that each piece of data is stored in only one place
It helps to improve data integrity and accuracy
It makes it easier to maintain and update the database
There are different levels of normalisation, each with its own set of rules and g
- Q18. What is the difference between Truncate and Delete?
- Ans.
Truncate removes all data from a table while Delete removes specific data from a table.
Truncate is faster than Delete as it doesn't log individual row deletions.
Truncate resets the identity of the table while Delete doesn't.
Truncate can't be rolled back while Delete can be.
Truncate doesn't fire triggers while Delete does.
- Q19. What is the difference between DBMS and RDBMs?
- Ans.
DBMS is a software system to manage databases while RDBMS is a type of DBMS that uses a relational model.
DBMS stands for Database Management System while RDBMS stands for Relational Database Management System.
DBMS can manage any type of database while RDBMS uses a relational model to manage data.
DBMS does not enforce any specific data model while RDBMS enforces a relational data model.
Examples of DBMS include MongoDB, ...
- Q20. What is Recursion Function?
- Ans.
Recursion function is a function that calls itself until a base condition is met.
Recursion is a technique used to solve problems by breaking them down into smaller sub-problems.
It involves a function calling itself with a modified input until a base case is reached.
Recursion can be used to solve problems such as factorial, Fibonacci series, and binary search.
Recursion can be implemented using loops as well, but it may ...
- Q21. Interview with the Director
Interview Preparation Tips
Experience: Initially they took an online round but due to some network problem, they had to scrap it. Next morning, they came up with a paper based round. There were 2 sections. One was aptitude and one was coding, both being objective type. The aptitude section was as lengthy as difficult. No one could have solved all 30 questions in 30 minutes time. Infact, I was only able to attempt 10. Next 40 minutes or so was reserved for the coding test. The questions they asked covered almost all the topics they mentioned in their pre-placement presentation. But the maximum number of questions were related to getting output or finding errors in C, C++ and JAVA codes. The questions they asked from theoretical subjects were more or less the basics and easy. In those questions (which were quite a few in number), you will be given a huge chunk of code with some part missing and you have to identify which snippet among the options best fits in there. Sometimes its given what the code is supposed to do, but in some questions it was also your task to find out. So I think the differentiating factor is how well your actual coding skills are. And you need to know these 3 languages atleast – C, C++ and JAVA. Again, similar to aptitude section the coding section was also very lengthy with some programs extending upto 1 or more pages. I’d recommend to skip those programs initially and jump to other easy problems first. Then if you have time, you can come back and attempt them.In the end of the coding round, they had one special subjective test in which they asked you to write the full code in any language for the give problem statement. In my case, the problem was : “Given a tree, find the depth of the largest binary search tree it contains.” I know it sounds simple enough but only until you start coding it. And while writing codes of such problems, make sure to display your data-structures and algorithmic skills and not your knowledge of STL libraries. Even if you’re not able to solve the problem and you used some complicated data structures (by using, I mean you created them from scratch without any help from STL libraries) and some good algorithms, then they are likely to appreciate your coding skills if not your problem-solving skills. And just a hint although I think you already know this – BST are the favourites of all software companies . Overall, I sat for 2 companies including Amazon and both of them had a coding problem related to BST only.
Duration: 70 minutes
Total Questions: 2
Round: HR Interview
Experience: Anyways, then there were usual HR questions like your hobbies, interests, family background, history of my town, etc. He did ask me some technical questions also like on seeing the word ‘Hacking’ in my resume, we started discussing upon hacking, its types and laws related to it.
Round: Technical Interview
Experience: They started off with puzzles, which were quite easy and common ones. Then only after 2 puzzles they started asking me about my favourite subject and language. I told them OS, Networks and C++. But instead they asked me all about Java ! I kept telling them I hadn’t revised Java but that didn’t help. They’ll ask some question and I’ll write the code in C++ and they would ask me to convert it to Java. They’d also ask the equivalents of C++ OOP concepts in Java. Its not that I know nothing of Java, I have actually done a lot of coding in it, but that day and time, I was totally unprepared. So I kept guessing a lot based on my poor memory and later to my surprise, I found I got many of them right .They also asked some design questions in which they asked me to write the class and related functions (just the prototypes) for implementing a parking lot management system. Then there were questions on hacking and security. They also asked about the network problem they faced the previous day when the online round was going on, due to which they had to scrap it. They asked what could be the reason behind it and what could be the solution. Overall, again the majority of the questions were coding type with C++ concepts like virtual functions, JAVA OOP, and design problems. This round went on for 15-20 minutes past 1 hour or so.
Round: Behavioural Interview
Experience: Finally, after few hours I was called for my last interview round. It was more like a casual round in which the D.E.Shaw associate director was taking my interview. The first thing he said was “I just wanted to meet you once myself” and he asked a few HR questions again. He asked me if I had any higher studies plan, my strengths and 2 weaknesses, why their company, etc. It was a cool round with the atmosphere also easy and it went on for just 20 minutes or so.
Skill Tips: Criteria :Cs/IT/ECE And CGPA min of 7.0[CSE] .For ECE =7.5
D. E. Shaw generally prefers computer science branch students but they’re not as strict as Amazon or Google and for for CS students it was only 7.0 . Luckily, my CGPA was above the cutoff and I was allowed to sit for the process.
Skills: C++, Java, DBMS, OOP
College Name: BITS PILANI
Skills evaluated in this interview
(1 Question)
- Q1. Indrodution related
I was interviewed in Nov 2020.
(2 Questions)
Round duration - 95 minutes
Round difficulty - Easy
This round was conducted in Hackerrank portal for a total duration of 95 minutes and was divided into 4 sections.
1st Section : Aptitude Section : 14 questions , 28 minutes
2nd Section : Technical Section : 12 questions , 17 minutes
3rd Section :1 coding Questions : 20 minutes+30 minutes
This Round was Conducted on Hackerrank (Webcam Enabled).
- Q1.
Coin Game Problem Statement
Wong wants to borrow money from Dr. Strange, who insists Wong must win a coin game first. The game involves two players taking turns to remove one coin from either end of a row...
- Ans.
Given an array of coin values, determine the maximum value Wong can obtain by playing a coin game against Dr. Strange.
Wong plays first and can remove one coin from either end of the array on each turn.
The game ends when no coins are left, and the player with the highest total value wins.
Consider different scenarios like having an odd or even number of coins in the array.
- Q2.
Find Magic Index in Sorted Array
Given a sorted array A consisting of N integers, your task is to find the magic index in the given array, where the magic index is defined as an index i such that A[i] = i...
- Ans.
Find the magic index in a sorted array where A[i] = i.
Use binary search to efficiently find the magic index in the sorted array.
Check the middle element of the array and compare it with its index to determine the direction to search.
Repeat the process on the left or right half of the array until the magic index is found or no more elements to search.
(2 Questions)
Round duration - 120 minutes
Round difficulty - Medium
This was an Online F2F Technical Round conducted on CodePair : Hackerrank. So, Basically You have to Run and Submit ( Pass All Test cases) in the Interview Round also (Like normal Coding Test) in Codepair : Hackerrank & along with that You should have to explain your Code and Approach to the Interviewers.
The Interviewers were helpful and didn't hesitate in giving hints.
Timing - 10:00 A.M to 12:00 P.M
- Q1.
Minimum Number of Taps to Water the Garden
Given a garden that extends along a one-dimensional x-axis from point 0 to point N, your task is to determine the minimum number of taps needed to water the enti...
- Ans.
Find the minimum number of taps needed to water the entire garden using given tap ranges.
Iterate over taps and update the farthest point each tap can reach.
Use a greedy approach to select the tap that can water the farthest point.
If a tap can't water any point, return -1.
Example: For ranges = [3, 4, 1, 1, 0, 0], tap at position 1 can water the entire garden.
- Q2.
Money Saving in Bank Problem
Harshit wants to save up money for his first car by depositing money daily in the Ninja bank with a specific increment strategy.
Starting with 1 rupee on the first Monday, th...
- Ans.
Calculate the total money accumulated by Harshit in Ninja bank after N days with a specific increment strategy.
Start with 1 rupee on the first Monday and increase by 1 rupee each day from Tuesday to Sunday.
Each new Monday starts with an additional rupee more than the previous Monday's deposit.
Calculate the total amount of money accumulated after N days for each test case.
Example: For N = 2, total amount is 3 rupees; fo
(2 Questions)
Round duration - 120 minutes
Round difficulty - Hard
A lot of Variants based on Constraints were asked in this Round. They will ask you to write the final code for every question before Submitting it(run all test cases) so you won’t get any hints after running test cases in the IDE. ( So don’t Submit your code before dry running it on a lot of Test Cases on pen & paper , they allow to use pen & blank paper at the time of Interviews) .The Interviewers tried to trick in case of time complexities even if you gave the best one. So try to be confident.
- Q1.
Buy and Sell Stock Problem Statement
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...
- Ans.
The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.
Iterate through the array of stock prices and calculate the maximum profit that can be achieved by buying and selling at different points.
Keep track of the maximum profit after the first transaction and the maximum profit after the second transaction.
Return the sum of these t...
- Q2.
Stock Investment Problem Statement
You are given the prices of a particular stock over 'N' consecutive days. Your task is to find the maximum profit that can be obtained by completing at most two transact...
- Ans.
Find the maximum profit that can be obtained by completing at most two transactions of buying and selling a stock.
Iterate through the array of stock prices and calculate the maximum profit that can be obtained by completing at most two transactions.
Keep track of the maximum profit that can be obtained by selling the stock on each day after buying it on a previous day.
Consider all possible combinations of two transactio...
(1 Question)
Round duration - 30 minutes
Round difficulty - Easy
This was a Telephonic Round (Audio Call). The HR was friendly and asked basic questions.
The timing was 2:00 PM to 2:30 PM.
- Q1.
Rabbit Jumping Problem
Consider 'n' carrots numbered from 1 to 'n' and 'k' rabbits. Each rabbit jumps to carrots only at multiples of its respective jumping factor Aj (i.e., Aj, 2Aj, 3Aj, ...), for all ra...
- Ans.
Calculate uneaten carrots by rabbits with specific jumping factors.
Iterate through each carrot and check if any rabbit jumps on it.
Use the jumping factors to determine which carrots will be eaten.
Subtract the eaten carrots from the total to get the uneaten carrots.
Interview Preparation Tips
Tip 1 : Make sure that you are thorough with CS concepts beforehand.
Tip 2 : Even when you are explaining the approach to a question, try to parallelly think about how you would code it.
Tip 3 : Read the previous interview experiences. It would give a fair idea of the kind of questions one should expect.
Tip 4 : For a company like DE Shaw, practicing medium and hard difficulty level coding questions would be the way to go.
Tip 5 : Practice atleast 200 questions from coding platforms like CodeZen, LeetCode, Interviewbit as they contain common interview questions.
Tip 1 : Mention atleast 1 project and past work experience as it sets good impression.
Tip 2 : Keep your resume up to date for the role you are applying.
Tip 3 : Try to keep your resume of 1 Page.
Skills evaluated in this interview
Tell us how to improve this page.
Interview Questions for Popular Designations
Interview Questions from Similar Companies
AD3I Systems Reviews and Ratings
based on 3 reviews
Rating in categories
|
Senior Software Developer
5
salaries
|  ₹0 L/yr - ₹0 L/yr |
Bajaj Finserv
HDFC Life
PolicyBazaar
L&T Finance
- Home >
- Interviews >
- AD3I Systems Interview Questions
