i
HyperVerge
Filter interviews by
Clear (1)
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.
Top trending discussions
I applied via LinkedIn and was interviewed before Jan 2024. There were 3 interview rounds.
Aptitude test was simple.
I applied via Campus Placement and was interviewed before Oct 2022. There were 3 interview rounds.
3 Coding question medium level
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
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 Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.
based on 2 interviews
Interview experience
based on 2 reviews
Rating in categories
Software Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Deep Learning Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Solution Architect
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Fractal Analytics
Mu Sigma
TCS
Wipro