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
Top trending discussions
Redirection in Java is the process of forwarding a request from one URL to another URL.
Redirection is achieved using the HttpServletResponse.sendRedirect() method.
It is commonly used for handling authentication and authorization.
Redirection can be permanent or temporary, depending on the HTTP status code used.
Examples of HTTP status codes used for redirection are 301, 302, and 307.
posted on 26 Nov 2020
I applied via Naukri.com and was interviewed in May 2020. There were 7 interview rounds.
posted on 21 Feb 2025
I applied via Naukri.com and was interviewed in Jun 2022. There were 9 interview rounds.
Data structures and algorithms
Problem were from leetcode and geek for geeks.
Coding round , questions from leetcode
Situation based questions and thought process
posted on 24 Jun 2024
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).
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
based on 2 interviews
Interview experience
based on 1 review
Rating in categories
Design Engineer
30
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Application Engineer
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer 2
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Intel
Nvidia
Advanced Micro Devices
Analog Devices