Revolut Intern Interview Questions and Answers

Q1. Sorting algorithm
Ans. 
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.
Answered by AI
Add your answer
Q2. Secod highest salary
Add your answer

Q1. Tell me about yourself?
Add your answer
Q2. Based on resume and past experiences
Add your answer

Q1. Tell me about yourself
Ans. 
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
Answered by AI
Add your answer

Q1. How well do you know python
Ans. 
I have a strong understanding of Python and have used it extensively in various projects.
• Proficient in Python syntax and data structures

• Experience with popular libraries like NumPy, Pandas, and Matplotlib

• Developed web applications using Django framework

• Used Python for automation and scripting tasks
Answered by AI
Add your answer

2 hours HackerEarth coding round

Q1. Some medium level of question
Add your answer

HackerEarth test medium level question

On spot topic were given by the interviewer

Q1. OOPS ,DBMS ,OS, CN concepts
Add your answer
Q2. Data structures and codes based on it
Add your answer

Easy selected for next process

Q1. Give your introduction , tech, other dsa
Add your answer

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

Q1. N-Queens, Snake and Ladder Problem, Second Most repeated word in a sequence
Ans. 
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
Answered by AI
Add your answer
Q2. Replace every element with the greatest element on the right side
Ans. 
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
Answered by AI
Add your answer
Q3. Special Keyboard DP Problem
Add your answer