Filter interviews by
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 ...
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 acc...
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.
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 ...
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.
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.
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.
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 ...
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
Aragorn, an influential ruler, aspires to expand his power by conquering more kingdoms. There are 'N' kingdoms numbered from 0 to N-1, forming a tree structure...
Given a tree structure of kingdoms, determine if it's possible to conquer more kingdoms than Aragorn by strategically choosing the starting kingdom.
Start at the kingdom adjacent to Aragorn's initial kingdom
Choose the kingdom that allows you to capture the most number of kingdoms in subsequent turns
Consider the tree structure to plan your conquest strategically
I appeared for an interview in Mar 2022.
Round duration - 120 Minutes
Round difficulty - Hard
Online Test Platform - HackerRank
Test Access Window – between 10:00 AM to 6:00 PM
Online Test Pattern –
Total Duration of Test – 120 mins
Total No. of Sections - 5
Section 1 – One Coding Question - Easy difficulty (20 mins)
Section 2 – One Coding Question - Medium difficulty (30 mins)
Section 3 – One Coding Question - Medium difficulty (30 mins)
Section 4 - Technical MCQs - 10 questions (20 mins)
Section 5 - Aptitude MCQs - 10 questions (20 mins)
Programming Sections (1, 2 and 3): This will have 3 coding questions with a time limit of 80 minutes. It is mandatory for you to attempt the 1st coding question before moving to the second question and third. You cannot revisit question/section once you proceed ahead
MCQ Sections (4 and 5): This will have 10 technical and 10 aptitude questions, with a time limit of 20 minutes each. Each correct answer will carry 2 marks and wrong answer will carry negative 0.5
Technical questions will cover Data structures & algorithms, Operating systems, Database systems, SQL and Networks.
Aptitude questions will cover Quantitative Aptitude, Problem solving and Logical & verbal Reasoning
Given an array 'ARR' of 'N' cubes, you need to construct towers such that each cube can either be placed on top of an existing tower or start a new one. The restriction is...
The task is to determine the minimum number of towers needed to stack cubes in a specific order.
Iterate through the array of cubes and maintain a stack to keep track of towers.
For each cube, check if it can be placed on an existing tower or start a new one.
Update the stack based on the cube's size and count the number of towers needed.
Return the minimum number of towers required.
Example: For input N = 3, ARR = [3, 2, 1...
Given an array ARR
of size N
and an integer K
, determine the minimum number of elements that must be removed from the array so that the difference between the maximum an...
The problem involves finding the minimum number of elements to remove from an array so that the difference between the maximum and minimum element is less than or equal to a given value.
Iterate through the array and keep track of the minimum and maximum elements.
Calculate the difference between the maximum and minimum elements.
If the difference is greater than the given value, increment the count of elements to remove.
...
Aragorn, an influential ruler, aspires to expand his power by conquering more kingdoms. There are 'N' kingdoms numbered from 0 to N-1, forming a tree structur...
Given a tree structure of kingdoms, determine if it's possible to conquer more kingdoms than Aragorn by strategically choosing the starting kingdom.
Start at the kingdom adjacent to Aragorn's initial kingdom
Choose the kingdom that allows you to capture the most number of kingdoms in subsequent turns
Consider the tree structure to plan your conquest strategically
Round duration - 60 Minutes
Round difficulty - Medium
They called and asked me to choose a date and time I would be free in the upcoming week for my interview.
I chose 10th March 5 pm.
Interviewer was pretty friendly. Started with some resume based questions. Asked me OS, DBMS and JAVA based questions. A coding question was asked to code. Asked me OOPS related questions too.
Given an integer array ARR
and an integer K
, identify the K
most frequent elements within ARR
. Return these elements sorted in ascending order.
Identify K most frequent elements in an array and return them sorted in ascending order.
Use a hashmap to store the frequency of each element in the array.
Sort the elements based on their frequency in descending order.
Return the first K elements from the sorted list.
Tip 1 : Learn the OS and DBMS fundamentals.
Tip 2 : Practice a wide variety of questions on Leetcode
Tip 3 : Do practice aptitude. It will help in OA
Tip 1 : Use OverLeaf format to make resume
Tip 2 : Do not mention any skill you aren't comfortable with. A lot of the times they ask you questions based on what is written in your resume.
I appeared for an interview in Nov 2020.
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).
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...
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.
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...
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.
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
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...
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.
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...
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...
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.
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 ...
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...
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...
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...
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.
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...
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.
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.
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...
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
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...
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...
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...
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...
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.
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.
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...
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...
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...
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...
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.
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 ...
Top trending discussions
I appeared for an interview in Aug 2016.
I appeared for an interview in Aug 2017.
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development
Passionate about coding and problem-solving
Strong communication and teamwork skills
Always eager to learn and adapt to new technologies
I applied via Naukri.com and was interviewed in May 2019. There was 1 interview round.
MVC separates data flow into three components: Model, View, and Controller.
Model represents data and business logic
View displays data to the user
Controller handles user input and updates the model and view accordingly
Data flows from the model to the view through the controller
Changes in the view are communicated to the controller, which updates the model and view
MVC stands for Model-View-Controller. It is a software design pattern that separates an application into three interconnected components.
Model: Represents the data and business logic of the application
View: Displays the data to the user and handles user input
Controller: Acts as an intermediary between the Model and View, handling user input and updating the Model and View accordingly
I applied via Naukri.com and was interviewed before May 2020. There were 5 interview rounds.
I appeared for an interview in Jan 2021.
A C# program to demonstrate basic concepts like variables, loops, and conditionals.
Use 'int' for integers: int number = 5;
Implement loops: for (int i = 0; i < 5; i++) { Console.WriteLine(i); }
Use conditionals: if (number > 0) { Console.WriteLine('Positive'); }
I applied via Naukri.com and was interviewed in Apr 2020. There were 5 interview rounds.
posted on 7 Apr 2021
based on 5 reviews
Rating in categories
Analyst
202
salaries
| ₹15.6 L/yr - ₹28 L/yr |
Senior Analyst
130
salaries
| ₹20 L/yr - ₹36 L/yr |
Manager
74
salaries
| ₹28.5 L/yr - ₹48.9 L/yr |
Associate
68
salaries
| ₹12.8 L/yr - ₹21 L/yr |
Project Lead
58
salaries
| ₹44.4 L/yr - ₹79.1 L/yr |
Thomson Reuters
HighRadius
Chetu
EbixCash Limited