Filter interviews by
I applied via Campus Placement and was interviewed before Feb 2023. There was 1 interview round.
Bit-wise operations are operations performed on individual bits of binary numbers.
Bit-wise operations manipulate individual bits of binary numbers.
Common bit-wise operations include AND, OR, XOR, and NOT.
Bit shifting is another common bit-wise operation.
Bit-wise operations are often used for low-level programming and optimization.
Example: 5 & 3 = 1 (bit-wise AND of 101 and 011 is 001).
To find a loop in a linked list, we can use the Floyd's cycle-finding algorithm.
Use two pointers, one moving at twice the speed of the other.
If there is a loop, the fast pointer will eventually catch up to the slow pointer.
If the fast pointer reaches the end of the list, there is no loop.
I applied via Naukri.com and was interviewed in Apr 2024. There was 1 interview round.
Count frequency of elements in array of strings
Iterate through the array and use a hashmap to store the frequency of each element
Use a for loop to go through each element and update the count in the hashmap
Return the hashmap with element frequencies
I applied via Naukri.com and was interviewed before May 2023. There were 2 interview rounds.
There is no one-size-fits-all answer as the best sorting algorithm depends on the specific use case and constraints.
The best sorting algorithm depends on factors such as the size of the data set, the range of values, whether the data is mostly already sorted or not, and the available memory.
For small data sets or nearly sorted data, insertion sort or bubble sort may be efficient.
For large data sets, quicksort, mergesor...
Write a program to print the permutations of abc
posted on 22 Feb 2024
I applied via Referral and was interviewed before Feb 2023. There was 1 interview round.
Merge two sorted linked lists without using extra space
Use a dummy node to start the merged list
Compare the values of the nodes in both lists and link the smaller one to the merged list
Move the pointer of the merged list and the pointer of the smaller node to the next node
posted on 27 Feb 2023
I applied via Recruitment Consulltant and was interviewed in Aug 2022. There were 3 interview rounds.
Basic aptitude, c and data structures
posted on 7 Jun 2024
I applied via Walk-in and was interviewed in May 2024. There was 1 interview round.
Distance between two stations
I applied via Approached by Company and was interviewed before Apr 2022. There were 2 interview rounds.
Basic programming and Algorithms. data structures theory and implementation
based on 2 interviews
Interview experience
based on 3 reviews
Rating in categories
Software Engineer
334
salaries
| ₹0 L/yr - ₹0 L/yr |
SOC Design Engineer
221
salaries
| ₹0 L/yr - ₹0 L/yr |
System Validation Engineer
197
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
160
salaries
| ₹0 L/yr - ₹0 L/yr |
Design Engineer
159
salaries
| ₹0 L/yr - ₹0 L/yr |
Qualcomm
Nvidia
Microsoft Corporation
Advanced Micro Devices