Upload Button Icon Add office photos

Applied Materials

Compare button icon Compare button icon Compare

Filter interviews by

Applied Materials SDE Interview Questions and Answers

Updated 10 Jun 2015

7 Interview questions

A SDE was asked
Q. Write a program to check if a tree is a BST.
Ans. 

Program to check if a binary tree is a BST

  • Traverse the tree in-order and check if the values are in ascending order

  • Use a min-max range for each node to check if it satisfies the BST property

  • Recursively check if the left and right subtrees are BSTs

A SDE was asked
Q. What is the difference between an array and a linked list?
Ans. 

Array is a collection of elements stored in contiguous memory locations while linked list is a collection of nodes linked by pointers.

  • Arrays have fixed size while linked lists can grow or shrink dynamically

  • Insertion and deletion is faster in linked lists than arrays

  • Accessing elements in arrays is faster than linked lists

  • Arrays are better for random access while linked lists are better for sequential access

SDE Interview Questions Asked at Other Companies

asked in Infosys
Q1. Return Subsets Sum to K Problem Statement Given an integer array ... read more
asked in Nagarro
Q2. Partition to K Equal Sum Subsets Problem Given an array of intege ... read more
asked in Nagarro
Q3. Sort a "K" Sorted Doubly Linked List Given a doubly-linked list w ... read more
asked in Amazon
Q4. Describe a scenario where you were given updates on repaired road ... read more
asked in Nagarro
Q5. Maximum Meetings Selection You are tasked with scheduling meeting ... read more
A SDE was asked
Q. What are some practical applications of a linked list?
Ans. 

A linked list is used to store and manipulate a collection of data elements in a linear order.

  • Linked lists are commonly used in computer science for implementing data structures like stacks, queues, and hash tables.

  • They are also used in operating systems for managing memory allocation.

  • For example, a linked list can be used to implement a music playlist where each song is a node and the links between nodes represen...

A SDE was asked
Q. What data structure would you use for a dictionary?
Ans. 

An array of key-value pairs is the best data structure for a dictionary.

  • Use a hash table or a balanced tree to implement the dictionary.

  • Keys should be unique and immutable.

  • Values can be any data type.

  • Access time should be O(1) or O(log n) depending on the implementation.

  • Examples: Python's dict, Java's HashMap, C++'s unordered_map.

A SDE was asked
Q. Implement a stack using a linked list.
Ans. 

Implement a stack using a linked list

  • Create a Node class with data and next pointer

  • Create a Stack class with top pointer

  • Push new nodes to the top of the stack

  • Pop nodes from the top of the stack

  • Check if the stack is empty before popping

A SDE was asked
Q. What is a BST?
Ans. 

BST stands for Binary Search Tree, a data structure used for efficient searching and sorting operations.

  • BST is a tree-like data structure where each node has at most two children.

  • The left child of a node contains a value less than the parent node, while the right child contains a value greater than the parent node.

  • BST allows for efficient searching and sorting operations with a time complexity of O(log n).

  • Examples...

A SDE was asked
Q. What is hashing? When is the time complexity of searching a hash table O(n)?
Ans. 

Hashing is a technique to map data to a fixed-size table. Time complexity of searching a hash table is O(n) in worst case.

  • Hashing is used to store and retrieve data quickly

  • It uses a hash function to map data to a fixed-size table

  • In the best case, searching a hash table takes O(1) time

  • In the worst case, all the data maps to the same index and searching takes O(n) time

  • Collision resolution techniques like chaining an...

Are these interview questions helpful?

Applied Materials SDE Interview Experiences

1 interview found

SDE Interview Questions & Answers

user image Anonymous

posted on 5 Jun 2015

Interview Questionnaire 

9 Questions

  • Q1. Difference between an array and a linked list
  • Ans. 

    Array is a collection of elements stored in contiguous memory locations while linked list is a collection of nodes linked by pointers.

    • Arrays have fixed size while linked lists can grow or shrink dynamically

    • Insertion and deletion is faster in linked lists than arrays

    • Accessing elements in arrays is faster than linked lists

    • Arrays are better for random access while linked lists are better for sequential access

  • Answered by AI
  • Q2. What data structure would you use for a dictionary?
  • Ans. 

    An array of key-value pairs is the best data structure for a dictionary.

    • Use a hash table or a balanced tree to implement the dictionary.

    • Keys should be unique and immutable.

    • Values can be any data type.

    • Access time should be O(1) or O(log n) depending on the implementation.

    • Examples: Python's dict, Java's HashMap, C++'s unordered_map.

  • Answered by AI
  • Q3. What is hashing? When is the time complexity of searching a hash table O(n)?
  • Ans. 

    Hashing is a technique to map data to a fixed-size table. Time complexity of searching a hash table is O(n) in worst case.

    • Hashing is used to store and retrieve data quickly

    • It uses a hash function to map data to a fixed-size table

    • In the best case, searching a hash table takes O(1) time

    • In the worst case, all the data maps to the same index and searching takes O(n) time

    • Collision resolution techniques like chaining and ope...

  • Answered by AI
  • Q4. Practical application of a linked list
  • Ans. 

    A linked list is used to store and manipulate a collection of data elements in a linear order.

    • Linked lists are commonly used in computer science for implementing data structures like stacks, queues, and hash tables.

    • They are also used in operating systems for managing memory allocation.

    • For example, a linked list can be used to implement a music playlist where each song is a node and the links between nodes represent the...

  • Answered by AI
  • Q5. Implement a stack using a linked list
  • Ans. 

    Implement a stack using a linked list

    • Create a Node class with data and next pointer

    • Create a Stack class with top pointer

    • Push new nodes to the top of the stack

    • Pop nodes from the top of the stack

    • Check if the stack is empty before popping

  • Answered by AI
  • Q6. What is a BST?
  • Ans. 

    BST stands for Binary Search Tree, a data structure used for efficient searching and sorting operations.

    • BST is a tree-like data structure where each node has at most two children.

    • The left child of a node contains a value less than the parent node, while the right child contains a value greater than the parent node.

    • BST allows for efficient searching and sorting operations with a time complexity of O(log n).

    • Examples of a...

  • Answered by AI
  • Q7. Program to check if a tree is a BST
  • Ans. 

    Program to check if a binary tree is a BST

    • Traverse the tree in-order and check if the values are in ascending order

    • Use a min-max range for each node to check if it satisfies the BST property

    • Recursively check if the left and right subtrees are BSTs

  • Answered by AI
  • Q8. Puzzle - add mathematical operators to make all these expressions true-
  • Q9. Where do you see yourself 5 years from now and other HR stuff

Interview Preparation Tips

College Name: NA

Skills evaluated in this interview

Top trending discussions

View All
Interview Tips & Stories
4d (edited)
a team lead
Why are women still asked such personal questions in interview?
I recently went for an interview… and honestly, m still trying to process what just happened. Instead of being asked about my skills, experience, or how I could add value to the company… the questions took a totally unexpected turn. The interviewer started asking things like When are you getting married? Are you engaged? And m sure, if I had said I was married, the next question would’ve been How long have you been married? What does my personal life have to do with the job m applying for? This is where I felt the gender discrimination hit hard. These types of questions are so casually thrown at women during interviews but are they ever asked to men? No one asks male candidates if they’re planning a wedding or how old their kids are. So why is it okay to ask women? Can we please stop normalising this kind of behaviour in interviews? Our careers shouldn’t be judged by our relationship status. Period.
Got a question about Applied Materials?
Ask anonymously on communities.

Interview questions from similar companies

SDE Interview Questions & Answers

Qualcomm user image Anonymous

posted on 4 Jun 2015

Interview Questionnaire 

8 Questions

  • Q1. How would you know .. your system is little endian or big endian??
  • Ans. 

    Endianess refers to the order in which bytes are stored in memory. Little endian stores the least significant byte first.

    • Check the byte order of a multi-byte integer value

    • Use a test value with known byte order to determine the system's endianess

    • Check the system's documentation or specifications

    • Use a code snippet to determine the endianess

  • Answered by AI
  • Q2. How function pointers are shared across different processes? using which iPCs?
  • Ans. 

    Function pointers can be shared across processes using inter-process communication mechanisms like shared memory, pipes, sockets, etc.

    • Function pointers can be stored in shared memory regions that are accessible by multiple processes.

    • Processes can communicate with each other using pipes or sockets and pass function pointers as arguments.

    • Remote Procedure Call (RPC) mechanisms can also be used to share function pointers a...

  • Answered by AI
  • Q3. What is binder in android?
  • Ans. 

    Binder is a mechanism for inter-process communication in Android.

    • Binder allows different processes to communicate with each other.

    • It is used for implementing Android's IPC (Inter-Process Communication) system.

    • Binder uses a client-server model where the client sends requests to the server and the server responds with the requested data.

    • It is used for sharing data between different components of an Android application.

    • Bi...

  • Answered by AI
  • Q4. How sysctrl works?
  • Ans. 

    sysctrl is a system control utility used to manage system settings and configurations.

    • sysctrl is used to manage system settings and configurations such as network settings, power management, and hardware configurations.

    • It can be used to start, stop, and restart system services.

    • sysctrl is commonly used in Linux and Unix-based operating systems.

    • Examples of sysctrl commands include 'sysctrl -p' to reload all settings from...

  • Answered by AI
  • Q5. Explain device tree concepts in linux
  • Ans. 

    Device tree is a data structure used to describe hardware components in a system and their interconnections.

    • Device tree is used in embedded systems to provide a standardized way of describing hardware components.

    • It is written in a language called Device Tree Source (DTS) and compiled into a binary format called Device Tree Blob (DTB).

    • The device tree is loaded by the bootloader and used by the kernel to configure the ha...

  • Answered by AI
  • Q6. Mention 4 IPCs used in user level process in linux
  • Ans. 

    4 IPCs used in user level process in Linux

    • Message Queues - allows processes to exchange data through messages

    • Shared Memory - allows processes to share a portion of memory

    • Semaphores - used for synchronization between processes

    • Pipes - allows communication between two related processes

  • Answered by AI
  • Q7. How a function from one user process can be called in other user process?
  • Ans. 

    Inter-process communication mechanisms like pipes, sockets, message queues, shared memory can be used to call a function from one user process to another.

    • Use pipes to establish a unidirectional communication channel between two processes.

    • Use sockets to establish a bidirectional communication channel between two processes.

    • Use message queues to send messages between processes.

    • Use shared memory to share data between proce...

  • Answered by AI
  • Q8. Write a program with 2 threads. one thread should print even and other should print odd numbers in sequence. how would you make it SMP safe?
  • Ans. 

    Program with 2 threads printing even and odd numbers in sequence. How to make it SMP safe?

    • Use mutex locks to ensure only one thread accesses the shared resource (the number to be printed) at a time

    • Use condition variables to signal when it's safe for the other thread to access the shared resource

    • Use atomic variables to ensure that the shared resource is accessed atomically

    • Use thread-safe data structures to store the sha...

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: These are the few questions that i remember from my Qualcomm interview that i faced in march '13 :
#How would you know .. your system is little endian or big endian??
#how function pointers are shared across different processes? using which iPCs?
#what is binder in android?
#how sysctrl works?
#explain device tree concepts in linux.
#mention 4 IPCs used in user level process in linux.
#how a function from one user process can be called in other user process?
#write a program with 2 threads. one thread should print even and other should print odd numbers in sequence. how would you make it SMP safe?

College Name: NA

Skills evaluated in this interview

SDE Interview Questions Asked at Other Companies

asked in Infosys
Q1. Return Subsets Sum to K Problem Statement Given an integer array ... read more
asked in Nagarro
Q2. Partition to K Equal Sum Subsets Problem Given an array of intege ... read more
asked in Nagarro
Q3. Sort a "K" Sorted Doubly Linked List Given a doubly-linked list w ... read more
asked in Amazon
Q4. Describe a scenario where you were given updates on repaired road ... read more
asked in Nagarro
Q5. Maximum Meetings Selection You are tasked with scheduling meeting ... read more
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Medium difficulty level of questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Good

SDE Interview Questions & Answers

Qualcomm user image Anonymous

posted on 12 Dec 2024

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Link list reversal
  • Ans. 

    Reversing a linked list involves changing the direction of the pointers between nodes.

    • Initialize three pointers: prev, current, and next.

    • Set prev to null and current to the head of the list.

    • Iterate through the list: update next to current.next, current.next to prev, then move prev and current forward.

    • Continue until current is null, then set the head to prev.

    • Example: For list 1 -> 2 -> 3, after reversal it becomes...

  • Answered by AI
  • Q2. OS all concepts

SDE Interview Questions & Answers

Qualcomm user image Anonymous

posted on 9 Jan 2025

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Two-Sum Problem
  • Ans. 

    The Two-Sum Problem involves finding two numbers in an array that add up to a specific target sum.

    • Given an array of integers and a target sum, identify two numbers that sum to the target.

    • Example: For array [2, 7, 11, 15] and target 9, the answer is indices 0 and 1 (2 + 7 = 9).

    • Use a hash map to store numbers and their indices for efficient lookup.

    • Time complexity is O(n) with a single pass through the array.

  • Answered by AI

I appeared for an interview before Sep 2020.

Round 1 - Video Call 

(3 Questions)

Round duration - 30 minutes
Round difficulty - Easy

  • Q1. How do you search for a node in a linked list?
  • Ans. 

    To search for a node in a linked list, iterate through the list and compare each node's value with the target value.

    • Start at the head of the linked list

    • Iterate through each node by following the 'next' pointer

    • Compare the value of each node with the target value

    • Return the node if found, otherwise return null

  • Answered by AI
  • Q2. How do you detect a loop in a linked list?
  • Ans. 

    To detect a loop in a linked list, we can use Floyd's Cycle Detection Algorithm.

    • Initialize two pointers, slow and fast, at the head of the linked list.

    • Move slow pointer by one step and fast pointer by two steps.

    • If there is a loop, the two pointers will eventually meet.

    • Alternatively, we can use a hash set to store visited nodes and check for duplicates.

  • Answered by AI
  • Q3. Implement a stack using a singly linked list.
  • Ans. 

    Implement a stack using a singly linked list

    • Create a Node class with data and next pointer

    • Create a Stack class with top pointer pointing to the top of the stack

    • Implement push, pop, and peek operations by manipulating the linked list

    • Example: Node class - Node { int data; Node next; }

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 40 minutes
Round difficulty - Easy

  • Q1. What is the top view of a binary tree?
  • Ans. 

    The top view of a binary tree shows the nodes visible from the top when looking down from the root node.

    • The top view of a binary tree is the set of nodes visible from the top when looking down from the root node.

    • Nodes at the same horizontal distance from the root are considered at the same level in the top view.

    • If multiple nodes are at the same horizontal distance, only the topmost node at that level is included in the...

  • Answered by AI
  • Q2. Explain the process of deleting a node from a linked list, covering all possible cases.
  • Ans. 

    Deleting a node from a linked list involves updating pointers to maintain the list's integrity.

    • Identify the node to be deleted by traversing the list

    • Update the previous node's next pointer to skip the node to be deleted

    • Free the memory allocated to the node to be deleted

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Inderprastha Engineering College. I applied for the job as SDE - 1 in NoidaEligibility criteriaminimum 70 %Cadence Design Systems interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Object-Oriented Programming, System DesignTime required to prepare for the interview - 5 MonthsInterview preparation tips for other job seekers

Do practice a lot of questions on linked list and stacks as these are two most important data structures asked in the interview. Also, try to implement it yourself without seeing the solution. Also prepare for Computer Science subjects like Operating System, Database Management System, Computer Networks, etc. I prepared them through Coding Ninjas notes which were simpler and easy to understand. 

Application resume tips for other job seekers

Keep your resume short and up to mark and check spellings before submitting it for the interview process.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Naukri.com and was interviewed before Dec 2020. There were 3 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. C Programming
  • Q2. Data structures
  • Q3. Os concepts
  • Q4. Communication protocols

Interview Preparation Tips

Interview preparation tips for other job seekers - 1 written test, 2 technical round and next HR ROUND
Are these interview questions helpful?

I appeared for an interview in Feb 2017.

Interview Questionnaire 

7 Questions

  • Q1. What is a malloc function and where is it used and how is it different from new?
  • Ans. 

    malloc is a function in C that dynamically allocates memory on the heap. It is used to allocate memory for variables or data structures.

    • malloc is used in C programming language.

    • It is used to allocate memory on the heap.

    • malloc is different from 'new' in C++ as it does not call constructors for objects.

  • Answered by AI
  • Q2. What is the difference between C++ and Objective C and where will you use it?
  • Ans. 

    C++ is a general-purpose programming language while Objective C is a superset of C used for iOS and macOS development.

    • C++ is widely used for developing applications, games, and system software.

    • Objective C is mainly used for iOS and macOS development.

    • C++ supports both procedural and object-oriented programming paradigms.

    • Objective C is an object-oriented language with dynamic runtime features.

    • C++ has a larger community a...

  • Answered by AI
  • Q3. What is the difference between class container and class composition?
  • Ans. 

    Class container is a class that holds objects of other classes, while class composition is a way to combine multiple classes to create a new class.

    • Class container holds objects of other classes, acting as a collection or container.

    • Class composition combines multiple classes to create a new class with its own behavior and attributes.

    • In class container, the objects are typically stored in a data structure like an array o...

  • Answered by AI
  • Q4. There are fifteen horses and a racing track that can run five horses at a time. You have to figure out the top 3 horses out of those and you don't have any timer machine to measure. How will you find the t...
  • Ans. 

    Divide the horses into groups of 5 and race them. Take the top 2 from each race and race them again. Finally, race the top 2 horses to determine the top 3.

    • Divide the horses into 3 groups of 5 and race them.

    • Take the top 2 horses from each race and race them again.

    • Finally, race the top 2 horses to determine the top 3.

  • Answered by AI
  • Q5. What is the most difficult problem that you have solved (during work) till now and why you think you could do so?
  • Ans. 

    Developing a real-time data processing system for a high-traffic e-commerce website

    • Implemented a distributed system architecture to handle large volumes of data

    • Optimized algorithms for efficient data processing and storage

    • Utilized caching mechanisms to improve system performance

    • Worked closely with cross-functional teams to troubleshoot and resolve issues

    • Example: Successfully reduced data processing time by 50% by imple...

  • Answered by AI
  • Q6. Why you want to change your current job?
  • Ans. 

    Seeking new challenges and opportunities for growth.

    • Looking for a more challenging role to further develop my skills

    • Interested in exploring new technologies and industries

    • Seeking better career advancement opportunities

    • Want to work in a more collaborative team environment

  • Answered by AI
  • Q7. What is the width of a tree? How will you calculate the width of the tree?
  • Ans. 

    The width of a tree is the maximum number of nodes at any level in the tree.

    • To calculate the width of a tree, we can perform a level order traversal and keep track of the maximum number of nodes at any level.

    • We can use a queue data structure to perform the level order traversal.

    • At each level, we count the number of nodes in the queue and update the maximum width if necessary.

  • Answered by AI

Interview Preparation Tips

Skills: Basic C/C++, Implementing Data Structures In C++

Skills evaluated in this interview

I appeared for an interview in Aug 2017.

Interview Preparation Tips

Round: Test
Duration: 1 hour 30 minutes
Total Questions: 60

Round: Technical Interview
Experience: Questions about DS , CN and basic resume

Round: Technical Interview
Experience: Questions about RT OS and memory mapping. And other operating system related questions.
Projects done so far.

Interview Questionnaire 

9 Questions

  • Q1. Tree questions related like traversal?
  • Q2. Locate the sum of 2 numbers in a linear array (Unsorted and sorted) and their complexities
  • Ans. 

    Locate sum of 2 numbers in a linear array (unsorted and sorted) and their complexities

    • For unsorted array, use nested loops to compare each element with every other element until the sum is found

    • For sorted array, use two pointers approach starting from the beginning and end of the array and move them towards each other until the sum is found

    • Complexity for unsorted array is O(n^2) and for sorted array is O(n)

  • Answered by AI
  • Q3. Pointers with increment/decrement, address of and value at operators (++,–,*,&)
  • Ans. 

    Pointers are used to manipulate memory addresses and values in C++. Increment/decrement, address of and value at operators are commonly used.

    • Incrementing a pointer moves it to the next memory location of the same data type

    • Decrementing a pointer moves it to the previous memory location of the same data type

    • The address of operator (&) returns the memory address of a variable

    • The value at operator (*) returns the value sto...

  • Answered by AI
  • Q4. A point and a rectangle is present with the given coordinates. How will you determine whether the point is inside or outside the rectangle?
  • Ans. 

    To determine if a point is inside or outside a rectangle, we check if the point's coordinates fall within the rectangle's boundaries.

    • Check if the point's x-coordinate is greater than the left edge of the rectangle

    • Check if the point's x-coordinate is less than the right edge of the rectangle

    • Check if the point's y-coordinate is greater than the top edge of the rectangle

    • Check if the point's y-coordinate is less than the b...

  • Answered by AI
  • Q5. There is a point inside the rectangle. How will you determine the line that passes through the point and divides the rectangle into 2 equal halves?
  • Ans. 

    To find line that divides rectangle into 2 equal halves through a point inside it.

    • Find the center of the rectangle

    • Draw a line from the center to the given point

    • Extend the line to the opposite side of the rectangle

    • The extended line will divide the rectangle into 2 equal halves

  • Answered by AI
  • Q6. There is a scheme which contains 8-bit and 16-bit signed numbers. How many such combinations are possible?
  • Ans. 

    There are multiple combinations of 8-bit and 16-bit signed numbers. How many such combinations are possible?

    • There are 2^8 (256) possible combinations of 8-bit signed numbers.

    • There are 2^16 (65,536) possible combinations of 16-bit signed numbers.

    • To find the total number of combinations, we can add the number of combinations of 8-bit and 16-bit signed numbers.

    • Therefore, the total number of possible combinations is 256 + ...

  • Answered by AI
  • Q7. You are given an array of elements. Some/all of them are duplicates. Find them in 0(n) time and 0(1) space. Property of inputs – Number are in the range of 1..n where n is the limit of the array
  • Ans. 

    Find duplicates in an array of elements in 0(n) time and 0(1) space.

    • Use the property of inputs to your advantage

    • Iterate through the array and mark elements as negative

    • If an element is already negative, it is a duplicate

    • Return all the negative elements as duplicates

  • Answered by AI
  • Q8. Given a array of digits. print all combination of of these i.e all no formed by these. repetition allowed. and then repetition not allowed example: i/p: arr={1,2,3} o/p: (without repetition) 123, 132, 213,...
  • Ans. 

    Generate all combinations of digits from an array, allowing and disallowing repetition.

    • Use recursion or backtracking to generate combinations.

    • For repetition allowed: e.g., arr={1,2}, combinations are 11, 12, 21, 22.

    • For repetition not allowed: e.g., arr={1,2,3}, combinations are 123, 132, 213, 231, 312, 321.

    • Utilize a set to track used digits when repetition is not allowed.

  • Answered by AI
  • Q9. Questions on project

Interview Preparation Tips

Round: Test
Duration: 90 minutes
Total Questions: 3

Round: HR Interview
Experience: HR interview was all about my projects, my background and a few more typical HR questions. It was pretty easy to answer them.

Skills: Algorithm, Data structure, C++
College Name: IIT ROORKEE

Skills evaluated in this interview

Applied Materials Interview FAQs

What are the top questions asked in Applied Materials SDE interview?

Some of the top questions asked at the Applied Materials SDE interview -

  1. What is hashing? When is the time complexity of searching a hash table O(...read more
  2. What data structure would you use for a dictiona...read more
  3. Puzzle - add mathematical operators to make all these expressions tr...read more

Tell us how to improve this page.

Interview Questions from Similar Companies

Qualcomm Interview Questions
3.8
 • 271 Interviews
Intel Interview Questions
4.2
 • 222 Interviews
Texas Instruments Interview Questions
3.9
 • 126 Interviews
Synopsys Interview Questions
3.9
 • 95 Interviews
Molex Interview Questions
3.9
 • 58 Interviews
Lam Research Interview Questions
3.7
 • 50 Interviews
View all
Technical Lead
287 salaries
unlock blur

₹19.7 L/yr - ₹35 L/yr

Senior Software Engineer
138 salaries
unlock blur

₹13.7 L/yr - ₹24 L/yr

Manufacturing Engineer
97 salaries
unlock blur

₹7.5 L/yr - ₹13.8 L/yr

Software Engineer
86 salaries
unlock blur

₹11.7 L/yr - ₹22.3 L/yr

Senior Engineer Mechanical
73 salaries
unlock blur

₹11 L/yr - ₹20 L/yr

Explore more salaries
Compare Applied Materials with

Qualcomm

3.8
Compare

Intel

4.2
Compare

Molex

3.9
Compare

TDK India Private Limited

3.8
Compare
write
Share an Interview