Filter interviews by
I applied via Referral and was interviewed before May 2022. There were 4 interview rounds.
I applied via Walk-in and was interviewed in Jun 2024. There were 3 interview rounds.
Basics questions regarding java
Oops related question
I am currently working at XYZ Corporation as a Senior Analyst in the finance department.
XYZ Corporation
Senior Analyst
Finance department
I applied via Walk-in and was interviewed in Aug 2021. There was 1 interview round.
I applied via LinkedIn and was interviewed in Jun 2024. There were 3 interview rounds.
Two DSA questions related to Arrays & strings
Design a URL shortener service with features like shortening, redirecting, tracking, handling collisions, and providing analytics.
Use a hashing algorithm to generate unique short URLs from long URLs
Store mappings of short URLs to original URLs in a database
Implement a redirect mechanism to direct users to the original URL when accessing the short URL
Track the number of times each short URL is accessed and store this da...
I applied via Company Website and was interviewed before Oct 2023. There were 2 interview rounds.
Hiring assessment of total 75 minutes
I applied via Naukri.com and was interviewed in Jan 2021. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Nov 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Nov 2020. There was 1 interview round.
Insertion sort and quicksort are sorting algorithms used to sort arrays of data.
Insertion sort: iterates through the array and inserts each element into its proper position.
Quicksort: selects a pivot element and partitions the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot.
Insertion sort is best for small arrays, while quicksort is best for large arrays.
Bot...
Merge two sorted linked lists using recursion
Create a recursive function that compares the first nodes of both lists
Set the smaller node as the head of the merged list and call the function again with the next node of the smaller list
Base case: if one list is empty, return the other list
Return the merged list
Given an integer, determine which byte is zero.
Convert the integer to a byte array using bitwise operations.
Iterate through the byte array and check for a zero value.
Return the index of the zero byte.
Consider endianness when converting to byte array.
To check endianness, create a 4-byte integer with a known value and check the byte order.
Create a 4-byte integer with a known value
Check the value of the first byte to determine endianness
If the first byte is the least significant, the machine is little endian
If the first byte is the most significant, the machine is big endian
Static objects can be used to print something before main() execution.
Static objects are initialized before main() execution
They can be used to print something before main()
Example: static int x = printf("Hello World!");
Output: Hello World! will be printed before main() execution
Static variables are allocated memory in the data segment of the program's memory space.
Static variables have a fixed memory location throughout the program's execution.
They are initialized to zero by default.
If initialized explicitly, they are stored in the data segment.
Static variables can be accessed by any function in the program.
Finding space and time complexity of a recursive function.
Space complexity is the amount of memory used by the function.
Time complexity is the amount of time taken by the function to execute.
Recursive functions have higher space complexity due to the call stack.
Time complexity can be calculated using Big O notation.
Examples of recursive functions include factorial and Fibonacci sequence.
Diamond hierarchy problem is a problem in object-oriented programming where a class inherits from multiple classes in a diamond-shaped hierarchy.
Occurs when a class inherits from two classes that share a common base class
Can lead to ambiguity in method calls and data members
Solved using virtual inheritance or by using interfaces
To determine if a point is inside a polygon, use the ray casting algorithm.
Create a line from the point to a point outside the polygon
Count the number of times the line intersects with the polygon edges
If the count is odd, the point is inside the polygon; otherwise, it is outside
The four storage classes in C are auto, register, static, and extern.
Auto: default storage class for all local variables
Register: used to define local variables that should be stored in a register instead of RAM
Static: used to define local variables that retain their value between function calls
Extern: used to declare a global variable that is defined in another file
i is stored in global data segment, j is stored in stack, k is stored in heap.
i is a global variable and is stored in the global data segment
j is a local variable and is stored in the stack
k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()
Use a hash table to store the words and check for existence in constant time.
Create a hash table with the words as keys and a boolean value as the value.
For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.
Alternatively, use a set data structure to store only the unique words and check for existence in the set.
based on 1 interview
Interview experience
based on 12 reviews
Rating in categories
Lead Engineer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Support Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Test Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Citrix
VMware Software
Microsoft Corporation
Cisco