Filter interviews by
Top trending discussions
posted on 25 Nov 2024
Memory leaks can be detected and prevented by monitoring memory usage, using memory profiling tools, avoiding circular references, and properly managing event listeners.
Monitor memory usage regularly to identify any abnormal increases.
Use memory profiling tools like Chrome DevTools or Valgrind to analyze memory usage.
Avoid creating circular references in your code, as they can prevent objects from being garbage collect...
posted on 13 May 2024
I was interviewed before May 2023.
Coding test in javascript
I applied via Approached by Company and was interviewed in Oct 2024. There were 2 interview rounds.
Find the longest sequence of ascending numbers in an array.
Iterate through the array and keep track of the current sequence length
Reset the sequence length when a number is not in ascending order
Return the longest sequence found
Find a pair of numbers in a list that subtract to a target value
Iterate through the list of numbers and store each number in a hashmap along with its index
For each number, check if the difference between the target and the number exists in the hashmap
Return the pair of numbers if found, otherwise return an empty array
I applied via Campus Placement
Its was data structure and algorithm and SQL round 4 question of dsa and 2 question of sql
OTP less work eliminates the need for one-time passwords for authentication.
OTP less work uses alternative methods like biometrics, push notifications, or hardware tokens for authentication.
It provides a more seamless and user-friendly authentication experience.
Examples include fingerprint scanning on smartphones or security keys for two-factor authentication.
posted on 24 Oct 2024
Count the number of islands in a given grid of '1's and '0's.
Iterate through the grid and for each '1' encountered, perform a depth-first search to mark all connected '1's as visited.
Increment the island count for each new island encountered.
Consider edge cases like grid boundaries and handling visited cells.
I applied via Campus Placement and was interviewed before Jul 2022. There were 5 interview rounds.
50 questions in 12 minutes mostly test your arthimetic, logical knowledge.
3 coding questions in 90 mins, 1st one is from arrays an easy question, 2nd one is related to stacks and queues relatively harder and last one is hard which i am also unable to attempt. I cracked the first two questions and my solutions passed all the test cases.
Sorting algorithms are methods used to arrange elements in a specific order.
Different sorting algorithms include bubble sort, selection sort, insertion sort, merge sort, quick sort, and heap sort.
Some algorithms are more efficient than others depending on the size of the data set and the initial order of the elements.
For example, quick sort is generally faster than bubble sort for large data sets.
BFS and DFS are traversal algorithms used in trees. BFS explores level by level, while DFS explores depth first.
BFS (Breadth-First Search) visits nodes level by level, using a queue. Example: traversing a binary tree level by level.
DFS (Depth-First Search) explores as far as possible along each branch before backtracking. Example: in-order traversal of a binary tree.
I applied via Campus Placement and was interviewed before Sep 2022. There were 4 interview rounds.
Question from Array,DP
I applied via Referral and was interviewed in Oct 2023. There were 4 interview rounds.
NEED TO QUALIFY IN THIS TEST
NEED TO QUALIFY THIS TEST ALSO
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Development Engineer
21
salaries
| ₹0 L/yr - ₹0 L/yr |
Softwaretest Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Network Support Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Cogoport
BlackBuck
Delhivery
Shadowfax Technologies