i
Pristyn Care
Filter interviews by
Clear (1)
I applied via Job Portal and was interviewed in May 2024. There were 2 interview rounds.
JavaScript is a high-level, interpreted programming language used for creating interactive websites.
JavaScript is commonly used for client-side web development.
It can be used to add interactivity, animations, and dynamic content to websites.
JavaScript is often used in conjunction with HTML and CSS.
Popular JavaScript frameworks include React, Angular, and Vue.
JS is a programming language used for web development. Virtual DOM is a concept in React to improve performance.
JS (JavaScript) is a popular programming language used for web development.
Virtual DOM is a concept in React where a lightweight copy of the actual DOM is created and updated to improve performance.
Virtual DOM allows React to efficiently update the actual DOM by only re-rendering components that have changed.
I applied via Naukri.com and was interviewed before Mar 2023. There were 2 interview rounds.
React js interview optimize using lazy loading
Top trending discussions
I applied via Walk-in and was interviewed in Nov 2021. There was 1 interview round.
Encapsulation, data abstraction, and polymorphism are three fundamental concepts in object-oriented programming.
Encapsulation is the process of hiding the implementation details of an object from the outside world.
Data abstraction is the process of representing only the essential features of an object and hiding the unnecessary details.
Polymorphism is the ability of an object to take on many forms or have multiple beha...
Stack is a data structure that follows Last In First Out (LIFO) principle. Queue is a data structure that follows First In First Out (FIFO) principle.
Stack is like a stack of plates where the last plate added is the first one to be removed
Queue is like a queue of people waiting in line where the first person added is the first one to be served
Stack operations: push (add element), pop (remove top element), peek (get top...
Caching is the process of storing frequently used data in a temporary storage area for faster access.
Caching improves application performance by reducing the number of requests to the server.
It can be implemented at different levels such as browser, server, and database.
Examples of caching include browser caching of web pages, server caching of API responses, and database caching of query results.
Join types used in SQL to combine data from multiple tables.
Inner join returns only the matching rows from both tables.
Left join returns all rows from the left table and matching rows from the right table.
Outer join returns all rows from both tables, with null values for non-matching rows.
Examples: SELECT * FROM table1 INNER JOIN table2 ON table1.id = table2.id
SELECT * FROM table1 LEFT JOIN table2 ON table1.id = table2...
I applied via Campus Placement and was interviewed before Mar 2023. There were 3 interview rounds.
4 questions , 3 DSA questions medium level and 1 DB design round
I applied via Referral and was interviewed in Apr 2024. There was 1 interview round.
I applied via Naukri.com and was interviewed before Jul 2023. There were 3 interview rounds.
Coding round and technical questions
Some technical questions and few questions related to past projects
I applied via Campus Placement
1 Hour 2 Medium Coding Question and few DB OOPS OS Questions on Hackerearth
I was interviewed in Nov 2023.
Questions were based on Computer Science Fundamentals, Coding and SQL
Binary Search has a time complexity of O(log n) and is derived from dividing the search space in half at each step.
Binary Search is a search algorithm that works on sorted arrays.
It starts by comparing the target value to the middle element of the array.
If the target value is smaller, the search continues on the lower half of the array.
If the target value is larger, the search continues on the upper half of the array.
T...
QuickSort is a sorting algorithm that uses divide and conquer approach.
Choose a pivot element from the array
Partition the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot
Recursively apply the above steps to the sub-arrays
Combine the sorted sub-arrays to get the final sorted array
Code for Fibonacci Series using Recursion, Iteration and Dynamic Programming
Recursion: Define a function that calls itself with the previous two numbers in the series as arguments
Iteration: Use a loop to calculate the series by adding the previous two numbers in each iteration
Dynamic Programming: Store the previous two numbers in variables and use them to calculate the next number in the series
Implementing a Queue using Stacks
Use two stacks to implement a queue
Push elements onto the first stack
When dequeuing, pop all elements from the first stack and push onto the second stack
Pop the top element from the second stack to dequeue
If the second stack is empty, pop all elements from the first stack and push onto the second stack
MergeSort is a divide and conquer algorithm that sorts an array of strings.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Counting Sort is a sorting algorithm that sorts elements by counting the number of occurrences of each unique element.
Count the occurrences of each element in the array
Calculate the cumulative sum of the counts
Place each element in the sorted array based on its count and cumulative sum
Time complexity is O(n+k) where n is the number of elements and k is the range of input
Example: Sort an array of strings based on their
Chrome uses an algorithm to predict and suggest words based on user input.
Chrome's algorithm uses a combination of user history, bookmarks, and popular searches to predict and suggest words.
The algorithm also takes into account the frequency and recency of the user's input.
Chrome's suggestion feature is powered by Google's Autocomplete API, which uses machine learning to predict and suggest words.
The suggestions are di...
based on 3 interviews
1 Interview rounds
based on 9 reviews
Rating in categories
Business Development Manager
677
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
228
salaries
| ₹0 L/yr - ₹0 L/yr |
Category Manager
142
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Associate
126
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Manager
77
salaries
| ₹0 L/yr - ₹0 L/yr |
Portea Medical
PharmEasy
Practo
Tata 1mg