Filter interviews by
I applied via Company Website and was interviewed before Apr 2022. There were 5 interview rounds.
Pointer and linked list
Pure technical on kernel programming
Multi-threaded programming can be achieved by creating multiple threads that run concurrently.
Identify the tasks that can be executed in parallel
Create threads using threading libraries in the chosen programming language
Synchronize the threads to avoid race conditions and deadlocks
Use locks, semaphores, and mutexes to manage shared resources
Optimize the performance by balancing the workload among threads
I applied via Referral and was interviewed before Oct 2022. There were 3 interview rounds.
A module in Python is a file containing Python code, which can define functions, classes, and variables.
Modules help organize Python code into reusable components
Modules can be imported into other Python scripts using the 'import' keyword
Examples of modules in Python include math, random, and os
I applied via Recruitment Consulltant and was interviewed in Sep 2023. There were 2 interview rounds.
1 easy, 1 medium and 1 hard LC
To access files in a different server, use protocols like FTP or SSH. To identify similar key value pairs in multiple files, compare values using a script or tool.
Use FTP or SSH protocols to access files in a different server
Write a script or use a tool to compare key value pairs in multiple files
Identify values that are the same and different across files
Example: Use Python script to read files and compare key value p
posted on 24 Jun 2024
posted on 15 Jul 2024
To add two linked lists, iterate through both lists simultaneously and add corresponding nodes, considering carry from previous addition.
Create a dummy node to hold the result.
Initialize current node to dummy node.
Iterate through both lists, adding values and carry from previous addition.
Move to next nodes in both lists.
Handle cases where one list is longer than the other.
Handle final carry if present.
Use Dijkstra's algorithm to find the shortest path in a graph
Implement Dijkstra's algorithm to find the shortest path between two nodes in a graph
Maintain a priority queue to keep track of the shortest distance to each node
Update the shortest distance to each node as you traverse the graph
Track the path by storing the previous node for each node visited
Check if a binary tree is a Binary Search Tree (BST)
Perform an in-order traversal of the tree and check if the resulting array is sorted
Keep track of the previous node value during traversal to compare with the current node value
Ensure that each node's value is greater than the previous node's value in the in-order traversal
Check if a substring in an array of strings is a palindrome or not.
Iterate through each string in the array
For each string, check if any of its substrings are palindromes
Return true if a palindrome substring is found, false otherwise
posted on 14 Aug 2024
I applied via Naukri.com and was interviewed in Feb 2024. There was 1 interview round.
Reverse a linked list recursively
Create a recursive function to reverse the linked list
Pass the current node and its next node as parameters
Update the next pointer of the current node to point to the previous node
Check if two stacks are equal by comparing each element in the stacks
Pop elements from both stacks and compare them one by one
If the sizes of the stacks are different, they are not equal
If any element in the stacks is different, they are not equal
Major questions were around problem solving, strings
posted on 7 Jun 2024
I applied via Naukri.com and was interviewed in Dec 2023. There were 3 interview rounds.
Here they asked lots of logical reasoning questions and checked on how you approached different situations
posted on 18 Feb 2022
I applied via Company Website and was interviewed in Jan 2022. There was 1 interview round.
A stack is a linear data structure that follows the Last In First Out (LIFO) principle.
Implement using an array or linked list
Push operation adds element to top of stack
Pop operation removes element from top of stack
Peek operation returns top element without removing it
To find intersection of two linked lists, traverse both lists and compare each node.
Traverse both linked lists and compare each node
Use two pointers, one for each linked list
If a node is common, return the node
If both pointers reach the end, return null
posted on 21 Dec 2021
I applied via LinkedIn and was interviewed in Nov 2021. There were 3 interview rounds.
Hashmap is a data structure that stores key-value pairs and allows constant time access to values.
Hashmap uses a hash function to map keys to indices in an array.
Collisions can occur when multiple keys map to the same index, which can be resolved using techniques like chaining or open addressing.
Hashmap operations like insertion, deletion, and lookup have an average time complexity of O(1).
based on 2 interviews
Interview experience
based on 1 review
Rating in categories
Design Engineer
30
salaries
| ₹10.1 L/yr - ₹18 L/yr |
Senior Software Engineer
28
salaries
| ₹9.7 L/yr - ₹42 L/yr |
Software Engineer
25
salaries
| ₹5.6 L/yr - ₹20.5 L/yr |
Product Application Engineer
16
salaries
| ₹4 L/yr - ₹15 L/yr |
Senior Software Engineer 2
14
salaries
| ₹28.9 L/yr - ₹44 L/yr |
Qualcomm
Intel
TDK India Private Limited
Molex