Filter interviews by
I applied via Naukri.com and was interviewed before Feb 2021. There were 4 interview rounds.
Top trending discussions
I applied via Campus Placement and was interviewed before Jul 2021. There were 2 interview rounds.
Questions were easy and on basic algorithm
I am a software engineer with experience in web development and problem-solving.
I have a Bachelor's degree in Computer Science.
I have worked on various web development projects using languages like JavaScript, HTML, and CSS.
I am proficient in using frameworks like React and Angular.
I have experience in database management using SQL and NoSQL.
I have strong problem-solving and analytical skills.
I am a quick learner and a...
I applied via Company Website and was interviewed before Aug 2021. There were 2 interview rounds.
Easy level questions
I applied via Naukri.com and was interviewed in May 2021. There was 1 interview round.
Example of React parent and child components with props
Create a parent component with state and pass it as props to child component
Access the props in child component using 'props' keyword
Update the parent state from child component using a callback function passed as prop
Example: Parent component -
Example: Child component -
Closure is a function that has access to its outer function's variables, even after the outer function has returned.
Closure is created when a function returns another function.
The inner function has access to the outer function's variables.
Closure is used to create private variables and methods.
Example: function outer() { let x = 10; return function inner() { console.log(x); } }
Example: let closureFunc = outer(); closu
Currying is a technique of transforming a function that takes multiple arguments into a sequence of functions that each take a single argument.
Currying is achieved by returning a function that takes the next argument until all arguments are received.
In JavaScript, currying is often used for partial application of functions.
The sum function in the example takes one argument and returns a function that takes the next arg...
I applied via Referral and was interviewed before Jul 2023. There were 3 interview rounds.
Design splitwise. Low Level question. More like Machine Coding
Question on Strings and DP
I applied via Referral and was interviewed before Feb 2022. There were 2 interview rounds.
I applied via Campus Placement and was interviewed before Jul 2022. There were 5 interview rounds.
3 questions were asked. 1 easy 1 medium 1 hard
One on one coding round. Basic easy to medium coding questions were asked
I applied via Campus Placement
3 questions 1 is easy and 2 medium problems
Check if a linked list is palindrome
Traverse the linked list and push each element onto a stack
Traverse the linked list again and compare each element with the top of the stack
If all elements match, the linked list is a palindrome
The diameter of a binary tree is the longest path between any two leaf nodes.
Calculate the height of left and right subtrees recursively
Find the diameter of left and right subtrees
Compare the diameter of left and right subtrees and return the maximum
The program capitalizes the first letter of each reversed word in a sentence.
Split the sentence into an array of words using space as a delimiter.
Reverse each word in the array and capitalize the first letter.
Join the modified words back into a sentence.
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on DSA were discussed.
Ninja is tasked with merging two given sorted integer arrays ARR1
and ARR2
of sizes 'M' and 'N', respectively, such that the merged result is a single sorted array w...
Merge two sorted arrays into one sorted array within the first array.
Create a pointer for the last index of ARR1 and ARR2 to start merging from the end.
Compare elements from both arrays and place the larger element at the end of ARR1.
Continue this process until all elements are merged in sorted order within ARR1.
Given a perfect binary tree consisting of 'N' nodes, reverse the nodes at alternate levels in the tree (i.e., reverse level 2, level 4, ...
Reverse alternate levels of a perfect binary tree by reversing nodes at even levels starting from level 2.
Traverse the tree in level order and store nodes at even levels in a separate list.
Reverse the list of nodes at even levels.
Update the tree with the reversed nodes at even levels.
Repeat the process for alternate levels starting from level 2.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on OS, Java were discussed.
Characteristics of distributed file systems include scalability, fault tolerance, and data replication.
Scalability: Distributed file systems can easily scale to accommodate a large amount of data and users.
Fault tolerance: They are designed to continue functioning even if some components fail, ensuring high availability.
Data replication: Data is often replicated across multiple nodes to ensure reliability and performan...
Design a file sharing mechanism between two users.
Implement a secure login system for both users.
Allow users to upload files to a shared server.
Provide a way for users to view and download files shared by the other user.
Implement access control to ensure only authorized users can access the shared files.
ConcurrentHashMap is a thread-safe implementation of the Map interface in Java.
ConcurrentHashMap allows multiple threads to read and write to the map concurrently without causing any issues like deadlocks or data corruption.
It achieves thread-safety by dividing the map into segments, each of which can be locked independently.
ConcurrentHashMap is more efficient than using synchronized maps for concurrent access.
Example:...
Analyzing usage history involves tracking user interactions, patterns, and trends to improve application performance.
Collect and store user interaction data such as clicks, page views, and time spent on each feature.
Use analytics tools to generate reports and visualize usage patterns.
Identify popular features, user preferences, and areas for improvement based on usage data.
Implement A/B testing to compare different ver...
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.
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.
Software Engineer
87
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
63
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer Level 1
36
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
34
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
33
salaries
| ₹0 L/yr - ₹0 L/yr |
Twilio
Hike
InMobi
Paytm