Filter interviews by
I applied via gfg and was interviewed before Dec 2022. There were 3 interview rounds.
3 medium DSA problems
I was interviewed before Dec 2020.
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round. The interviewer asked me some programming based questions and some questions on database management systems.
Given an array ARR
of size N
, your objective is to determine the sum of the largest and smallest elements within the array.
Can you achie...
Find the sum of the largest and smallest elements in an array with the least number of comparisons.
Iterate through the array to find the maximum and minimum elements.
Keep track of the maximum and minimum elements as you iterate.
After iterating, sum up the maximum and minimum elements.
To achieve the task with the least number of comparisons, compare elements in pairs.
Construct a binary tree from a given array called parent
where the parent-child relationship is determined by (PARENT[i], i), indicating that the parent of node ...
Construct a binary tree from a given parent array and perform level-order traversal.
Iterate through the parent array to create the binary tree using a queue data structure.
Keep track of the parent-child relationships and construct the tree accordingly.
Perform level-order traversal to print the nodes in the correct order.
Yes, a unique key can also be a primary key.
A primary key must be unique, but a unique key does not necessarily have to be the primary key.
A table can have multiple unique keys, but only one primary key.
Example: In a table of employees, the employee ID can be a unique key and also the primary key.
Normalized form is better for database design for data integrity and flexibility.
Normalized form reduces data redundancy and improves data integrity.
Normalized form allows for easier data updates and maintenance.
Denormalized form may be more efficient for read-heavy applications with complex queries.
Consider denormalization for performance optimization after thorough analysis.
Example: Normalized form for a customer and...
Round duration - 60 minutes
Round difficulty - Medium
The interviewer had good work experience. She was polite and calm. After brief introduction she straight jumped into my current projects and she covered my entire CV.
Round duration - 45 minutes
Round difficulty - Easy
This was a technical round involving questions on OOPS concepts and puzzles.
There are 204 squares on a chessboard.
The chessboard has 64 squares in total.
Each square can be divided into smaller squares, such as 1x1, 2x2, 3x3, etc.
The total number of squares can be calculated by adding the squares of all sizes together.
C++ is a high-level programming language known for its efficiency, flexibility, and performance.
C++ is an object-oriented language with features like classes, inheritance, and polymorphism.
It allows low-level memory manipulation through pointers.
C++ is used in developing system software, game engines, and high-performance applications.
Deep copy creates a new copy of an object with all nested objects also copied, while shallow copy creates a new copy of an object with references to nested objects.
Deep copy creates a new object and recursively copies all nested objects, resulting in a completely independent copy.
Shallow copy creates a new object but only copies references to nested objects, so changes in nested objects will reflect in both the origina...
Template classes are classes that can work with any data type. Assignment operator can be overloaded to behave differently for different data types.
Template classes allow for writing generic classes that can work with any data type.
Overloading the assignment operator allows for custom behavior based on the data type.
Example: template <class T> class MyClass { T data; public: MyClass& operator=(const T& ot...
Round duration - 30 minutes
Round difficulty - Easy
This was a 30 minute HR round. The interviewer asked me a number of questions to know more about me.
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.
I applied via Naukri.com and was interviewed before Sep 2020. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
It was easy. Only basic questions were asked.
Developed a web-based inventory management system for a retail company
Used HTML, CSS, and JavaScript for front-end development
Utilized PHP and MySQL for back-end development
Implemented features such as product tracking, order processing, and reporting
Collaborated with team members to ensure project completion within deadline
Improving a website involves optimizing performance, enhancing user experience, and updating content regularly.
Optimize website speed by compressing images and minifying code
Enhance user experience by improving navigation and adding interactive features
Update content regularly to keep information fresh and relevant
I was interviewed in Apr 2022.
Round duration - 60 minutes
Round difficulty - Medium
This round had 2 questions with Easy to Medium level of difficulty
You are given two rectangles situated on a 2-D coordinate plane, which may overlap. Your task is to compute the total area covered by these rectangles.
Calculate total area covered by two overlapping rectangles on a 2-D plane.
Calculate the area of each rectangle separately using the given coordinates.
Find the overlapping region by determining the intersection of the two rectangles.
Calculate the area of the overlapping region by multiplying its width and height.
Add the areas of the two rectangles and subtract the area of the overlapping region to get the total area cov
Given an array ARR
consisting of N
integers, rearrange the elements such that all negative numbers are located before all positive numbers. The orde...
Yes, this can be achieved by using a two-pointer approach to rearrange the array with negative numbers at the beginning.
Use two pointers, one starting from the beginning and one from the end of the array.
Swap elements at the two pointers if one is negative and the other is positive, and move the pointers accordingly.
Continue this process until the two pointers meet in the middle of the array.
The resulting array will ha...
Round duration - 70 minutes
Round difficulty - Medium
Standard DS/Algo round with 2 questions
Given the head node of a singly linked list, return a pointer to the middle node of the linked list. If there are an odd number of nodes, return the middle o...
Return the middle node of a singly linked list, considering odd and even number of nodes.
Traverse the linked list with two pointers, one moving at twice the speed of the other
When the faster pointer reaches the end, the slower pointer will be at the middle node
Handle cases for odd and even number of nodes separately
Return null if the list is empty
Given a positive integer N
, your task is to return all the prime numbers less than or equal to N
.
1) A prime number is a number that has only two factors:...
Return all prime numbers less than or equal to a given positive integer N.
Iterate from 2 to N and check if each number is prime using a helper function.
A number is prime if it is not divisible by any number from 2 to its square root.
Store and return the prime numbers in an array in increasing order.
Round duration - 30 minutes
Round difficulty - Easy
This was a Technical Cum HR round where I was first asked some basic Java-related concepts and then we discussed my expectations from the company, learnings and growth in the forthcoming years. I would suggest be honest and try to communicate your thoughts properly in these types of rounds to maximise your chances of getting selected.
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 : Resume should be informative but not more than two pages
Tip 2 : Provide the links of all your achievements, projects and certificates in your resume
I applied via Job Fair and was interviewed before Mar 2022. There were 11 interview rounds.
Screening of profile based on prior experience
Develop the process for cyberdefense
Group discussion with Manager and VP
Explain the profile and develop the cases that you have proposed for clearing this interview
Discussion on assignments that has been solved till now
I applied via Referral and was interviewed in Jul 2023. There were 4 interview rounds.
Platform - Hackerrank
time- 90 minutes
2 dsa questions
output- got link for technical interview same day
Longest common subsequence is the longest sequence of characters that appear in the same order in both strings.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of longest common subsequences.
Iterate through the strings and fill the array based on the characters' matches.
Trace back the array to find the actual longest common subsequence.
I was interviewed before Dec 2020.
Round duration - 60 minutes
Round difficulty - Easy
This was a 60 minute technical round involving questions based on data structures, OOPS concepts, DBMS and projects that I had mentioned in my resume.
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using recursion or dynamic programming.
Implement a recursive function to calculate the Nth Fibonacci number.
Use memoization to store previously calculated Fibonacci numbers for efficiency.
Consider using dynamic programming to optimize the solution.
Handle edge cases such as N = 1 or N = 2 separately.
Ensure the solution works efficiently for large values of N (up to 10000).
Operator overloading in OOP allows custom behavior for operators like +, -, *, etc.
Operator overloading is a feature in OOP that allows defining custom behavior for operators
Example: Overloading the + operator to concatenate strings or add two numbers
Example: Overloading the * operator to perform matrix multiplication
Function overloading is when multiple functions have the same name but different parameters or return types.
Allows multiple functions with the same name but different parameters or return types
Helps improve code readability and maintainability
Example: int add(int a, int b) and float add(float a, float b)
C is a procedural programming language while C++ is a multi-paradigm programming language with object-oriented features.
C is a procedural programming language while C++ supports both procedural and object-oriented programming.
C does not support classes and objects while C++ does.
C does not have built-in support for exception handling while C++ does.
C does not have namespaces while C++ does.
C does not have function over
Round duration - 45 minutes
Round difficulty - Easy
HR round that lasted for 45 minutes. Did brainstorming on puzzles and HR asked questions to know more about me.
Tips : During HR, think before you speak, they can catch any word that you speak. Prepare well for aptitude, as they shortlist less people after the test. Ask good questions during the end of the interviews. It might impress them. So prepare for it before going for the interview. Lastly, don’t be nervous, HRs are only trying to make you nervous during the interview as a part of the stress test.
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.
I was interviewed before Dec 2020.
Round duration - 60 minutes
Round difficulty - Medium
This was a 60 minute technical round where the interviewer asked programming based questions and questions on DBMS concepts.
Given an array of 'N' non-negative integers and an integer 'K', your task is to find the maximum elements for each subarray of size 'K'.
The first line contains...
Find the maximum elements for each subarray of size 'K' in an array of non-negative integers.
Iterate through the array and maintain a deque to store the indices of elements in decreasing order.
Pop elements from the deque if they are out of the current window of size 'K'.
The front of the deque will always have the index of the maximum element in the current window.
ACID properties are a set of properties that guarantee the reliability of transactions in database management systems.
Atomicity ensures that either all operations in a transaction are completed successfully or none of them are. For example, transferring money from one account to another should either be completed in full or not at all.
Consistency ensures that the database remains in a consistent state before and after ...
Write-ahead logging is a technique used in DBMS to ensure that changes are recorded in the log before they are applied to the database.
Write-ahead logging ensures that changes are first written to the log file before being applied to the database to maintain data integrity.
It helps in recovering the database in case of a system crash or failure by replaying the log entries to bring the database back to a consistent sta...
Deadlock avoidance schemes are strategies used to prevent deadlocks in a system.
Banker's algorithm: Ensures that the system will never enter an unsafe state by keeping track of available resources and only granting a request if it does not lead to a deadlock.
Wait-die and Wound-wait: Two deadlock prevention schemes used in transaction processing systems to avoid deadlocks by allowing transactions to wait or abort based ...
A clustered index is a type of index that sorts and stores the data rows in the table based on their key values.
Defines the order in which data is physically stored in a table
Only one clustered index per table
Helps in improving the performance of queries that involve range searches or sorting
Example: Clustered index on a table's primary key
Round duration - 60 minutes
Round difficulty - Easy
This was a 60 minute technical round where the interviewer asked data structure based questions, questions on OOPS and OS concepts.
A virtual function in C++ is a function that is declared within a base class and is redefined by a derived class.
Virtual functions allow a function to be overridden in a derived class.
They are used in polymorphism to achieve runtime binding.
The base class function must be declared as virtual for dynamic binding to occur.
Example: virtual void display() = 0; // pure virtual function
malloc() is used to dynamically allocate memory in C, while free() is used to release allocated memory.
malloc() allocates a block of memory of specified size and returns a pointer to the beginning of the block.
free() deallocates the memory previously allocated by malloc() or calloc().
Example: int *ptr = (int*)malloc(5 * sizeof(int)); // Allocates memory for 5 integers
Example: free(ptr); // Deallocates the memory alloca
Structure padding is the concept of adding empty bytes to a structure to align its data members on memory boundaries.
Structure padding is done to optimize memory access and improve performance.
Padding is necessary because most processors require data to be aligned on specific memory boundaries for efficient access.
For example, if a structure contains a char followed by an int, padding may be added after the char to ali
Round duration - 30 minutes
Round difficulty - Easy
HR based round that lasted for 30 minutes. The interviewer asked question to know more about me.
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.
I was interviewed before Dec 2020.
Round duration - 90 minutes
Round difficulty - Easy
Online test had 6 parts-psychometric test, aptitude, logical, English, computer skills and 2 coding questions. Time given to us was 90 minutes. Paper was quite lengthy and of average difficulty level. I was able to complete all the sections, but only one coding question.
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from the end to the beginning and append each character to a new string.
Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.
Handle special characters and numbers while reversing the string.
Ensure to consider the constraints provided in the problem statement.
T...
Round duration - 60 minutes
Round difficulty - Medium
Firstly the interviewer asked me to introduce myself after he introduced himself. Since i went there as experienced guy he asked me about my workings in the current company. After that,he asked some programming questions, tested my concepts of DBMS and OOPS, and some puzzles.
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
BFS traversal in a disconnected graph starting from vertex 0.
Implement BFS algorithm to traverse the graph starting from vertex 0.
Explore neighbor nodes first before moving to the next level neighbors.
Consider the bidirectional nature of edges in an undirected graph.
Output the BFS traversal sequence for each test case in a separate line.
Given a positive integer N
, your task is to identify all prime numbers less than or equal to N
.
A prime number is a natural number greater than 1 that has no po...
Identify all prime numbers less than or equal to a given positive integer N.
Iterate from 2 to N and check if each number is prime
Use the Sieve of Eratosthenes algorithm for efficient prime number identification
Optimize by only checking up to the square root of N for divisors
BCNF is a normal form in database management systems that ensures all determinants are candidate keys.
BCNF stands for Boyce-Codd Normal Form.
It is a stricter version of 3NF (Third Normal Form).
In BCNF, every determinant must be a candidate key.
It helps in reducing redundancy and anomalies in the database.
Example: If a table has columns A, B, and C, and A determines B and B determines C, then it is not in BCNF unless A
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.
C does not have features like inheritance an...
Round duration - 60 minutes
Round difficulty - Easy
Again 2nd round started with an introduction from both sides. Then he started asking questions from resume itself. Working in the current company and all the projects that i have done. Few simple puzzles, OOPs concepts (with proper explanation and coding) and some database related questions(questions were easy you just need to brush up the basics). Some keywords related questions from C,C++,Java(usual questions like static ,final, abstract etc.). That was the 2nd round. Then I was called for the 3rd Round. Before 3rd round they also served tasty lunch.
Given a binary tree of integers, your task is to output the right view of the tree.
The right view of a binary tree includes the nodes that are visible when the tree is observed...
The task is to output the right view of a binary tree, which includes the nodes visible when observed from the right.
Traverse the tree level by level and keep track of the rightmost node at each level.
Use a queue for level order traversal and a map to store the rightmost nodes.
Print the values of the rightmost nodes stored in the map as the right view of the tree.
Round duration - 45 minutes
Round difficulty - Easy
After that he asked me what I knew about SAP and there products(Please do read all about SAP and there products-not all but at least some famous products like ERP). Then he asked me one puzzle.
Round duration - 45 minutes
Round difficulty - Easy
The round started with our Introduction to each other. After that interviewer asked me whether I do online shopping or not. I said yes then he asked me to design the online shopping portal using ER-Diagram . Then he asked me to create all the tables and populate it with data. Later on he asked me to normalize it. After all of this he asked me some simple puzzles and current salary and notice period. That was the 4th round.
After that I was asked to attend the final round and before 5th round they served snacks and tea to all of us.
Yes, I can design an ER diagram for an online shopping portal.
Entities: User, Product, Order, Payment, Cart
Relationships: User places Order, Order contains Product, Payment for Order, User has Cart
Attributes: User (id, name, email), Product (id, name, price), Order (id, date), Payment (id, amount)
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.
based on 1 interview
Interview experience
Senior Recruitment Associate
221
salaries
| ₹0 L/yr - ₹0 L/yr |
Recruitment Associate
178
salaries
| ₹0 L/yr - ₹0 L/yr |
Recruitment Specialist
126
salaries
| ₹0 L/yr - ₹0 L/yr |
Payroll Specialist
94
salaries
| ₹0 L/yr - ₹0 L/yr |
Principal Consultant
72
salaries
| ₹0 L/yr - ₹0 L/yr |
Darwinbox
SAP
Ramco Systems
greytHR