Filter interviews by
Clear (1)
Pipes are used to transform data in templates, while directives are used to manipulate the DOM.
Pipes are used to format data in templates, such as date formatting or currency conversion.
Directives are used to add behavior to DOM elements, like hiding or showing elements based on conditions.
Example: Using a pipe to format a date in a template: {{ currentDate | date }}
Example: Using a directive to show/hide an element ba
AoT (Ahead of Time) compilation is done before the program runs, while JIT (Just in Time) compilation is done during runtime.
AoT compiles the code before execution, resulting in faster startup time.
JIT compiles the code during runtime, optimizing performance based on actual usage.
AoT is commonly used in languages like Java and C++, while JIT is used in languages like JavaScript and Python.
System design for a URL shortener webapp
Use a database to store original URLs and their corresponding short URLs
Implement a service to generate unique short URLs
Consider scalability and performance when designing the system
Include analytics to track usage and performance of the shortener service
Top trending discussions
I applied via Instahyre and was interviewed before Apr 2023. There were 3 interview rounds.
I applied via Approached by Company and was interviewed before Aug 2023. There were 2 interview rounds.
The assignment was to display a flight list and implement sort and filter functionality.
Basic of react native concepts and live machine coding round
I was interviewed in Aug 2021.
Round duration - 60 minutes
Round difficulty - Medium
Timing was fine - It was in the afternoon
Interviewer was friendly and helpful
Given an array ARR
of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...
Find duplicates in an array of integers within a specified range.
Iterate through the array and keep track of the count of each element using a hashmap.
Return elements with count greater than 1 as duplicates.
Handle edge cases like empty array or no duplicates found.
Example: For input [0, 3, 1, 2, 3], output should be [3].
Round duration - 60 minutes
Round difficulty - Medium
- Timing was fine - Afternoon
- Interviewer was friendly
Designing a caching library involves considering data storage, retrieval, expiration policies, and cache invalidation strategies.
Define the caching requirements such as data size, access patterns, and expiration policies.
Choose a suitable data structure for caching like LRU, LFU, or a simple key-value store.
Implement cache eviction policies to handle memory constraints and optimize performance.
Consider thread safety an...
Round duration - 60 minutes
Round difficulty - Medium
- Timing was fine - Afternoon
- Interviewer was friendly
A 10x10 cube has 600 edges.
A cube has 12 edges, so a 10x10 cube would have 12 edges on each of its 6 faces.
12 edges x 6 faces = 72 edges for the entire cube.
However, each edge is shared by two faces, so we need to divide by 2 to get the total number of unique edges.
72 edges / 2 = 36 unique edges on the outer surface of the cube.
Since the cube has 10x10x10 = 1000 unit cubes, each with 12 edges, we need to subtract the e...
Tip 1 : Be confident
Tip 2 : Be always ready for white board coding
Tip 3 : Brush up your basics
Tip 1 : Resume should not be more than 1 page long
Tip 2 : Write down your technical skills, Frameworks
I applied via LinkedIn and was interviewed before Mar 2023. There were 3 interview rounds.
To find the kth minimum element from a Binary Search Tree (BST)
Perform an in-order traversal of the BST to get elements in sorted order
Return the kth element from the sorted list
Time complexity: O(n) where n is the number of nodes in the BST
To find swapped numbers in a BST, perform inorder traversal and keep track of previous node.
Perform inorder traversal of the BST
Keep track of the previous node while traversing
If at any point, the current node's value is less than the previous node's value, those are the swapped numbers
I applied via LinkedIn and was interviewed in Mar 2021. There were 3 interview rounds.
Print the rightmost nodes of a binary tree.
Traverse the tree in a depth-first manner, starting from the right child of each node.
Use a queue to keep track of the nodes to be visited.
Add the rightmost node of each level to the result array.
Garbage Collector in C# manages memory allocation and deallocation automatically.
Garbage Collector is responsible for freeing up memory that is no longer in use.
It runs in the background and periodically checks for unused objects.
GC.SuppressFinalize() method can be used to prevent the finalizer from running.
GC.Collect() method can be used to force garbage collection.
GC.GetTotalMemory() method can be used to get the tot
Questions on graph, arrays, strings.
What was css question
About react js performance improvement
Creating a form with validation experience share
Use HTML form elements like input, select, textarea
Implement client-side validation using JavaScript
Implement server-side validation using backend technologies like Node.js or PHP
I applied via Referral and was interviewed before Sep 2022. There were 3 interview rounds.
Programs on Sorting and Search Algorithms and Core Java
Ds related questions
based on 1 interview
Interview experience
Software Engineer
31
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Product Manager
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Engineering Manager
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Strategic Account Manager
6
salaries
| ₹0 L/yr - ₹0 L/yr |
MakeMyTrip
Yatra
Cleartrip
Oyo Rooms