i
Revolut
Filter interviews by
Clear (1)
I applied via Recruitment Consulltant and was interviewed in Jul 2024. There was 1 interview round.
I have to write code for a load balancer. The code should be testable and imahoild be thread safe
Top trending discussions
I was interviewed before Jun 2023.
Program to read a file in backend development
Use a programming language like Python, Java, or C++ to open and read the file
Use file handling functions to read the contents of the file
Handle exceptions for file not found or permission issues
Close the file after reading to free up system resources
It was a machine coding round which revolves around designing a simple application primarily on OOPS
The best time to sell stocks is when the market is high and the stock has reached its peak value.
Sell when the stock has reached its peak value to maximize profits
Consider selling if the company's fundamentals have changed negatively
Sell if you need to rebalance your portfolio or have reached your financial goals
The best time to sell stocks is when the market is at a peak and the stock price is high.
Monitor market trends and stock performance regularly.
Consider selling when the stock reaches a new high or when you have achieved your profit goals.
Sell if there are negative news or events that could impact the stock price negatively.
I applied via Instahyre and was interviewed in Nov 2024. There was 1 interview round.
Machine Coding round on codesignal
I applied via Approached by Company and was interviewed in Jul 2024. There were 4 interview rounds.
The first round is an aptitude assessment that consists of coding questions focused on dynamic programming, as well as medium to hard level aptitude and reasoning questions.
The second round focuses on coding and consists of data structure and algorithm questions related to arrays, linked lists, basic Java concepts, strings, and project-based questions from the resume.
The third round also consists of coding, which includes challenging data structures and algorithms questions based on graphs, trees, multithreading, and difficult SQL-based questions.
My short-term goal is to enhance my skills in backend development and contribute effectively to the team. My long-term goal is to become a lead developer and work on innovative projects.
Short-term goal: Improve backend development skills
Short-term goal: Contribute effectively to the team
Long-term goal: Become a lead developer
Long-term goal: Work on innovative projects
I break down the problem into smaller tasks, prioritize them, and focus on the most critical aspects first.
Break down the problem into smaller, more manageable tasks
Prioritize tasks based on importance and impact
Focus on critical aspects first to ensure progress
Regularly reassess and adjust the plan as needed
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/
-----/
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 Instahyre and was interviewed in Jan 2021. There were 5 interview rounds.
To find a loop in a linked list, we use Floyd's cycle-finding algorithm.
Floyd's cycle-finding algorithm uses two pointers, one moving at a rate of one node per iteration and the other moving at a rate of two nodes per iteration.
If there is a loop in the linked list, the two pointers will eventually meet at some node.
To find the starting point of the loop, we reset one of the pointers to the head of the linked list and ...
based on 2 interviews
Interview experience
Support Specialist
363
salaries
| ₹0 L/yr - ₹0 L/yr |
Financial Crime Analyst
92
salaries
| ₹0 L/yr - ₹0 L/yr |
Strategy and Operations Manager
84
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
79
salaries
| ₹0 L/yr - ₹0 L/yr |
Financial Analyst
50
salaries
| ₹0 L/yr - ₹0 L/yr |
Paytm
PhonePe
Mobikwik
Payed