Filter interviews by
Clear (1)
Top trending discussions
I was interviewed before May 2016.
I was interviewed in Sep 2016.
I applied via Campus Placement
A program is a set of instructions that tells a computer what to do. A task is a unit of work performed by a program. A thread is a sequence of instructions within a task.
A program is a collection of instructions that are executed by a computer to perform a specific task.
A task is a unit of work that is performed by a program. It can be a specific action or a set of actions.
A thread is a sequence of instructions within...
To delete a node in a linked list, we need to adjust the pointers of the previous and next nodes.
Find the node to be deleted by traversing the linked list
Adjust the pointers of the previous and next nodes to skip the node to be deleted
Free the memory occupied by the node to be deleted
A function pointer is a variable that stores the address of a function. Volatile type is used to declare variables that can be modified by external factors.
Function pointers are used to pass functions as arguments to other functions.
Volatile type is used when a variable's value can be changed unexpectedly by external factors.
Function pointers can be used to implement callbacks or event handling mechanisms.
Volatile type...
Experienced software developer with expertise in Java, Python, and SQL
Proficient in Java, Python, and SQL programming languages
Developed web applications using Java Spring framework
Experience with database management and optimization using SQL
Worked on various software projects in a team environment
Swap even and odd bits in a given number
Create a mask for even bits and odd bits
Shift even bits to right and odd bits to left
Combine even and odd bits using bitwise OR operator
I applied via Campus Placement and was interviewed in Feb 2024. There were 2 interview rounds.
Logical questions were asked in round one
Linkedlist questions
Invert the bits of a given number
Use bitwise XOR operator (^) with 1 to flip each bit
Repeat the process for all bits in the number
Return the inverted number
Backward compatibility can be supported by using versioning, deprecation strategies, and maintaining clear communication with users.
Use versioning to clearly distinguish between different versions of the system
Implement deprecation strategies to phase out old features gradually
Maintain clear communication with users about upcoming changes and provide migration paths
Consider using compatibility layers or adapters to bri...
I was interviewed before Oct 2020.
Round duration - 60 minutes
Round difficulty - Medium
This round had 2 coding problems and we had to code it on hackerearth only.
The use of Outside IDE was forbidden.
The timing of test was 12:00 PM to 1:00 PM.
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...
Merge overlapping intervals and return sorted list of merged intervals.
Iterate through intervals and merge overlapping ones
Sort merged intervals based on starting times
Handle edge cases like empty input or single interval
Use a data structure like list or array to store merged intervals
Given a rotated sorted array ARR
of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.
1. If 'K' is not present...
Given a rotated sorted array, find the index of a given integer 'K'.
Use binary search to find the pivot point where the array is rotated.
Based on the pivot point, perform binary search on the appropriate half of the array to find 'K'.
Handle cases where 'K' is not present in the array by returning -1.
Round duration - 60 minutes
Round difficulty - Medium
This was an Online F2F Technical Round conducted on CodePair : Hackerearth. So, Basically You have to Run and Submit ( Pass All Test cases) in the Interview Round also (Like normal Coding Test) in Hackerearth & 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 - 11:00 A.M to 12:00 P.M
In this problem, you have a one-dimensional garden of length 'N'. Each position from 0 to 'N' has a fountain that can provide water to the garden up to a certain range...
Find the minimum number of fountains to activate to water the entire garden.
Iterate through the array to find the coverage of each fountain.
Keep track of the farthest coverage reached by activating fountains.
Activate the fountain that covers the farthest point not yet covered.
Repeat until the entire garden is watered.
Given a directed weighted graph comprised of vertices labeled 1 to N and M edges, where each edge connects two nodes u and v with a weight w representing the distance be...
Bellman Ford algorithm is used to find the shortest path in a graph with negative weights.
Initialize distances from source to all vertices as infinity, and distance to source as 0.
Relax all edges V-1 times to find shortest path.
If any distance is updated in Vth iteration, then there is a negative weight cycle.
Return the distance to destination vertex after V-1 iterations.
Example: For the given graph, shortest path from
Round duration - 30 minutes
Round difficulty - Easy
This was a Google Meet Video Call. The HR was friendly and asked basic questions.
The timing was 2:00 PM to 2:30 PM.
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 : 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.
I applied via Naukri.com and was interviewed in Mar 2022. There was 1 interview round.
Software Engineer
135
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
127
salaries
| ₹0 L/yr - ₹0 L/yr |
Accountant
119
salaries
| ₹0 L/yr - ₹0 L/yr |
Principal Software Engineer
50
salaries
| ₹0 L/yr - ₹0 L/yr |
Test Engineer
48
salaries
| ₹0 L/yr - ₹0 L/yr |
D E C
Fedder And Garten
Hi Technologies Limited, UAB
JK Khanna & Co.