i
Revolut
Filter interviews by
Be the first one to contribute and help others!
I applied via Job Fair and was interviewed before Feb 2021. There were 2 interview rounds.
Can't Disclose
I applied via Job Portal and was interviewed in Dec 2023. There was 1 interview round.
I applied via Campus Placement and was interviewed in Jan 2022. There were 2 interview rounds.
Two Coding questions were asked -
1- Graph Connectivity with threshold
2-Find length of longest subsequence of one string which is substring of another string
These are three different programming problems that require different approaches to solve.
N-Queens: placing N queens on an NxN chessboard so that no two queens threaten each other
Snake and Ladder Problem: finding the minimum number of dice rolls to reach the end of a board with snakes and ladders
Second Most Repeated Word in a Sequence: finding the second most frequently occurring word in a given sequence of words
Replace each element with the greatest element on its right side in the array
Loop through the array from right to left
Keep track of the maximum element seen so far
Replace the current element with the maximum element seen so far
Return the modified array
The Special Keyboard DP Problem involves optimizing key presses for a specific output using dynamic programming.
Identify the target string and the available keys on the keyboard.
Use dynamic programming to calculate the minimum key presses needed.
Consider edge cases, such as repeated characters or missing keys.
Example: If the target is 'abc' and keys are 'a', 'b', 'c', the answer is 3.
Example: If the target is 'aaa' and...
I applied via Campus Placement and was interviewed in Jul 2022. There were 4 interview rounds.
The test was entirely MCQ based and the entire paper was on devops. Question standard was average.
It was campus through internship
I applied via Recruitment Consulltant and was interviewed in Dec 2023. There was 1 interview round.
I am a recent graduate with a degree in Computer Science and a passion for coding and problem-solving.
Graduated with a degree in Computer Science
Passionate about coding and problem-solving
Completed internships at tech companies
Participated in coding competitions
2 hours HackerEarth coding round
HackerEarth test medium level question
I applied via Campus Placement
On spot topic were given by the interviewer
Sorting algorithms are used to arrange elements in a specific order.
Sorting algorithms can be categorized as comparison-based or non-comparison-based.
Examples of sorting algorithms include Bubble Sort, Merge Sort, and Quick Sort.
Efficiency of sorting algorithms is measured in terms of time complexity and space complexity.
To find the second highest salary, we can use various methods like sorting or using a set to eliminate duplicates.
Use a SQL query: SELECT DISTINCT salary FROM employees ORDER BY salary DESC LIMIT 1 OFFSET 1;
In Python, convert the salary list to a set, sort it, and access the second last element.
Example: salaries = [3000, 2000, 4000, 4000]; sorted(set(salaries))[-2] gives 3000.
Consider edge cases: If there is only one u...
Support Specialist
426
salaries
| ₹4.3 L/yr - ₹9 L/yr |
Financial Crime Analyst
143
salaries
| ₹4 L/yr - ₹13.1 L/yr |
Strategy and Operations Manager
113
salaries
| ₹18 L/yr - ₹58.3 L/yr |
Team Lead
91
salaries
| ₹8 L/yr - ₹12.5 L/yr |
Financial Analyst
58
salaries
| ₹5.5 L/yr - ₹13.6 L/yr |
Paytm
FIS
Fiserv
KFintech