i
Loyalty Juggernaut
Filter interviews by
I applied via Company Website and was interviewed in Apr 2023. There were 5 interview rounds.
3 questions were asked on Data Structures and Algorithms. 2 Medium and 1 hard level question.
Top trending discussions
I applied via LinkedIn and was interviewed in Apr 2021. There were 4 interview rounds.
Minimum cost to reach last cell of 2D matrix with only downward or right moves.
Use dynamic programming approach to solve the problem.
Calculate minimum cost for each cell by considering minimum cost of its adjacent cells.
Final answer will be the minimum cost to reach the last cell.
Design a stack that supports getMin functionality to return the minimum element in the stack.
Create two stacks, one for storing the actual elements and another for storing the minimum elements.
Push elements onto both stacks simultaneously.
When popping an element, pop from both stacks.
To get the minimum element, peek at the top of the minimum stack.
TreeSet is a data structure that stores unique elements in sorted order.
TreeSet is implemented using a Red-Black tree
It provides O(log n) time complexity for basic operations like add, remove, and contains
It also provides methods like first(), last(), headSet(), tailSet(), and subSet()
TreeSet can be used to implement priority queues and sorting algorithms
Design an ArrayList with getMax functionality.
Create a custom ArrayList class that extends the existing ArrayList class.
Add a getMax() method that returns the maximum value in the list.
Override the add() method to keep track of the maximum value in the list.
Update the maximum value whenever an element is added or removed from the list.
I applied via Naukri.com and was interviewed in Mar 2024. There was 1 interview round.
-----.geeksforgeeks.org/replace-every-element-with-the-greatest-on-right-side/amp/
-----/
posted on 24 Mar 2015
posted on 26 Jan 2017
I was interviewed before Jan 2016.
I applied via Campus Placement
Regex for email validation
Start with a string of characters followed by @ symbol
Followed by a string of characters and a period
End with a string of characters with a length of 2-6 characters
Allow for optional subdomains separated by periods
Disallow special characters except for . and _ in username
Print prime numbers in a given range and optimize the solution.
Use Sieve of Eratosthenes algorithm to generate prime numbers efficiently
Start with a boolean array of size n+1, mark all as true
Loop through the array and mark all multiples of each prime as false
Print all the indexes that are still marked as true
Find angle between hour and minute hand in a clock given the time.
Calculate the angle made by the hour hand with respect to 12 o'clock position
Calculate the angle made by the minute hand with respect to 12 o'clock position
Find the difference between the two angles and take the absolute value
If the angle is greater than 180 degrees, subtract it from 360 degrees to get the smaller angle
To un-hash a string, use a reverse algorithm to convert the hash back to the original string.
Create a reverse algorithm that takes the hash as input and outputs the original string
Use the same logic as the hash function but in reverse order
If the hash function used a specific algorithm, use the inverse of that algorithm to un-hash the string
posted on 7 Sep 2015
I applied via Referral
based on 1 interview
Interview experience
Product Specialist
61
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Engineer
56
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Product Specialist
43
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
23
salaries
| ₹0 L/yr - ₹0 L/yr |
Production Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
QwikCilver Solutions
PAYBACK
Mobikwik
Zeta