Filter interviews by
HLD design refers to high-level design, which involves creating an architectural blueprint for a software system.
HLD design focuses on the overall structure and components of a system.
It includes defining the system's modules, interfaces, and interactions.
HLD design helps in understanding the system's functionality and how different components work together.
It provides a roadmap for the development process and hel...
System design for Netflix
Use microservices architecture
Implement a distributed caching system
Utilize content delivery networks (CDNs)
Implement recommendation algorithms
Ensure high availability and fault tolerance
Implement user authentication and authorization
Handle large-scale data storage and processing
Implement efficient search functionality
Low-Level Design (LLD) focuses on the detailed design of components and modules in software development.
LLD involves creating class diagrams, sequence diagrams, and detailed specifications.
Example: Designing a user authentication module with classes for User, Authenticator, and Token.
It emphasizes the interaction between components and their responsibilities.
Example: In an e-commerce application, LLD would detail ...
A queue is a linear data structure that follows the First In First Out (FIFO) principle for managing data.
A queue can be implemented using arrays or linked lists.
In an array-based queue, elements are added at the rear and removed from the front.
Example: Enqueue operation adds an element, while Dequeue removes the front element.
Circular queues can optimize space by reusing empty slots.
Common applications include ta...
LinkedList is a linear data structure where each element is a separate object with a pointer to the next element.
LinkedList is a collection of nodes that contain data and a reference to the next node.
It allows dynamic memory allocation and efficient insertion/deletion of elements.
Traversal in LinkedList is slower than arrays as it requires sequential access.
Examples include Singly LinkedList, Doubly LinkedList, an...
Stack is a data structure that follows LIFO (Last In First Out) principle. Queue is a data structure that follows FIFO (First In First Out) principle.
Stack is like a stack of plates where the last plate added is the first one to be removed
Push and pop operations are used to add and remove elements from the stack
Examples of stack include browser history, undo-redo operations
Queue is like a queue of people waiting i...
I applied via LinkedIn and was interviewed in Oct 2021. There were 5 interview rounds.
Binary tree fin the no of leaf node
System design for Netflix
Use microservices architecture
Implement a distributed caching system
Utilize content delivery networks (CDNs)
Implement recommendation algorithms
Ensure high availability and fault tolerance
Implement user authentication and authorization
Handle large-scale data storage and processing
Implement efficient search functionality
HLD design refers to high-level design, which involves creating an architectural blueprint for a software system.
HLD design focuses on the overall structure and components of a system.
It includes defining the system's modules, interfaces, and interactions.
HLD design helps in understanding the system's functionality and how different components work together.
It provides a roadmap for the development process and helps in...
Low-Level Design (LLD) focuses on the detailed design of components and modules in software development.
LLD involves creating class diagrams, sequence diagrams, and detailed specifications.
Example: Designing a user authentication module with classes for User, Authenticator, and Token.
It emphasizes the interaction between components and their responsibilities.
Example: In an e-commerce application, LLD would detail the C...
A queue is a linear data structure that follows the First In First Out (FIFO) principle for managing data.
A queue can be implemented using arrays or linked lists.
In an array-based queue, elements are added at the rear and removed from the front.
Example: Enqueue operation adds an element, while Dequeue removes the front element.
Circular queues can optimize space by reusing empty slots.
Common applications include task sc...
I applied via Company Website and was interviewed in Dec 2021. There were 4 interview rounds.
LinkedList is a linear data structure where each element is a separate object with a pointer to the next element.
LinkedList is a collection of nodes that contain data and a reference to the next node.
It allows dynamic memory allocation and efficient insertion/deletion of elements.
Traversal in LinkedList is slower than arrays as it requires sequential access.
Examples include Singly LinkedList, Doubly LinkedList, and Cir...
Stack is a data structure that follows LIFO (Last In First Out) principle. Queue is a data structure that follows FIFO (First In First Out) principle.
Stack is like a stack of plates where the last plate added is the first one to be removed
Push and pop operations are used to add and remove elements from the stack
Examples of stack include browser history, undo-redo operations
Queue is like a queue of people waiting in lin...
Top trending discussions
I applied via Company Website and was interviewed before Oct 2019. There were 4 interview rounds.
I appeared for an interview before Mar 2021.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading, trailing, and multiple spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
Handle leading, trailing, and multiple spaces appropriately
You are given a stack of integers. Your task is to reverse the stack using recursion without using any extra space other than the internal stack space used due to recursion...
Reverse a stack using recursion without using any extra space other than the internal stack space.
Use recursion to pop all elements from the original stack and store them in function call stack.
Once the stack is empty, push the elements back in reverse order.
Base case of recursion should be when the original stack is empty.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mirror of a bin...
Convert a binary tree to its mirror tree by interchanging left and right children of all non-leaf nodes.
Traverse the binary tree in a recursive manner.
Swap the left and right children of each non-leaf node.
Continue this process until all nodes have been processed.
You are given a singly linked list with 'N' nodes, each containing integer data, and an integer 'K'. Your goal is to remove the 'K'th node counting from the end of ...
Remove the Kth node from the end of a singly linked list.
Use two pointers approach to find the Kth node from the end.
Handle edge cases like removing the head node or removing the last node.
Update the pointers to remove the Kth node and reconnect the list.
Round duration - 30 minutes
Round difficulty - Easy
Typical Managerial round.
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.
I appeared for an interview in Oct 2016.
Inheritance is a concept in object-oriented programming where a class inherits properties and behaviors from another class.
Inheritance allows for code reuse and promotes modularity.
The class that is being inherited from is called the superclass or base class.
The class that inherits from the superclass is called the subclass or derived class.
The subclass can access the public and protected members of the superclass.
Inhe...
Regular expressions in PHP are powerful tools for pattern matching and manipulating strings.
Regular expressions are defined using the preg_match() function in PHP.
They are used to search, replace, and validate strings based on specific patterns.
Regex patterns consist of a combination of characters and special symbols.
Modifiers can be added to the pattern to control the matching behavior.
Common regex functions in PHP in...
Polymorphism is the ability of an object to take on many forms. It allows objects of different classes to be treated as the same type.
Polymorphism allows a single interface to be used for different types of objects.
It enables code reusability and flexibility in object-oriented programming.
For example, a parent class 'Animal' can have multiple child classes like 'Dog', 'Cat', and 'Bird'. They can all be treated as 'Anim...
based on 1 review
Rating in categories
Member Technical Staff
542
salaries
| ₹22.1 L/yr - ₹40 L/yr |
Senior Member of Technical Staff
512
salaries
| ₹40.6 L/yr - ₹72.8 L/yr |
Technical Support Engineer
396
salaries
| ₹10 L/yr - ₹18 L/yr |
Business Analyst
271
salaries
| ₹8.2 L/yr - ₹15 L/yr |
Technical Staff Member 3
248
salaries
| ₹30 L/yr - ₹53.1 L/yr |
Oracle
Amdocs
Automatic Data Processing (ADP)
24/7 Customer