Filter interviews by
Delete removes rows one by one and can be rolled back, while truncate removes all rows at once and cannot be rolled back.
Delete is a DML command, while truncate is a DDL command.
Delete operation is slower as it generates a lot of undo and redo logs, while truncate is faster as it does not generate logs.
Delete can be used with a WHERE clause to delete specific rows, while truncate removes all rows from a table.
Delete op...
Top trending discussions
I applied via Job lever and was interviewed before Sep 2021. There were 2 interview rounds.
Easy leetcode code 2 questions , HTML5 css javascript simple screen design
I applied via Company Website and was interviewed before Jul 2023. There was 1 interview round.
Interview was problem solving
I applied via LinkedIn and was interviewed in May 2021. There was 1 interview round.
I was interviewed before May 2021.
Round duration - 60 Minutes
Round difficulty - Easy
It was an coding round
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.
Iterate through the buildings and create a list of critical points (x, y) where the height changes.
Sort the critical points based on x-coordinate and process them to form the skyline.
Merge consecutive horizontal segments of equal height into one to ensure no duplicates.
Return the fin...
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Find all possible paths for a rat in a maze from source to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Recursively try moving in all directions (up, down, left, right) until reaching the destination.
Return a list of strings representing valid paths sorted in alphabetical order.
Round duration - 30 Minutes
Round difficulty - Easy
It was an HR round with some general questions. it was just for formality.
Tip 1 : Stay focused
Tip 2 : Practice coding questions.
Tip 3 : View previous interviews of the companies
Tip 1 : Don't lie on resume
Tip 2 : Just write in format that is catchy
I applied via Job Portal and was interviewed before Nov 2023. There were 3 interview rounds.
Use a user table with a column for user type (free, gold, platinum)
Create a user table with columns for user ID, name, email, user type
Use a separate table for user types with columns for type ID and type name
Establish a one-to-many relationship between user and user type tables
Example: user table - user_id, name, email, type_id; user_type table - type_id, type_name
High-level design for a live rank dashboard for a live test with millions of users.
Use a scalable architecture to handle millions of users concurrently.
Implement real-time data processing to update ranks dynamically.
Utilize caching mechanisms to improve performance and reduce load on the database.
Design a user-friendly interface with intuitive data visualization.
Include features for filtering, sorting, and searching to
I applied via Naukri.com and was interviewed in Oct 2021. There were 4 interview rounds.
I applied via Campus Placement and was interviewed in May 2022. There were 4 interview rounds.
There was 2 coding question
One was easy One was very Difficult
20 MCQ question from Operating system and DBMS
Find the longest consecutive subarray.
Iterate through the array and keep track of the current subarray length.
Update the maximum length as you iterate.
Reset the current subarray length when a non-consecutive element is encountered.
Minimum Spanning Tree (MST) is a tree that connects all vertices in a graph with minimum total edge weight.
MST can be found using Prim's algorithm or Kruskal's algorithm.
Prim's algorithm starts with a single vertex and adds the closest vertex to the tree until all vertices are included.
Kruskal's algorithm starts with the edges with the lowest weight and adds them to the tree as long as they don't create a cycle.
MST has...
I applied via Referral and was interviewed before Aug 2022. There were 4 interview rounds.
Event loop is a mechanism that allows for asynchronous programming by handling events and callbacks.
Event loop is responsible for handling and executing events and callbacks in a non-blocking manner.
It continuously checks the event queue and processes events one by one.
Event loop is commonly used in JavaScript for handling asynchronous operations like setTimeout, setInterval, and AJAX requests.
Ask to create a database design and API for a todo list app
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Software Engineer
51
salaries
| ₹0 L/yr - ₹0 L/yr |
Devops Engineer
42
salaries
| ₹0 L/yr - ₹0 L/yr |
Softwaretest Engineer
34
salaries
| ₹0 L/yr - ₹0 L/yr |
Power BI Developer
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
14
salaries
| ₹0 L/yr - ₹0 L/yr |
BYJU'S
Unacademy
upGrad
MeritNation