i
Micron
Technology
Work with us
Filter interviews by
Faced a performance issue in a React Native app due to heavy data processing, resolved by optimizing state management and using FlatList.
Identified performance lag when rendering a list of 10,000 items.
Used FlatList instead of ScrollView for better performance.
Implemented pagination to load data in chunks, reducing initial load time.
Optimized state management by using useMemo and useCallback to prevent unnecessary...
OOP concepts involve encapsulation, inheritance, and polymorphism in object-oriented programming.
Encapsulation: bundling data and methods that operate on the data into a single unit (class). Example: class Car { private String color; public void setColor(String c) { color = c; } }
Inheritance: creating new classes based on existing classes, inheriting their attributes and methods. Example: class SUV extends Car { p...
Garbage collection in Java is an automatic process of freeing up memory by removing unused objects.
Java uses a mark-and-sweep algorithm for garbage collection
Objects that are no longer referenced by any part of the program are eligible for garbage collection
System.gc() can be used to suggest garbage collection, but it is not guaranteed to run immediately
Garbage collection can cause performance issues if not manage...
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
...
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.
Start with base cases F(1) and F(2) as 1, then iterate to calculate subsequent Fibonacci numbers.
Return the Nth Fibonacci number as the final result.
You are given a singly linked list of integers and an integer 'K'. Your task is to modify the linked list by inserting a new node after every 'K' node in the linked list. The ...
Modify a singly linked list by inserting a new node after every 'K' nodes with the sum of previous 'K' nodes.
Traverse the linked list while keeping track of 'K' nodes at a time
Calculate the sum of the 'K' nodes and insert a new node with the sum after every 'K' nodes
Handle the case where the number of remaining nodes is less than 'K' by inserting a node with the sum of remaining nodes
Update the pointers accordingl...
I applied via Campus Placement and was interviewed in Mar 2023. There were 4 interview rounds.
Aptitude and Logical Reasoning - 15MCQ's in 20min
Programming - 10MCQ's in 15min
Technical - 25MCQ's in 30min
Coding - 2qns in 45min
I applied via Campus Placement and was interviewed in Jun 2022. There were 3 interview rounds.
Arithmetic Aptitude
Number Series
Profit and Loss
Data Interpretation
Garbage collection in Java is an automatic process of freeing up memory by removing unused objects.
Java uses a mark-and-sweep algorithm for garbage collection
Objects that are no longer referenced by any part of the program are eligible for garbage collection
System.gc() can be used to suggest garbage collection, but it is not guaranteed to run immediately
Garbage collection can cause performance issues if not managed pro...
I appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
The Technical interview was held on Zoom and the interview lasts for 1 hour. All the questions were from the skills mentioned in the resume.
Firstly interviewer asked me to give a self-introduction, later asked for a brief explanation of the projects and way of working.
Later series of questions were related to academics.
You are given a singly linked list of integers and an integer 'K'. Your task is to modify the linked list by inserting a new node after every 'K' node in the linked list. The...
Modify a singly linked list by inserting a new node after every 'K' nodes with the sum of previous 'K' nodes.
Traverse the linked list while keeping track of 'K' nodes at a time
Calculate the sum of the 'K' nodes and insert a new node with the sum after every 'K' nodes
Handle the case where the number of remaining nodes is less than 'K' by inserting a node with the sum of remaining nodes
Update the pointers accordingly to ...
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.
Start with base cases F(1) and F(2) as 1, then iterate to calculate subsequent Fibonacci numbers.
Return the Nth Fibonacci number as the final result.
Round duration - 50 minutes
Round difficulty - Easy
The interview was held on Zoom and the interview lasts for 50 minutes.
1.Explain how did you evolve yourself in B Tech (1-1 semester to 4-1 semester).
2. What do you know about Micron Technology?
Lastly discussed the certifications and extra circular activities I have done.
Tip 1 : Increase problem-solving ability and prepare Data structures and Algorithms well.
Tip 2 : Try to write Optimised code for the given problem statement. If you got stuck in the middle, give it a try. Interviewer will
look at your approach and try to help you.
Tip 3 : Be Confident enough, don't be nervous.
Tip 4 : Maintain At least 2 projects in your resume.
Tip 1 : Be honest with the information mentioned in the resume.
Tip 2 : You should be able to answer all the questions related to skills in the resume.
Tip 3 : Have at least 2 projects.
Tip 4 : You should be able to justify your resume.
Top trending discussions
I applied via Referral and was interviewed before Jun 2021. There was 1 interview round.
posted on 11 Apr 2021
I applied via LinkedIn and was interviewed in Mar 2021. There was 1 interview round.
I applied via Referral and was interviewed before Apr 2021. There were 2 interview rounds.
Binary Search
Design a traffic signal system
Identify the number of lanes and directions
Determine the duration of each signal phase
Consider pedestrian crossings and emergency vehicle prioritization
Implement sensors to detect traffic flow
Use machine learning algorithms to optimize signal timing
I appeared for an interview before Dec 2020.
Round duration - 90 Minutes
Round difficulty - Medium
The timing was from 4:30 pm to 6 pm, so it was quite convenient. The platform was good, the only problem I had was while attempting diagram based questions, as the interface was difficult to understand. The test had three types of questions- MCQ, subjective and diagram based. The major topics from which the question were asked were- sequential circuits(sequence detector), static timing analysis, digital design and computer architecture.
Imagine a city where the happiness of each resident is described by a numerical value. Ninja, who is visiting this city, is interested in forming groups of people su...
The problem is to find the number of ways to form a group of people such that the overall happiness of the group falls within a given range.
Iterate through all possible subsets of the given array/list
Calculate the sum of happiness values for each subset
Count the number of subsets whose sum falls within the given range
Round duration - 60 Minutes
Round difficulty - Medium
The timing for my interview was 9:30 pm and it went on for an hour. They asked me thorough questions from majorly two topics- CMOS and Digital System Design. Even if I was not able to answer certain questions,, they were happy to drop hints and then observed how I went further with the solution.
Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.
The wildcard pattern may include the...
The task is to implement a wildcard pattern matching algorithm that checks if a given wildcard pattern matches a given text.
The wildcard pattern can include the characters '?' and '*'
'?' matches any single character
'*' matches any sequence of characters (sequence can be of length 0 or more)
The matching should cover the entire text, not partial text
Implement a function that takes the wildcard pattern and the text as inp...
Tip 1 : MOST IMPORTANT- HAVE YOUR BASICS CLEAR! No amount of cross questioning should confuse you.
Tip 2 : Practise previous year GATE questions
Tip 3 : Have atleast a basic knowledge of any one of the hardware description languages- VERILOG or VHDL
Tip 1 : Be honest. Don't include an achievement/project that is not yours.
Tip 2 : Highlight your projects and do include an ongoing project if you have any.
I applied via Recruitment Consultant and was interviewed before May 2020. There were 3 interview rounds.
Clone a linked list with random pointers.
Create a new node for each node in the original list.
Store the mapping between the original and cloned nodes in a hash table.
Traverse the original list again and set the random pointers in the cloned list using the hash table.
Return the head of the cloned list.
I appeared for an interview in Aug 2017.
I appeared for an interview in Aug 2017.
I come from a close-knit family that values education and support, fostering my passion for technology and problem-solving.
My parents are both educators, which instilled a love for learning in me from a young age.
I have two siblings; my older brother is an engineer, and my younger sister is studying computer science.
Family gatherings often involve discussions about technology and innovation, inspiring my career path.
We...
I lack experience in a specific technology required for the role.
I may not have experience with a specific programming language or framework mentioned in the job description.
I may not have worked on projects similar to what your company is working on.
I may not have experience with certain tools or technologies that are crucial for the role.
based on 1 interview experience
Difficulty level
Duration
based on 2 reviews
Rating in categories
Software Engineer
161
salaries
| ₹9.1 L/yr - ₹15.5 L/yr |
Senior Software Engineer
136
salaries
| ₹17.3 L/yr - ₹32 L/yr |
Staff Engineer
114
salaries
| ₹32.3 L/yr - ₹54 L/yr |
Senior Engineer
109
salaries
| ₹19.5 L/yr - ₹34 L/yr |
Data Engineer
106
salaries
| ₹12 L/yr - ₹20.8 L/yr |
Qualcomm
Intel
Molex
TDK India Private Limited