Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Lam Research Team. If you also belong to the team, you can get access from here

Lam Research Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Lam Research Software Developer Interview Questions and Answers

Updated 11 Mar 2025

Lam Research Software Developer Interview Experiences

2 interviews found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Hirepro , 2 easy to medium coding questions with technical questions

Round 2 - One-on-one 

(2 Questions)

  • Q1. DSA questions were asked they were easy
  • Q2. Insert a node at the middle of a linked list
  • Ans. 

    To insert a node at the middle of a linked list, find the middle node and adjust pointers accordingly.

    • Find the middle node using slow and fast pointers

    • Adjust pointers to insert the new node at the middle

  • Answered by AI
Round 3 - HR 

(1 Question)

  • Q1. Puzzle and general question

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I appeared for an interview before Mar 2024.

Round 1 - HR 

(1 Question)

  • Q1. Salary discussion

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more

Interview questions from similar companies

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,...
  • 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

I appeared for an interview before May 2016.

Interview Preparation Tips

Round: written test
Experience: it was elitmus test conducted by the company itself on campus. As per my knowledge only those scoring 90 percentile got selected for round 2.
Tips: Attempt only those ques that are necessary for scoring 90+ in e litmus. Specially in verbal don't attempt more then required questions, though you might be tempted. The aim is not to score max bt to score 90+

Round: Technical Interview
Experience: This was a programming based round. I was asked to write algorithms for various array linked list based problems. There was cross questioning prompting to reduce complexity and to use different data structures for same problems.

Mostly it focused on subjects like c, data structures and ADA.
Tips: Be clear with basic of data structures and algorithms. Pointers, queue, stacks, array linked lists, sorting etc are the keywords.

Round: Technical Interview
Experience: This was a information security specific round since that was my major. In depth cross questioning on my thesis topics, honeypots, network intrusion etc. Security certificates, and on the go problems to provide security solution layer wise in different scenarios. Security concept of torrents was also asked in detail.
Tips: It was more of a security discussion and throwing of ideas about how things in a particular case could work or could not. Don't worry about right or wrong answer just be clear with your reasoning about the solution you are suggesting.

Round: Other Interview
Experience: I don't know what to name this round, but it focused mainly on developing test cases for an object. Say they gave me a stapler and said to develop a test plan listing down test cases for a given object to pass so that it can be confirmed that it is a stapler. Another scenario was with a lift.
Tips: This is one round where your presence of mind and inter personal skills matter. I think the way you present your thoughts was most important here.

Round: Behavioural Interview
Experience: This was was mostly about how would you react in a given professional situation
Like your assigned work could not be completed on time, or if you are doing something wrong with the work assigned.
Tips: This is all about inter personal skills and putting your best foot forward :)

College Name: Indira Gandhi Delhi Technical University For Women, Delhi

I appeared for an interview in Sep 2016.

Interview Preparation Tips

Round: Test
Experience: Questions aren't tough but they take more time to read itself.
Tips: First try to attempt the questions which are seemingly small. Reading bigger questions first and wasting more time on that isnt a good idea at all.
Duration: 30 minutes
Total Questions: 30

Skills: Technical Skill, Analytical Skills
College Name: IIT Kharagpur

Interview Questionnaire 

5 Questions

  • Q1. In C programming they asked about storage classes, Volatile , Whole compilation process steps by steps, Dangling pointer , Memory leak, Memory corruption
  • Q2. In data structure they asked question on String , Linked List and array
  • Q3. Data structure question section is easy don't go for complex algorithms just study basic algorithms. like reverse the linked list in group on given size
  • Q4. They also asked question on bit manipulation. Like Check that given number binary representation is palindrome or not?
  • Q5. Swap even and odd bits in given number
  • Ans. 

    Swap even and odd bits in a given number

    • Create a mask for even bits and odd bits

    • Shift even bits to right and odd bits to left

    • Combine even and odd bits using bitwise OR operator

  • Answered by AI

Interview Preparation Tips

College Name: NA

Skills evaluated in this interview

I applied via Campus Placement

Interview Questionnaire 

4 Questions

  • Q1. What is a program, task and threads
  • Ans. 

    A program is a set of instructions that tells a computer what to do. A task is a unit of work performed by a program. A thread is a sequence of instructions within a task.

    • A program is a collection of instructions that are executed by a computer to perform a specific task.

    • A task is a unit of work that is performed by a program. It can be a specific action or a set of actions.

    • A thread is a sequence of instructions within...

  • Answered by AI
  • Q2. Delete a node in a linked list
  • Ans. 

    To delete a node in a linked list, we need to adjust the pointers of the previous and next nodes.

    • Find the node to be deleted by traversing the linked list

    • Adjust the pointers of the previous and next nodes to skip the node to be deleted

    • Free the memory occupied by the node to be deleted

  • Answered by AI
  • Q3. What is a function pointer and volatile type in c
  • Ans. 

    A function pointer is a variable that stores the address of a function. Volatile type is used to declare variables that can be modified by external factors.

    • Function pointers are used to pass functions as arguments to other functions.

    • Volatile type is used when a variable's value can be changed unexpectedly by external factors.

    • Function pointers can be used to implement callbacks or event handling mechanisms.

    • Volatile type...

  • Answered by AI
  • Q4. Summarise your resume
  • Ans. 

    Experienced software developer with expertise in Java, Python, and SQL

    • Proficient in Java, Python, and SQL programming languages

    • Developed web applications using Java Spring framework

    • Experience with database management and optimization using SQL

    • Worked on various software projects in a team environment

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Paper was challenging and It was well set.

Duration: 90 minutes
Total Questions: 60

Round: Technical Interview
Experience: It was a very good experience overall. Interviewer helped to ease the tension.
Tips: Waiting time can be reduced.

General Tips: Prepare for precedence of operators in C.
Try to be fast in solving the problems.
Skills: Knowledge Of Your Resume Points, Pointers In C, Operating System Basics
Duration: 2
College Name: IIT Madras
Motivation: Qualcomm is a

Skills evaluated in this interview

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

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Recruitment Consulltant and was interviewed in Aug 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

Basic aptitude, c and data structures

Round 3 - Technical 

(2 Questions)

  • Q1. C and data structures
  • Q2. Operating system and puzzle

Interview Preparation Tips

Interview preparation tips for other job seekers - Be strong in basics of c and data structure.
Some basics on OS

I appeared for an interview before Apr 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 75 minutes
Round difficulty - Medium

This was an online coding round where I had 2 questions to solve under 75 minutes. Both the coding questions were of Medium to Hard level of difficulty.

  • Q1. 

    Smallest Window Problem Statement

    Given two strings, S and X, your task is to find the smallest substring in S that contains all the characters present in X.

    Example:

    Input:
    S = "abdd"
    X = "bd"
    Output:
    ...
  • Ans. 

    Find the smallest substring in S that contains all characters in X.

    • Use a sliding window approach to find the smallest substring in S that contains all characters in X.

    • Keep track of the characters in X using a hashmap.

    • Move the window by adjusting the start and end pointers until all characters in X are found.

    • Return the smallest substring encountered.

  • Answered by AI
  • Q2. 

    K - Sum Path In A Binary Tree

    Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...

  • Ans. 

    Find all paths in a binary tree where the sum of node values equals a given value 'K'.

    • Traverse the binary tree using DFS and keep track of the current path and its sum.

    • At each node, check if the current sum equals 'K' and add the path to the result.

    • Continue traversal to the left and right child nodes recursively.

    • Return the list of paths that sum up to 'K'.

  • Answered by AI
Round 2 - Video Call 

(4 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions of DS/Algo to solve under 60 minutes and 2 questions related to Operating Systems.

  • Q1. 

    Validate Partial Binary Search Tree (BST) Problem Statement

    You are provided with a binary tree containing 'N' nodes. Your task is to determine if this tree is a Partial Binary Search Tree (BST). Return t...

  • Ans. 

    Validate if a binary tree is a Partial Binary Search Tree (BST) by checking if each node's left subtree contains nodes with data less than or equal to the node's data, and each node's right subtree contains nodes with data greater than or equal to the node's data.

    • Check if each node's left subtree follows BST property (data <= node's data) and right subtree follows BST property (data >= node's data)

    • Recursively che...

  • Answered by AI
  • Q2. 

    Longest Increasing Subsequence Problem Statement

    Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...

  • Ans. 

    Find the length of the longest strictly increasing subsequence in an array of integers.

    • Use dynamic programming to solve this problem efficiently.

    • Initialize an array to store the length of the longest increasing subsequence ending at each index.

    • Iterate through the array and update the length of the longest increasing subsequence for each element.

    • Return the maximum value in the array as the result.

  • Answered by AI
  • Q3. Can you define process and threads in operating systems?
  • Ans. 

    Processes are instances of a program in execution, while threads are lightweight processes within a process.

    • A process is a program in execution, with its own memory space and resources.

    • Threads are lightweight processes within a process, sharing the same memory space and resources.

    • Processes are independent of each other, while threads within the same process can communicate and share data.

    • Example: A web browser running ...

  • Answered by AI
  • Q4. What are the different types of semaphores?
  • Ans. 

    Different types of semaphores include binary semaphores, counting semaphores, and mutex semaphores.

    • Binary semaphores: Can only have two states - 0 or 1. Used for mutual exclusion.

    • Counting semaphores: Can have multiple states. Used for managing resources with limited capacity.

    • Mutex semaphores: Similar to binary semaphores but with additional features like priority inheritance.

    • Named semaphores: Can be shared between proc...

  • Answered by AI
Round 3 - Video Call 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Hard

In this round, I was asked 3 coding questions out of which I had to implement the first two and for the last question I was only asked the optimal approach. The main challenge in this round was to implement the first two questions in a production ready manner without any bugs and so I had to spent some time thinking about some Edge Cases which were important with respect to the question.

  • Q1. 

    Next Greater Element Problem Statement

    You are given an array arr of length N. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater ele...

  • Ans. 

    The task is to find the next greater element for each element in an array to its right, if no greater element exists, return -1.

    • Use a stack to keep track of elements for which the next greater element is not found yet.

    • Iterate through the array from right to left and pop elements from the stack until a greater element is found.

    • Store the next greater element for each element in a separate array.

    • If the stack is empty afte...

  • Answered by AI
  • Q2. 

    Power Set Generation

    Given a sorted array of 'N' integers, your task is to generate the power set for this array. Each subset of this power set should be individually sorted.

    A power set of a set 'ARR' i...

  • Ans. 

    Generate power set of a sorted array of integers with individually sorted subsets.

    • Use recursion to generate all possible subsets by including or excluding each element in the array.

    • Sort each subset before adding it to the power set.

    • Handle base case when all elements have been considered to add the subset to the power set.

  • Answered by AI
  • Q3. 

    Counting Sort Problem Statement

    Ninja is learning about sorting algorithms, specifically those that do not rely on comparisons. Can you help Ninja implement the counting sort algorithm?

    Example:

    Input:
    ...
  • Ans. 

    Implement counting sort algorithm to sort an array of integers without comparisons.

    • Count the frequency of each element in the input array.

    • Create a prefix sum array to determine the position of each element in the sorted array.

    • Iterate through the input array and place each element in its correct position based on the prefix sum array.

    • Time complexity of counting sort is O(n+k), where n is the number of elements and k is

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPACadence Design Systems interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OS, DBMS, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Lam Research Interview FAQs

How many rounds are there in Lam Research Software Developer interview?
Lam Research interview process usually has 2-3 rounds. The most common rounds in the Lam Research interview process are HR, Resume Shortlist and Coding Test.
What are the top questions asked in Lam Research Software Developer interview?

Some of the top questions asked at the Lam Research Software Developer interview -

  1. Insert a node at the middle of a linked l...read more
  2. DSA questions were asked they were e...read more
  3. Puzzle and general quest...read more

Tell us how to improve this page.

Lam Research Software Developer Interview Process

based on 2 interviews

Interview experience

4.5
  
Good
View more
Lam Research Software Developer Salary
based on 5 salaries
₹9.5 L/yr - ₹26.5 L/yr
94% more than the average Software Developer Salary in India
View more details

Lam Research Software Developer Reviews and Ratings

based on 3 reviews

3.6/5

Rating in categories

2.8

Skill development

3.1

Work-life balance

3.4

Salary

4.0

Job security

4.0

Company culture

2.9

Promotions

2.8

Work satisfaction

Explore 3 Reviews and Ratings
Senior Buyer
54 salaries
unlock blur

₹8 L/yr - ₹16 L/yr

Senior Software Engineer
51 salaries
unlock blur

₹8.6 L/yr - ₹28 L/yr

Senior Engineer Mechanical
49 salaries
unlock blur

₹11 L/yr - ₹20.5 L/yr

Program Manager
41 salaries
unlock blur

₹10.7 L/yr - ₹36 L/yr

Senior Electrical Engineer
40 salaries
unlock blur

₹10.2 L/yr - ₹20 L/yr

Explore more salaries
Compare Lam Research with

Qualcomm

3.8
Compare

Intel

4.2
Compare

TDK India Private Limited

3.8
Compare

Molex

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview