Filter interviews by
Hackerrank algorithms and ds test
I applied via Referral and was interviewed before Jan 2023. There were 3 interview rounds.
Logical Reasoning, Questions on distances, Questions on directions
1- Difference between array list and linked list.
2- Reverse the linked list
1-Difference between Arraylist and Linked list.
2-Check if strings are anagram.
I was interviewed before Apr 2021.
Round duration - 90 minutes
Round difficulty - Easy
It was on online objective test consisting of 4 sections: Aptitude, Technical MCQs, Code snippet based MCQs and Coding part.
The first line contains an Integer &...
A stack can be used to solve this question.
We traverse the given string s and if we:
1. see open bracket we put it to stack
2. see closed bracket, then it must be equal to bracket in the top of our stack, so we check it and if it is true, we remove this pair of brackets.
3. In the end, if and only if we have empty stack, we have valid string.
Complexity: time complexity is O(n): we put and pop each element of string ...
The ...
A simple approach could be to use a stack. Traverse the given list and push all the nodes to a stack. Now, Traverse the list again. For every visited node, pop the topmost node from the stack and compare data of popped node with the currently visited node. If all nodes match, then the linked list is a palindrome.
Time Complexity : O(N)
Auxiliary Space : O(N)
A better approach would be to reverse the second hal...
Round duration - 60 minutes
Round difficulty - Easy
This was a technical and managerial round. The interviewer gave me a situation where I am in testing team and I found that customer requirement was drop down list at a place but developer has used bullet selection, and is not ready to change it. How will you manage? I gave some good replies and he was convinced.
There are 25 horses among which you need to find out the fastest 3 horses. You can conduct race among at most 5 to find out their relative speed. At no point you can find out the actual speed of the ...
Make group of 5 horses and run 5 races. Suppose five groups are a,b,c,d,e and next alphabet is its individual rank in tis group(of 5 horses).for eg. d3 means horse in group d and has rank 3rd in his group. [ 5 RACES DONE ]
a1 b1 c1 d1 e1
a2 b2 c2 d2 e2
a3 b3 c3 d3 e3
a4 b4 c4 d4 e4
a5 b5 c5 d5 e5
Now make a race of (a1,b1,c1,d1,e1).[RACE 6 DONE] suppose result is a1>b1>c1>d1>e1...
What is a virtual function?
A C++ virtual function is a member function in the base class that you redefine in a derived class. It is declared using the virtual keyword. It is used to tell the compiler to perform dynamic linkage or late binding on the function. A 'virtual' is a keyword preceding the normal declaration of a function. When the function is made virtual, C++ determines which function is to be invoked at the runtime based on the type
Level order traversal in spiral form
To print the nodes in spiral order, nodes at different levels should be printed in alternating order. An additional Boolean variable ltr is used to change printing order of levels. If ltr is 1 then printGivenLevel() prints nodes from left to right else from right to left. Value of ltr is flipped in each iteration to change the order.
Function to print level order traversal of tree :
printSpiral(tree)
...
What are abstract classes in C++?
An abstract class in C++ is a class that has at least one pure virtual function (i.e., a function that has no definition). The classes inheriting the abstract class must provide a definition for the pure virtual function; otherwise, the subclass would become an abstract class itself. Abstract classes are essential to providing an abstraction to the code to make it reusable and extendable.
Round duration - 60 minutes
Round difficulty - Easy
This was also a technical round. He asked to optimize the code I wrote in coding round. Then he asked me a few puzzles and questions on OOPS, OS and DBMS.
Given two candles. Each of them burns for one hour. They burn unevenly in different parts though. In addition, let’s have a box of matches. Measure 45 minutes and 15 minutes.
Step1: Both ends of the first candle should be lit, but only one end of the second candle should be lit. After the first candle has burned fully in 30 minutes, the remaining time is 30 minutes to burn the other candle with one end unburned.
Step2: Now lit both the ends of the 30-min(remaining) length of candle 2, it will burn in 15 minutes. Now let’s have a look at the solution candle-wise.
Candle1: The first candle is l...
Explain the ACID properties.
Atomicity :
By this, we mean that either the entire transaction takes place at once or doesn’t happen at all. There is no midway i.e. transactions do not occur partially. Each transaction is considered as one unit and either runs to completion or is not executed at all. It involves the following two operations.
—Abort: If a transaction aborts, changes made to database are not visible.
—Commit: If a transaction...
What is Paging and Segmentation?
Paging is a method or techniques which is used for non-contiguous memory allocation. It is a fixed size partitioning theme (scheme). In paging, both main memory and secondary memory are divided into equal fixed size partitions. The partitions of secondary memory area unit and main memory area unit known as as pages and frames respectively.
Segmentation is another non-contiguous memory allocation scheme like paging. like...
What is concurrency control?
Concurrency Control: The process of managing the simultaneous execution of transactions in a shared database, is known as concurrency control. Basically, concurrency control ensures that correct results for concurrent operations are generated, while getting those results as quickly as possible.
Difference between String Buffer and String Builder
1. StringBuffer is synchronized i.e. thread safe. It means two threads can't call the methods of StringBuffer simultaneously. StringBuilder is non-synchronized i.e. not thread safe. It means two threads can call the methods of StringBuilder simultaneously.
2) StringBuffer is less efficient than StringBuilder. StringBuilder is more efficient than StringBuffer.
3) StringBuffer was introduced in Java 1.0. StringBuilde
What are smart pointers?
A Smart Pointer is a wrapper class over a pointer with an operator like * and -> overloaded. The objects of the smart pointer class look like normal pointers. But, unlike Normal Pointers it can deallocate and free destroyed object memory. The idea is to take a class with a pointer, destructor and overloaded operators like * and ->. Since the destructor is automatically called when an object goes out of scope, the...
A shop sells chocolates @ Re.1 each. You can exchange 3 wrappers for 1 chocolate. If you have Rs.15/- how many chocolates can you get totally?
For 15 rupees you get 15 chocolates.
On returning 15 wrappers you get 5 chocolates.
On returning 3 wrappers (keeping two wrappers in hand) you get 1 chocolate.
Now this one chocolate. wrapper and the twp wrapers you had will add on three.
Atlast on returning 3 wrappers you get 1 chocolate.
i.e., 15+5+1+1 = 22 chocolates.
Difference between Mutex and Semaphore
1. Mutex uses a locking mechanism i.e. if a process wants to use a resource then it locks the resource, uses it and then release it. But on the other hand, semaphore uses a signalling mechanism where wait() and signal() methods are used to show if a process is releasing a resource or taking a resource.
2. A mutex is an object but semaphore is an integer variable.
3. In semaphore, we have wait() and signal() functio...
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.
Program for snake traversal of binary tree
Use a stack to keep track of nodes to be visited
Start with the root node and push it onto the stack
While the stack is not empty, pop a node and print its value
If the level is even, push the left child first and then the right child onto the stack
If the level is odd, push the right child first and then the left child onto the stack
Code to check if linked list is palindrome without using any other data structure and in a single traversal.
Traverse the linked list using two pointers, one slow and one fast
Reverse the first half of the linked list while traversing
Compare the reversed first half with the second half of the linked list
Yodlee interview questions for designations
Top trending discussions
A good DSA question, based on array manipulation and queues. Platform was Zoom call, so you can use any online IDE.
posted on 2 Dec 2024
30 mins interview. Asked about resume, APIs, Stack DSA question and one Sorting algorithm question.
I applied via Naukri.com and was interviewed in Oct 2023. There were 2 interview rounds.
I applied via Job Portal and was interviewed in Mar 2024. There were 2 interview rounds.
Know your resume and your basics
Know class diagrams. Very Huge for workday.
based on 54 reviews
Rating in categories
Senior Software Engineer
250
salaries
| ₹7.3 L/yr - ₹22 L/yr |
Software Engineer
241
salaries
| ₹4.8 L/yr - ₹13 L/yr |
Member Technical Staff
129
salaries
| ₹11 L/yr - ₹30.1 L/yr |
Senior Member of Technical Staff
72
salaries
| ₹17.5 L/yr - ₹40 L/yr |
Data Analyst
47
salaries
| ₹3 L/yr - ₹9.5 L/yr |
Intuit
Mphasis
Nucleus Software Exports
Intellect Design Arena