AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
RedoQ
Compare
Filter interviews by
RedoQ Android Developer Interview Questions and Answers
RedoQ Android Developer Interview Experiences
1 interview found
Anonymous
Selected
I applied via Approached by Company and was interviewed in Jul 2023. There was 1 interview round.
(3 Questions)
- Q1. Android activity lifecycle.
- Q2. Basic OOPS concept questions like, different between interface and abstract class
- Q3. Android related questions like Intent.
Interview Preparation Tips
- Opps
- Android
Interview questions from similar companies
I appeared for an interview before Jan 2021.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
It was conducted in Hacker rank which consisted of 10 aptitude questions that included C, C++, Java MCQ. 2 programming questions were also given.
- Q1.
Minimum Cost Path Problem Statement
Given an
N x Mmatrix filled with integers, determine the minimum sum obtainable from a path that starts at a specified cell(x, y)and ends at the top left corner of t... - Ans.
The problem involves finding the minimum sum path from a specified cell to the top left corner of a matrix.
Start from the specified cell and calculate the minimum sum path to reach the top left corner using dynamic programming.
Consider the three possible moves: down, right, and down-right diagonal.
Keep track of the minimum sum at each cell and update it based on the minimum of the three possible moves.
Finally, the mini...
- Q2.
Balanced Parentheses Combinations
Given an integer
Nrepresenting the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.Explanati...
- Ans.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use backtracking to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Recursively generate combinations by adding open parentheses if there are remaining, and closing parentheses if the number of open parentheses is greater than the number of clo...
(4 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on data structures, oops and networking.
- Q1.
Character Counting Challenge
Create a program that counts and prints the total number of specific character types from user input. Specifically, you need to count lowercase English alphabets, numeric digi...
- Ans.
Create a program to count lowercase alphabets, digits, and white spaces from user input until '$' is encountered.
Read characters from input stream until '$' is encountered
Count lowercase alphabets, digits, and white spaces separately
Print the counts of each character type as three integers separated by spaces
- Q2.
K Largest Elements Problem Statement
Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.
Input:
The fir... - Ans.
Find K largest elements in an unsorted array and return them in non-decreasing order.
Sort the array in non-decreasing order.
Return the last K elements of the sorted array.
- Q3. How can you check whether you have an internet connection on your system?
- Ans.
To check internet connection on a system, you can use various methods like pinging a website or checking network status.
Use ping command to check connectivity to a website (e.g. ping www.google.com)
Check network status using network settings or command line tools
Try accessing a website or online service to verify internet connection
- Q4. What happens when you type a URL in a web browser?
- Ans.
When you type a URL in a web browser, the browser sends a request to the server hosting the website, which then responds with the necessary files to display the webpage.
Browser checks cache for DNS resolution
If not found, browser sends a DNS query to resolve the domain name to an IP address
Browser establishes a TCP connection with the server
Browser sends an HTTP request to the server for the webpage
Server processes the...
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on data structures, oops and networking.
- Q1.
Counting Sort Problem Statement
Ninja is learning about sorting algorithms, specifically those that do not rely on comparisons. Can you help Ninja implement the counting sort algorithm?
Example:
Input:
... - Ans.
Implement counting sort algorithm to sort an array of integers without comparisons.
Count the frequency of each element in the input array.
Calculate the prefix sum of frequencies to determine the position of each element in the sorted array.
Place each element in its correct position based on the prefix sum.
Time complexity of counting sort is O(n+k), where n is the number of elements and k is the range of input.
Example: ...
- Q2. What are the applications of the Fibonacci series in real life?
- Ans.
The Fibonacci series has applications in various fields such as mathematics, computer science, art, and nature.
Used in algorithms for optimization problems and dynamic programming.
Found in nature, such as the arrangement of leaves on a stem, the branching of trees, and the spiral shapes of shells.
Applied in financial markets for predicting stock prices and analyzing market trends.
Utilized in art and design for creating
Round duration - 30 minutes
Round difficulty - Easy
HR round where the interviewer asked questions to know more about me.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I appeared for an interview before Jan 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview Round with questions based on Data structures, OOPS and SQL.
- Q1.
Delete a Node from a Linked List
You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.
Input:
The first line co... - Ans.
Implement a function to delete a node from a linked list at a specified position.
Traverse the linked list to find the node at the specified position.
Update the pointers of the previous and next nodes to skip the node to be deleted.
Handle edge cases such as deleting the head or tail of the linked list.
Ensure to free the memory of the deleted node to avoid memory leaks.
- Q2. Write an SQL query to find the nth highest salary.
- Ans.
SQL query to find the nth highest salary
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT and OFFSET clauses to skip the first n-1 highest salaries
Combine the above steps in a single query to find the nth highest salary
- Q3. Can you explain the concepts of Object-Oriented Programming (OOP)?
- Ans.
OOP is a programming paradigm based on the concept of objects, which can contain data in the form of fields and code in the form of procedures.
OOP focuses on creating objects that interact with each other to solve problems.
Key concepts include encapsulation, inheritance, and polymorphism.
Encapsulation involves bundling data and methods that operate on the data into a single unit.
Inheritance allows classes to inherit at...
(4 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Was asked me about my favorite technologies, What i liked about Facebook. And asked me to design a cinema ticket reservation web site like the one satyam has.
- Q1.
Kth Largest Element Problem
Given an array containing
Ndistinct positive integers and a numberK, determine the Kth largest element in the array.Example:
Input:
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...
- Ans.
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order and return the Kth element.
Handle multiple test cases efficiently.
Ensure all elements in the array are distinct.
- Q2. What are virtual functions?
- Ans.
Virtual functions are functions in a base class that are overridden in derived classes to achieve runtime polymorphism.
Virtual functions are declared in a base class with the 'virtual' keyword.
They are overridden in derived classes using the 'override' keyword.
They allow a function to be called based on the runtime type of an object.
Virtual functions enable dynamic binding and late binding in C++.
Example: virtual void ...
- Q3. Design a Cinema Ticket Reservation System.
- Ans.
Design a Cinema Ticket Reservation System
Use a database to store movie information, showtimes, and seat availability
Allow users to search for movies, select showtimes, and choose seats
Implement a payment system for ticket purchases
Send confirmation emails with QR codes for ticket validation
- Q4. In how many attempts can you find a defective ball among 10 given balls using a two-pan balance scale?
- Ans.
You can find a defective ball among 10 given balls in 2 attempts using a two-pan balance scale.
Divide the 10 balls into two groups of 5 each.
Weigh the two groups on the balance scale.
If one group is heavier, it contains the defective ball. If they are equal, the defective ball is in the remaining 5 balls.
Divide the group of 5 balls with the defective one into two groups of 2 and 3 balls.
Weigh the two groups on the bala...
(1 Question)
Round duration - 30 minutes
Round difficulty - Easy
HR round that lasted for about 30 minutes. The interviewer asked me questions to know more about me and a puzzle.
- Q1. Can you tell me about your projects and your extracurricular activities?
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I appeared for an interview before Jan 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
I couldn't find an optimal approach to the first question, so she skipped that question and proceeded to next questions. Remaining questions I have answered satisfactorily.
- Q1.
Subset Sum Equal To K Problem Statement
Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Provide
trueif such a subset exists, otherwise r... - Ans.
Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Use dynamic programming to solve this problem efficiently
Create a 2D array to store if a subset with a particular sum exists
Iterate through the array and update the 2D array accordingly
Check if the value at the end of the iteration is true for the given K
- Q2.
BFS Traversal in a Graph
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
- Ans.
BFS traversal in a disconnected graph starting from vertex 0.
Implement BFS algorithm to traverse the graph starting from vertex 0.
Use a queue to keep track of visited nodes and their neighbors.
Ensure to print the traversal sequence in the correct order.
Handle disconnected components by checking for unvisited nodes.
Follow the BFS approach of exploring neighbors before moving to the next level.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
I told that my strength is problem solving and I can always find a way when there is a bottle-neck. Gave some examples of my experiences while doing my assignments.
- Q1.
Replace Spaces in a String
Given a string
STRconsisting of words separated by spaces, your task is to replace all spaces between words with the characters "@40".Input:
The first line contains an integ... - Ans.
Replace spaces in a string with '@40'.
Iterate through each character in the string
Replace spaces with '@40'
Return the modified string
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Pranav Bhat Thirthahalli
Interview Questionnaire
14 Questions
- Q1. What is race condition and how can it be eliminated
- Ans.
Race condition is a situation where multiple threads/processes access and manipulate shared data simultaneously.
It can be eliminated by using synchronization techniques like locks, semaphores, and mutexes.
Another way is to use atomic operations that ensure the data is accessed and modified atomically.
Using thread-safe data structures can also prevent race conditions.
Example: Two threads trying to increment a shared var...
- Q2. What is JCube?
- Ans.
JCube is a Java library for creating and manipulating Rubik's Cube puzzles.
JCube provides classes for representing Rubik's Cube puzzles and algorithms for solving them.
It supports various cube sizes and can generate random scrambles.
JCube can be used in Java applications or as a standalone command-line tool.
It is open source and available on GitHub.
- Q3. What is regression testing?
- Ans.
Regression testing is the process of testing changes made to a software application to ensure that existing functionality still works.
It is performed after making changes to the software
It ensures that existing functionality is not affected by the changes
It helps to catch any defects or bugs that may have been introduced
It can be automated using testing tools
Examples include retesting after bug fixes, testing after new
- Q4. Discussion on different sorting techniques
- Q5. Discussion on SQL and SQL optimisaion
- Q6. Software engineering principles
- Ans.
Software engineering principles are the best practices and guidelines for developing high-quality software.
Software should be designed with modularity and scalability in mind.
Code should be well-documented and easy to read.
Testing and debugging should be an integral part of the development process.
Version control should be used to manage code changes.
Security and privacy should be considered throughout the development
- Q7. Java and OOP's question
- Q8. Define Singleton class
- Ans.
A Singleton class is a class that can only have one instance at a time.
It restricts the instantiation of a class to a single object.
It provides a global point of access to that instance.
It is often used in situations where a single object is required to coordinate actions across a system.
Example: Database connection manager, Configuration manager, Logger manager.
- Q9. Explain Testing principles and Design principles
- Ans.
Testing principles ensure software quality, while design principles guide software development.
Testing principles include unit testing, integration testing, and acceptance testing.
Design principles include SOLID, DRY, and KISS.
Testing principles ensure that software meets requirements and is free of defects.
Design principles guide software development to be modular, maintainable, and scalable.
- Q10. Types of machine learning and methods and examples, they may give you a situation and ask you which technique is good and why
- Q11. Why choose you for VISA?
- Ans.
I have the necessary skills, experience, and passion to contribute to VISA's success.
I have a strong background in software development and have worked on projects similar to those at VISA.
I am a quick learner and can adapt to new technologies and programming languages easily.
I am passionate about creating high-quality software that meets the needs of users and exceeds their expectations.
I am a team player and can work...
- Q12. Which profile is good for you?
- Ans.
A profile that challenges me to learn and grow while allowing me to contribute to a team.
A position that encourages continuous learning and development
A role that allows me to collaborate with a team and contribute to projects
A company culture that aligns with my values and work ethic
- Q13. About the work culture at VISA Inc
- Q14. If u already have a placement, why this company
- Ans.
I am interested in exploring new opportunities and challenges that this company can offer.
I am impressed with the company's reputation and growth potential.
I am excited about the projects and technologies this company is working on.
I believe this company can provide me with a better work-life balance and career growth opportunities.
I am looking for a company culture that aligns with my values and goals.
I am open to exp...
Interview Preparation Tips
Experience: Online Test on mettl.com
- 2 coding questions ( 15*2 = 30 marks ) - Moderate level
- 10 MCQs on Programming and Java ( 1*10 = 10)
- 6 MCQs on Machine Learning and Hadoop ( 1*6 = 6 )
- 6 MCQs on Computer Networks ( 1*6 = 6 )
- 6 MCQs on Computer Infrastructure and Architecture ( 1*6 = 6)
- 6 MCQs on Application security and Cryptography ( 1*6 = 6)
15 shortlisted from here including 8 B.Techs and 7 M.Techs for F2F interviews, which were taken by VISA employees from their US and Singapore offices( since they don't have any office at India ).
Round: Technical Interview
Experience: They may give you a situation and ask you to explain which Software engineering principles will you use. They ask you how will you explain the concept of stacks and queues to a 7 year old, or to a granny, so as to encourage programming(like seriously ? )
General Tips: Nothing as such, since this was my second on-campus placement, I had good experience of interviews.
Keep your fundamentals in all computer science subjects open. Unlike other companies they don't focus much on coding alone. The only other company which also looks at perfection in all computer science aspects is Xerox Research Center India.
Challenging and Equally rewarding, but seriously a unique experience with no much tension
Skills:
College Name: NIT Surathkal
Skills evaluated in this interview
Interview Questionnaire
1 Question
- Q1. Tell me about your project ( written in language)?
- Ans.
Developed a web application using Python and Django framework for managing inventory and sales.
Used Python programming language for backend development
Implemented Django framework for building web application
Designed database schema for inventory and sales data
Integrated frontend using HTML, CSS, and JavaScript
Implemented user authentication and authorization features
Interview Preparation Tips
Experience: They asked 3 question on data structures .
1.Merging linekd list
2 and 3 BST related
Duration: 1 hour
Total Questions: 3
Round: Technical Interview
Experience: Interviewer asked me to explain projects which I had mentioned in Resume. Then He asked me to implement a problem on basis of my project.
It was telephonic round.
CGPA and my project mattered.
College Name: IIT Roorkee
Arpan Paul
I applied via Campus Placement and was interviewed in Sep 2016. There were 4 interview rounds.
Interview Questionnaire
7 Questions
- Q1. Tell me about yourself
- Ans.
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development technologies
Strong problem-solving skills
Team player with excellent communication skills
- Q2. Explain your resume
- Ans.
My resume highlights my experience in software development and showcases my skills in various programming languages and technologies.
Worked on multiple projects using Java, Python, and C++
Developed web applications using HTML, CSS, and JavaScript
Experience with databases such as MySQL and MongoDB
Familiarity with Agile methodology and version control systems like Git
Participated in hackathons and coding competitions
- Q3. Questions on projects mentioned
- Q4. Why do you want to go for VISA?
- Ans.
I want to go for VISA to explore new opportunities and gain international experience.
To gain exposure to different cultures and work environments
To expand my skill set and learn new technologies
To work on challenging projects and contribute to the growth of the company
To build a global network of professionals and enhance my career prospects
- Q5. Code a basic binary tree
- Ans.
A binary tree is a data structure in which each node has at most two children.
Start with a root node
Each node has a left and right child
Nodes can be added or removed
Traversal can be done in-order, pre-order, or post-order
- Q6. Code a basic linked list
- Ans.
Code a basic linked list
Create a Node class with data and next pointer
Create a LinkedList class with head pointer
Implement methods to add, delete, and search nodes in the linked list
- Q7. Code a circular linked list
- Ans.
A circular linked list is a data structure where the last node points back to the first node, forming a loop.
Create a Node class with data and next pointer
Initialize the head node and set its next pointer to itself
To add a node, create a new node and set its next pointer to the head node's next pointer, then update the head node's next pointer to the new node
To traverse the circular linked list, start from the head nod...
Interview Preparation Tips
Experience: It was a programming test hosted on hackerrank. A total of 3 questions. I could solve only one of them. That too only a few test cases. Still got shortlisted for the next round. :)
Tips: Do practice a few challenges on programming platforms. Brush up your programming knowledge.
Total Questions: 3
Round: Technical Interview
Experience: It was an HR cum Technical round for me as I came from a non CS background. I was able to convince them I am a perfect fit for VISA
Tips: Do prepare your resume well. If you have coding projects, make sure you are clear with whatever you write. They might quiz you hard on them. Strong knowledge on Data structures and Algorithms will give you an edge.
Skills: Presentation Of Facts In Resume, Basic Coding, Communication, Algorithms And Data Structures
Duration: 2
College Name: IIT Madras
Funny Moments: I am a part of the sponsorship team of our technical and VISA was an associate sponsor for the same the previous year. Hence I had specified this fact in my interview. :P
Skills evaluated in this interview
I appeared for an interview in Sep 2020.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
3 coding Questions:
1st : Easy question based on simple loop iteration
2nd :Medium level Dp question
3rd : Medium level tree question(where we were not just required to complete the tree function but to build whole bst from
scratch)
It was conducted from 1:30 - 3:00 pm.
The coding platform was very good (as auto indentation and auto completion of brackets were there)
having camera on.
- Q1.
Selling Stock Problem Statement
You are given the stock prices for
Ndays. Each dayisignifies the price of a stock on that day. Your goal is to calculate the maximum profit that can be achieved by buyin... - Ans.
Calculate maximum profit by buying and selling stocks on different days.
Iterate through the stock prices and buy on the day when the price is lower than the next day's price, and sell on the day when the price is higher than the next day's price.
Keep track of the total profit earned by summing up the differences between buying and selling prices.
Return the total profit as the maximum profit that can be earned.
- Q2.
Minimum Time to Burn a Binary Tree from a Leaf Node
You are given a binary tree with 'N' unique nodes, and a specific start node from where the fire will begin. The task is to determine the time in minute...
- Ans.
The task is to determine the time in minutes required to burn the entire binary tree starting from a given node.
Traverse the tree from the given start node to calculate the time taken to burn the entire tree.
Use a queue to keep track of nodes and their burning time.
Increment the burning time for each level of nodes until the entire tree is burned.
(1 Question)
Round duration - 75-80 minutes
Round difficulty - Hard
This was a completely technical coding round where I was asked to solve the problems of data structures.
The codepad where i was asked to code was fine,
The interviewer was very friendly and was helpful and understanding.
I also asked him about his work and experience in the company and some other questions.
- Q1.
Matrix Maximum Path Sum Problem
Given an N*M matrix filled with integer numbers, your task is to find the maximum path sum starting from any cell in the first row and ending at any cell in the last row. Y...
Round duration - 45 minutes
Round difficulty - Easy
It was held on Gmeet platform
The interviewer was very experienced person and was very nice too.
He made me comfortable by first introducing himself in a very detailed way and then asking me mine introduction
Since I feel that his internet connection was not very good so he turned off his camera but I decided not to turn off mine as in online interviews your face reviles your confidence
the interviewer mostly asked me questions about my interests in technical field and the project that I have done
Interview Preparation Tips
Tip 1 : Practice atleast(easy and medium questions from leetcode under(Top Interview Questions)) and all the questions from Gfg under(must to do coding questions for interviews))
Tip 2 : Don't learn each and every question you solved but try to solve question in a way that you can solve its variation during interviews
Tip 3 : Do one project(one is enough) which you can explain with full technical details (why you used this technology, and all logics you applied in implementation)
Tip 4: Atleast read the round 1 (Coding round) Archives from (Geeks for geeks or Glassdoor). To get your mind prepared for the types of questions that company usually asks.(Coding round is the toughest Step in the whole Process to clear)
Tip 1: Have at least one project which you have made yourself and you should know all the technical questions related to that project (I feel project domain hardly matters like web development or android or ML/AI)
Tip 2: You should Put only those skills in resume :
1. Which the company requires (eg if you know company doesn't require Networking domain knowledge so
don't include it unnecessary if you are not much confident in it)
2. For on campus internships resume shortlisting is very easy so don't add anything unnecessary which might
cause you pain during interview.
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(3 Questions)
Round duration - 70 minutes
Round difficulty - Medium
Timing: 6:00 pm
3 coding questions of medium to be solved in 70 minutes.
- Q1.
Maximum Subarray Sum Problem Statement
Given an array of numbers, the task is to find the maximum sum of any contiguous subarray of the array.
Input:
The first line of input contains the size of the arr...
- Ans.
Find the maximum sum of any contiguous subarray in an array of numbers in O(N) time.
Use Kadane's algorithm to find the maximum subarray sum in O(N) time.
Initialize two variables: maxEndingHere and maxSoFar to keep track of the maximum sum.
Iterate through the array and update the variables accordingly.
Return the maxSoFar as the result.
- Q2.
Closest Leaf in a Binary Tree
Ninja is stuck in a maze represented as a binary tree, and he is at a specific node ‘X’. Help Ninja find the shortest path to the nearest leaf node, which is considered an ex...
- Ans.
Find the minimum distance from a given node to the nearest leaf node in a binary tree.
Traverse the binary tree from the given node 'X' to find the nearest leaf node.
Use a queue for level order traversal to efficiently find the nearest leaf node.
Calculate the distance from node 'X' to each leaf node and return the minimum distance.
- Q3.
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
- 0 - representing an empty cell
- 1 - representing a fre...
- Ans.
Find the minimum time required to rot all fresh oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process of oranges.
Track the time taken to rot all fresh oranges and return the result.
If any fresh oranges remain after simulation, return -1 as it is impossible to rot all oranges.
(1 Question)
Round duration - 45 minutes
Round difficulty - Medium
Timing: 2:00 pm
Online round over google meet, code at google docs.
The interviewer was friendly, encouraging, and humble.
- Q1.
Smallest Integer Not Representable as Subset Sum
Given a non-decreasing sorted array
ARRofNpositive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from... - Ans.
The task is to find the smallest positive integer value that cannot be represented as a sum of elements of any proper subset of the given array.
The array is sorted in non-decreasing order, so we can iterate through the array and keep track of the maximum sum we can form.
If the current element is greater than the maximum sum + 1, then the maximum sum + 1 is the smallest positive integer that cannot be represented.
If all...
(1 Question)
Round duration - 45 minutes
Round difficulty - Medium
Timing: 2:00 pm
Online round over google meet, code at google docs.
The interviewer was not speaking much. It was a bit strange.
- Q1.
Bottom Right View of Binary Tree Problem Statement
Your task is to identify and return the bottom right view of a given binary tree.
This involves viewing the binary tree from an angle of 45 degrees from...
- Ans.
Identify and return the bottom right view of a given binary tree by viewing it from an angle of 45 degrees from the bottom right side.
Traverse the binary tree in a right-to-left manner and keep track of the last node encountered at each level.
Use a queue for level order traversal and update the result array with the last node at each level.
Return the result array sorted in ascending order as the bottom right view of th
Round duration - 30 Minutes
Round difficulty - Easy
Timing: 7:00 pm
The interviewer was friendly and in a bit of a hurry.
Interview Preparation Tips
Tip 1 : DSA is the key. Starting from scratch, one can become proficients in a couple of months.
Tip 2 : Solve questions just a bit outside your comfort zone. Solve too easy to too hard questions is not of any use.
Tip 3 : Be consistent, make a habit of following good coding practices.
Tip 4 : Get to know the ins and out of your projects. You must be very confident while explaining those.
Tip 5 : Don't just directly to system-design, brush up on OOPS principles, networks, OS, DBMS before that.
Tip 1: Keep it crisp and to the point. Make bullet points.
Tip 2: Bold the things you want to be paid attention to. Use numbers rather than vague sentences.
Tip 3: Only put the things you are confident about.
Tip 4: Don't put things irrelevant to the job, it only dilutes the main content.
Skills evaluated in this interview
Interview Questionnaire
1 Question
- Q1. Oops Concepts, MVC, WEB API, SQL, Project related questions
RedoQ Interview FAQs
Tell us how to improve this page.
Interview Questions for Popular Designations
- Senior Android Developer Interview Questions
- Senior Android Application Developer Interview Questions
- Android Mobile Application Developer Interview Questions
- Junior Android Developer Interview Questions
- IOS Developer Interview Questions
- React Native Developer Interview Questions
- Senior IOS Developer Interview Questions
- Mobile Application Developer Interview Questions
- Show more
RedoQ Android Developer Interview Process
based on 1 interview
Interview experience
Android Developer Interview Questions from Similar Companies
RedoQ Android Developer Reviews and Ratings
based on 1 review
Rating in categories
|
Graphic Designer
12
salaries
|  ₹1.5 L/yr - ₹5.4 L/yr |
|
Technical Support Executive
5
salaries
| ₹1.7 L/yr - ₹2.4 L/yr |
|
Flutter Developer
5
salaries
| ₹3 L/yr - ₹7.2 L/yr |
|
SEO Executive
4
salaries
| ₹2.3 L/yr - ₹4 L/yr |
|
Android Developer
4
salaries
| ₹2 L/yr - ₹12 L/yr |
Paytm
Fiserv
PhonePe
KFintech
- Home >
- Interviews >
- RedoQ Interview Questions >
- RedoQ Android Developer Interview Questions
