AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
RevDau Interview Questions, Process, and Tips
Top RevDau Interview Questions and Answers
- Q1. What is Kpi? How can we monitor a serverasked in Data Engineer interview
- Q2. How to track 1 million records being generated online every 5 minutesasked in Data Analyst interview
- Q3. What are KPI’s, how to monitor an applicationasked in Associate Data Engineer interview
RevDau Interview Experiences
3 interviews found
Anonymous
Selected
I applied via Referral and was interviewed in Jan 2024. There was 1 interview round.
(3 Questions)
- Q1. Data types in python
- Ans.
Python supports various data types including integers, floats, strings, lists, tuples, dictionaries, and more.
Integers: whole numbers without decimals (e.g. 5, -10)
Floats: numbers with decimals (e.g. 3.14, -0.5)
Strings: sequences of characters enclosed in quotes (e.g. 'hello', '123')
Lists: ordered collections of items (e.g. [1, 2, 3])
Tuples: ordered, immutable collections of items (e.g. (1, 2, 3))
Dictionaries: unordere...
- Q2. Stack and queue difference
- Ans.
Stack is Last In First Out (LIFO) data structure, while queue is First In First Out (FIFO) data structure.
Stack is like a stack of plates, where you can only take the top plate off first.
Queue is like a line at a grocery store, where the first person in line gets served first.
Stack operations include push and pop, while queue operations include enqueue and dequeue.
- Q3. What is Kpi? How can we monitor a server
- Ans.
KPI stands for Key Performance Indicator. Servers can be monitored using tools like Nagios, Zabbix, or Prometheus.
KPI is a measurable value that demonstrates how effectively a company is achieving key business objectives.
To monitor a server, tools like Nagios, Zabbix, or Prometheus can be used to track metrics such as CPU usage, memory usage, disk space, and network traffic.
Setting up alerts based on predefined thresho...
Interview Preparation Tips
Skills evaluated in this interview
Data Engineer Interview Questions asked at other Companies
Selected
(2 Questions)
- Q1. Stack and queue difference and use cases
- Ans.
Stack and queue are data structures with different principles and use cases.
Stack is Last In First Out (LIFO) while queue is First In First Out (FIFO)
Stack is used for function calls, undo operations, and backtracking
Queue is used in BFS algorithms, printer queues, and messaging systems
- Q2. What are KPI’s, how to monitor an application
- Ans.
KPIs are Key Performance Indicators used to measure the success of an application. Monitoring can be done through tools like monitoring software and dashboards.
KPIs are specific metrics used to evaluate the performance of an application
Monitoring can be done using monitoring software like Nagios, Prometheus, or New Relic
Dashboards can be created to visualize KPIs in real-time
Examples of KPIs for an application could in
Skills evaluated in this interview
Associate Data Engineer Interview Questions asked at other Companies
I applied via Referral and was interviewed in Oct 2022. There were 2 interview rounds.
(2 Questions)
- Q1. Stack and queue difference
- Ans.
Stack is LIFO and Queue is FIFO data structure.
Stack is a linear data structure where insertion and deletion happen at one end called the top.
Queue is a linear data structure where insertion happens at the rear and deletion happens at the front.
Stack follows Last In First Out (LIFO) principle while Queue follows First In First Out (FIFO) principle.
Stack is used in recursive function calls, undo-redo operations, and bac...
- Q2. How to track 1 million records being generated online every 5 minutes
- Ans.
Use a distributed system with real-time processing to track 1 million records generated every 5 minutes.
Implement a distributed system like Apache Kafka or Apache Spark to handle the large volume of data.
Use real-time processing to ensure that the data is analyzed and tracked as soon as it is generated.
Consider using cloud-based solutions like AWS or Google Cloud Platform for scalability and cost-effectiveness.
Implemen...
Interview Preparation Tips
- Basic data structures,
- Rdbms
- Sql Basic queries
Skills evaluated in this interview
Data Analyst Interview Questions asked at other Companies
Interview questions from similar companies
I applied via Campus Placement and was interviewed in Jul 2020. There were 4 interview rounds.
Interview Questionnaire
3 Questions
- Q1. Mostly questions were asked from sql,joins were more focussed
- Q2. Puzzle mostly from gfg were asked involving analytics skills
- Q3. Guesstimates could also be asked.
Interview Preparation Tips
I appeared for an interview before Sep 2020.
(1 Question)
Round duration - 90 minutes
Round difficulty - Easy
This was MCQ+Coding round.
- Q1. How can you check if two strings are anagrams of each other?
- Ans.
Check if two strings are anagrams by comparing the sorted versions of the strings.
Sort both strings and compare if they are equal.
Use a hashmap to store the frequency of characters in each string and compare the maps.
Ignore spaces and punctuation when comparing the strings.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Interview Preparation Tips
Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.
Add projects and Internships if you have done any and add only those things which you really know.
Final outcome of the interviewSelectedSkills evaluated in this interview
I appeared for an interview before Sep 2020.
(1 Question)
Round duration - 90 Minutes
Round difficulty - Medium
Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.
- Q1.
Detect Cycle in a Directed Graph
You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...
- Ans.
Detect cycle in a directed graph using depth-first search (DFS) algorithm.
Use DFS to traverse the graph and detect back edges indicating a cycle.
Maintain a visited array to keep track of visited nodes during traversal.
If a node is visited again during traversal and it is not the parent node, then a cycle exists.
Return true if a cycle is detected, false otherwise.
(1 Question)
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview
- Q1.
Next Smallest Palindrome Problem Statement
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
Explanation:
You are given a number in string format, a...
- Ans.
Find the next smallest palindrome greater than a given number represented as a string.
Convert the string to an integer, find the next greater palindrome, and convert it back to a string.
Handle cases where the number is a palindrome or has all digits as '9'.
Consider both odd and even length numbers when finding the next palindrome.
(1 Question)
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 11:00 am. Interview went well.
- Q1.
Boundary Traversal of a Binary Tree
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
Input:
The first line ... - Ans.
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
Traverse the left boundary nodes in a top-down manner
Traverse the leaf nodes from left to right
Traverse the right boundary nodes in a bottom-up manner
Handle cases where duplicates occur in the boundary nodes
Implement the function without printing as printing is already managed
Interview Preparation Tips
Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. Learn them by heart.
Tip 2 : For Web.Development Try to learn full stack development. See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.
Tip 1 : Always try to make it a single page
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.
Skills evaluated in this interview
SAMKIT JAIN
I appeared for an interview in Aug 2017.
Interview Questionnaire
7 Questions
- Q1. Implement Merge Sort.
- Ans.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
- Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
- Ans.
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
- Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
- Ans.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
- Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
- Ans.
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
- Q5. Implement AVL Tree.
- Ans.
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
- Q6. Minimum number of squares whose sum equals to given number n.
- Ans.
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
- Q7. Insertion sort for a singly linked list.
- Ans.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
Interview Preparation Tips
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22
Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.
Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.
College Name: The LNM Institute Of Information Technology, Jaipur
Skills evaluated in this interview
I applied via Naukri.com and was interviewed in May 2019. There were 4 interview rounds.
Interview Questionnaire
1 Question
- Q1. They asked about How have you developed Business in your Ex Company
Interview Preparation Tips
I applied via Company Website and was interviewed in May 2019. There were 5 interview rounds.
Interview Questionnaire
1 Question
- Q1. SQL, Business cases
Interview Preparation Tips
I applied via Company Website and was interviewed in May 2019. There were 4 interview rounds.
Interview Questionnaire
5 Questions
- Q1. About your self
- Q2. About your previous company and job profile
- Q3. How do you relate your previous job profile with the profile you are applying
- Q4. Any thing extra ordinary you have done in your previous company (s) that has changed your business
- Ans.
Implemented a new customer feedback system that increased customer satisfaction by 20%
Implemented a new customer feedback system to gather insights and improve customer experience
Analyzed feedback data to identify common issues and areas for improvement
Implemented changes based on feedback to address customer concerns and enhance overall satisfaction
Trained team members on how to effectively use the new system and inte...
- Q5. Hobbies and all
Interview Preparation Tips
Have proper knowledge about your work experience
Make your CV precis and do adhere to it
Be honest
RevDau Interview FAQs
Tell us how to improve this page.
Interview Questions for Popular Designations
- Intern Interview Questions
- Business Analyst Interview Questions
- Senior Associate Interview Questions
- Senior Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Data Analyst Interview Questions
- System Engineer Interview Questions
- Show more
RevDau Interview Process
based on 3 interviews
Interview experience
Interview Questions from Similar Companies
|
Software Engineer
3
salaries
|  ₹3.1 L/yr - ₹8 L/yr |
|
Application Support Engineer
3
salaries
| ₹2.6 L/yr - ₹3 L/yr |
Paytm
Flipkart
Amazon
Snapdeal
- Home >
- Interviews >
- RevDau Interview Questions
