Neuron Senior Software Developer Interview Questions and Answers

Low level design | duration 60 min

Q1. LLD of to do list
Add your answer
Q2. Concurrencty management
Add your answer

The exam duration is one and a half hours.

The total exam time is one and a half hours.

It encompasses all topics related to full stack development.

Q1. Asks questions on SQL
Add your answer
Q2. Asks question in typical topics
Add your answer

Q1. Where do you see yourself in two years?
Ans. 
In two years, I see myself as a senior software developer leading a team on innovative projects.
• Advancing to a senior software developer role

• Leading a team on new and innovative projects

• Continuing to enhance my technical skills through ongoing learning and training
Answered by AI
Add your answer

Q1. LRU Cache - how to tackle
Ans. 
LRU Cache is a data structure that maintains a list of items in order of most recently used to least recently used.
• Implement using a doubly linked list and a hashmap for efficient operations

• When an item is accessed, move it to the front of the list

• When the cache is full, remove the least recently used item from the end of the list
Answered by AI
Add your answer
Q2. LRU Cache implementation based on a real time system. How would the main work which will be called etc etc
Add your answer

Q1. The question was about Nodejs
Add your answer
Q2. The question was to build a linked list in Nodejs
Add your answer

Q1. The first question was related to DSA
Add your answer
Q2. The question was related to SQL
Add your answer

2 problem one was moderate and ine was easier

It was to create small project with 2 screens and api call , asked to follow a good architectural pattern and unit test cases

Q1. ARC and memory leaks
Add your answer
Q2. Questions related to swift and iOS Development
Add your answer

Q1. Asked about my why you want to join
Add your answer
Q2. Asked a fee things about org
Add your answer

Q1. 1. Given an array find a subset that sums to a given sum K 2. Given an array with duplicate elements, print all triplets that sum to K. Each element at any index i can only be used once.
Ans. 
Given an array, find a subset that sums to a given sum K and print all triplets that sum to K.
• Use a recursive approach to find subsets that sum to K

• Use a nested loop to find triplets that sum to K

• Avoid using duplicate elements in triplets
Answered by AI
Add your answer

Q1. LLD round 1. Design Book My Show. Interviewer was interested in classes and most common api. He asked more about how will these classes when translated into RDBMS table, will look like. What all index I co...read more
Add your answer

Q1. HLD round 1. Design swiggy 2. Follow up question was to create a state diagram for order object.
Add your answer

Q1. With HM 1. Projects 2. Major challenges during those projects 3. Who all were you stake holders 4. How do you contribute in design discussion 5. How to you plan your testing with QA and other involved team...read more
Add your answer

Q1. With VP of engineering 1. Project discussion. In each scope he asked what if this would fail then how are you handling your code. for eg. Let's say you are reading a file and dumping data in batches in 1 t...read more
Add your answer

Q1. He asked to invert a binary tree
Add your answer
Q2. Deep dive in projects
Add your answer
Q3. Asked me indept js questions
Add your answer