Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Lybrate Android Developer Interview Questions and Answers

Updated 17 Oct 2020

Lybrate Android Developer Interview Experiences

1 interview found

Interview Questionnaire 

2 Questions

  • Q1. Round 1: Why java doesn't support multiple inheritance, interface vs abstract class, final vs static keyword, Launch modes, Difference between Constraint layout and Relative layout, Recycler view vs List v...
  • Q2. Round 2 : LinkedList, Binary search, Complexities, SQL queries : DISTINCT, JOINS, OOPS concepts.

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Jan 2024. There were 3 interview rounds.

Round 1 - Aptitude Test 

Aptitude test was simple.

Round 2 - Technical 

(1 Question)

  • Q1. Asked 2 questions from recursion.
Round 3 - HR 

(1 Question)

  • Q1. Simple HR round.
Interview experience
3
Average
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Oct 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Coding Test 

3 Coding question medium level

Round 3 - Technical 

(1 Question)

  • Q1. Asked 3 coding queston and some basis CS questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Easy interview

Interview Questionnaire 

2 Questions

  • Q1. About sdlc
  • Q2. About web development
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Properly align and format text in your resume. A recruiter will have to spend more time reading poorly aligned text, leading to high chances of rejection.
View all Resume tips
Round 2 - Technical 

(2 Questions)

  • Q1. Basic resume based questions
  • Q2. Explain your internship experience
Round 3 - HR 

(1 Question)

  • Q1. Basic resume based questions
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-

I applied via Referral and was interviewed in Oct 2023. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Do not use an unprofessional email address such as cool_boy@email.com. It shows a lack of professionalism by the candidate.
View all Resume tips
Round 2 - Aptitude Test 

NEED TO QUALIFY IN THIS TEST

Round 3 - Coding Test 

NEED TO QUALIFY THIS TEST ALSO

Round 4 - Technical 

(1 Question)

  • Q1. SOME DSA AND ROLE BASED QUATIONS.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Jul 2022. There were 5 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all Resume tips
Round 2 - Aptitude Test 

50 questions in 12 minutes mostly test your arthimetic, logical knowledge.

Round 3 - Coding Test 

3 coding questions in 90 mins, 1st one is from arrays an easy question, 2nd one is related to stacks and queues relatively harder and last one is hard which i am also unable to attempt. I cracked the first two questions and my solutions passed all the test cases.

Round 4 - One-on-one 

(3 Questions)

  • Q1. Difference between sorting algorithms
  • Ans. 

    Sorting algorithms are methods used to arrange elements in a specific order.

    • Different sorting algorithms include bubble sort, selection sort, insertion sort, merge sort, quick sort, and heap sort.

    • Some algorithms are more efficient than others depending on the size of the data set and the initial order of the elements.

    • For example, quick sort is generally faster than bubble sort for large data sets.

  • Answered by AI
  • Q2. BFS and DFS in trees and imlementing them
  • Ans. 

    BFS and DFS are traversal algorithms used in trees. BFS explores level by level, while DFS explores depth first.

    • BFS (Breadth-First Search) visits nodes level by level, using a queue. Example: traversing a binary tree level by level.

    • DFS (Depth-First Search) explores as far as possible along each branch before backtracking. Example: in-order traversal of a binary tree.

  • Answered by AI
  • Q3. Sql questions and database questions
Round 5 - HR 

(2 Questions)

  • Q1. Tell me about yourself
  • Q2. Explain the college life

Interview Preparation Tips

Interview preparation tips for other job seekers - learn the web development basics to get placed in any indian startup

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Sep 2022. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Properly align and format text in your resume. A recruiter will have to spend more time reading poorly aligned text, leading to high chances of rejection.
View all Resume tips
Round 2 - Coding Test 

Question from Array,DP

Round 3 - One-on-one 

(3 Questions)

  • Q1. Resume based only
  • Q2. Data structure and algorithms
  • Q3. Object oriented programmings
Round 4 - HR 

(1 Question)

  • Q1. Behavioural questions

I was interviewed in Aug 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This round had 3 coding questions of Medium to Hard level of difficulty.

  • Q1. 

    Intersection of Two Unsorted Arrays Problem Statement

    Given two integer arrays ARR1 and ARR2 of sizes 'N' and 'M' respectively, find the intersection of these arrays. The intersection is defined as the se...

  • Ans. 

    Find the intersection of two unsorted arrays while maintaining the order of elements from the first array.

    • Iterate through the elements of the first array and check if they exist in the second array.

    • Use a hash set to keep track of elements already seen in the second array for efficient lookup.

    • Maintain the order of elements from the first array while finding the intersection.

    • Handle duplicate elements in both arrays appro...

  • Answered by AI
  • Q2. 

    Ways To Make Coin Change

    Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...

  • Ans. 

    The task is to determine the total number of ways to make change for a specified value using given denominations.

    • Create a function that takes in the number of denominations, the denominations array, and the value to make change for as input

    • Use dynamic programming to iterate through all possible combinations of coins to make the specified value

    • Keep track of the number of ways to make change for each value from 0 to the ...

  • Answered by AI
  • Q3. 

    Longest Substring Without Repeating Characters Problem Statement

    Given a string S of length L, determine the length of the longest substring that contains no repeating characters.

    Example:

    Input:
    "abac...
  • Ans. 

    Find the length of the longest substring without repeating characters in a given string.

    • Use a sliding window approach to keep track of the longest substring without repeating characters.

    • Use a hashmap to store the index of each character in the string.

    • Update the start index of the window when a repeating character is encountered.

    • Calculate the maximum length of the substring as you iterate through the string.

  • Answered by AI
Round 2 - Video Call 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This round started with 2 coding questions and then moved on to some more questions from OOPS.

  • Q1. 

    Palindrome Linked List Problem Statement

    You are provided with a singly linked list of integers. Your task is to determine whether the given singly linked list is a palindrome. Return true if it is a pali...

  • Ans. 

    Check if a given singly linked list is a palindrome or not.

    • Traverse the linked list to find the middle element using slow and fast pointers.

    • Reverse the second half of the linked list.

    • Compare the first half with the reversed second half to determine if it's a palindrome.

  • Answered by AI
  • Q2. 

    Search Element in a Rotated Sorted Array

    Given a sorted array that has been rotated, the task is to find the index of a specific element. The array is initially sorted in ascending order and then rotated ...

  • Ans. 

    Search for an element in a rotated sorted array efficiently in O(logN) time complexity.

    • Implement binary search to find the pivot point where rotation occurs.

    • Divide the array into two subarrays and perform binary search on the appropriate subarray.

    • Handle cases where the element may be in the left or right subarray after rotation.

    • Return the index of the element if found, else return -1.

  • Answered by AI
  • Q3. What is a static variable in C?
  • Ans. 

    A static variable in C is a variable that retains its value between function calls.

    • Declared using the 'static' keyword

    • Retains its value throughout the program's execution

    • Useful for maintaining state across function calls

  • Answered by AI
  • Q4. What is the difference between abstraction and inheritance?
  • Ans. 

    Abstraction is hiding the implementation details while inheritance is a mechanism for creating new classes using existing classes.

    • Abstraction focuses on hiding the internal implementation details of a class, allowing the user to only interact with the necessary information.

    • Inheritance allows a class to inherit properties and behavior from another class, promoting code reusability and creating a hierarchy of classes.

    • Abs...

  • Answered by AI
Round 3 - Video Call 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This round had questions mainly from HTML,CSS and JavaScript as I had mentioned some Frontend Projects in my resume so the interviewer wanted to check my skills on those. He also asked me some SQL queries and a simple coding question towards the end of the interview.

  • Q1. What is event bubbling in JavaScript?
  • Ans. 

    Event bubbling is the process where an event triggered on a child element is propagated up through its parent elements.

    • In event bubbling, when an event occurs on a child element, it first runs the event handlers on the child element, then on its parent, then all the way up to the top level of the DOM.

    • Event bubbling allows for delegation of event handling to a parent element, reducing the number of event listeners neede...

  • Answered by AI
  • Q2. How can you optimize the loading of website assets?
  • Ans. 

    Optimizing website asset loading involves minimizing file sizes, reducing HTTP requests, utilizing caching, and prioritizing critical resources.

    • Minimize file sizes by compressing images, scripts, and stylesheets.

    • Reduce HTTP requests by combining files, using sprites, and lazy loading non-essential resources.

    • Utilize browser caching to store static assets locally for faster subsequent page loads.

    • Prioritize critical resou...

  • Answered by AI
  • Q3. In how many ways can you display HTML elements?
  • Ans. 

    There are multiple ways to display HTML elements, including inline, block, inline-block, and flex.

    • HTML elements can be displayed as inline, which allows them to flow with surrounding content.

    • Block elements take up the full width available and start on a new line.

    • Inline-block elements are displayed as blocks, but flow like inline elements.

    • Flexbox allows for more advanced layout options, such as aligning items and distri

  • Answered by AI
  • Q4. 

    Check if Two Strings are Anagrams

    Anagrams are words or names that can be formed by rearranging the letters of another word. For instance, 'spar' can be rearranged to form 'rasp', making them anagrams.

    E...

  • Ans. 

    Check if two strings are anagrams by rearranging their letters.

    • Create a frequency map of characters for both strings

    • Compare the frequency maps to check if they are equal

    • Return True if the frequency maps are equal, else False

  • Answered by AI
Round 4 - HR 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Easy

This is a cultural fitment testing round. HR was very frank and asked standard questions. Then we discussed about my role.

  • Q1. What is something about you that is not included in your resume?
  • Q2. Why should we hire you?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPracto interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, DBMS, JavaScript, HTML, CSS, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Apr 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This round had 3 coding questions of Medium to Hard level of difficulty.

  • Q1. 

    Balanced Parentheses Combinations

    Given an integer N representing 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 recursion to generate all possible combinations of balanced parentheses.

    • Keep track of the number of open and close parentheses used in each combination.

    • Return the valid combinations as an array of strings.

  • Answered by AI
  • Q2. 

    Trapping Rain Water Problem Statement

    You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...

  • Ans. 

    Calculate the total amount of rainwater that can be trapped between given elevations in an array.

    • Iterate through the array and calculate the maximum height on the left and right of each bar.

    • Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.

    • Sum up the trapped water at each bar to get the total trapped water for the entire array.

  • Answered by AI
  • 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 adjacent to rotten oranges.

    • Create a queue to store the coordinates of rotten oranges and perform BFS to rot adjacent fresh oranges.

    • Track the time taken to rot all fresh oranges and return -1 if not all fresh oranges can be rotten.

    • Update the grid with the new state of oranges after each second.

    • Handle edge cases such as empty grid or no fresh oranges present.

    • Example...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a standard DS/Algo round where I was given 2 questions to solve under 60 minutes. I was able to come up with the optimal approach for both the questions and then at the end of the interview I was also asked the famous Die Hard Water Puzzle.

  • Q1. 

    Queue Using Stacks Implementation

    Design a queue data structure following the FIFO (First In First Out) principle using only stack instances.

    Explanation:

    Your task is to complete predefined functions t...

  • Ans. 

    Implement a queue using stacks following FIFO principle.

    • Use two stacks to simulate a queue.

    • For enQueue operation, push elements onto stack1.

    • For deQueue operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then pop from stack2.

    • For peek operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then return top of stack2.

    • For isEmpty operation, check if both stack1 and st...

  • Answered by AI
  • Q2. 

    Merge Intervals Problem Statement

    You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.

    Your task is to merge all overlapping intervals a...

  • Ans. 

    Merge overlapping intervals and return sorted list of merged intervals by start time.

    • Sort the intervals based on start time.

    • Iterate through intervals and merge overlapping ones.

    • Return the merged intervals in sorted order.

  • Answered by AI
  • Q3. You have a 3-liter jar and a 5-liter jar. How can you measure exactly 4 liters using these two jars?
Round 3 - Face to Face 

(4 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 coding questions - first one related to Binary Tree and the second one was a simple question from Bit Manipulation. This was followed by some questions from OOPS.

  • Q1. 

    Binary Tree Diameter Problem Statement

    You are given a Binary Tree, and you need to determine the length of the diameter of the tree.

    The diameter of a binary tree is the length of the longest path betwe...

  • Ans. 

    The task is to find the diameter of a binary tree, which is the length of the longest path between any two end nodes in the tree.

    • Traverse the tree to find the longest path between two nodes.

    • Keep track of the maximum diameter found during traversal.

    • The diameter may not necessarily pass through the root node.

    • Consider both left and right subtrees while calculating the diameter.

    • Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1

  • Answered by AI
  • Q2. 

    Power of 2 Problem Statement

    Determine if it is possible to reorder the digits of a given integer 'N' such that the resulting number is a power of two. The leading digit must not be zero.

    Input:

    The fir...
  • Ans. 

    The problem involves determining if it is possible to reorder the digits of a given integer to form a power of 2.

    • Iterate through all possible permutations of the digits of the given integer.

    • Check if any of the permutations form a power of 2.

    • Return 1 if a valid permutation is found, else return 0.

  • Answered by AI
  • Q3. What are some advantages of using Object-Oriented Programming (OOP)?
  • Ans. 

    Advantages of OOP include code reusability, modularity, and easier maintenance.

    • Code reusability: Objects can be reused in different parts of the program, reducing redundancy.

    • Modularity: OOP allows for breaking down complex problems into smaller, more manageable parts.

    • Easier maintenance: Changes to one part of the codebase do not necessarily affect other parts, making maintenance easier.

    • Encapsulation: Data hiding and ab...

  • Answered by AI
  • Q4. What are access specifiers and what is their significance in Object-Oriented Programming?
  • Ans. 

    Access specifiers define the level of access to class members in Object-Oriented Programming.

    • Access specifiers include public, private, protected, and default

    • Public members are accessible from outside the class

    • Private members are only accessible within the class

    • Protected members are accessible within the class and its subclasses

    • Default access is when no access specifier is specified

  • Answered by AI
Round 4 - HR 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point
and professional. The interview lasted for 30 minutes.

  • Q1. Why should we hire you?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPracto interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, DBMS, OS, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Lybrate Interview FAQs

What are the top questions asked in Lybrate Android Developer interview?

Some of the top questions asked at the Lybrate Android Developer interview -

  1. Round 1: Why java doesn't support multiple inheritance, interface vs abstract c...read more
  2. Round 2 : LinkedList, Binary search, Complexities, SQL queries : DISTINCT, JOIN...read more

Recently Viewed

INTERVIEWS

Silverpush

No Interviews

SALARIES

AU Small Finance Bank

INTERVIEWS

HealthKart

No Interviews

INTERVIEWS

Lybrate

No Interviews

INTERVIEWS

Cuemath

No Interviews

INTERVIEWS

HealthKart

5.6k top interview questions

SALARIES

Silverpush

SALARIES

HSBC Bank

INTERVIEWS

PharmEasy

20 top interview questions

INTERVIEWS

HealthKart

No Interviews

Tell us how to improve this page.

Interview Questions from Similar Companies

Tata 1mg Interview Questions
3.6
 • 146 Interviews
PharmEasy Interview Questions
3.7
 • 80 Interviews
MedPlus Interview Questions
3.6
 • 79 Interviews
Practo Interview Questions
3.2
 • 74 Interviews
Cogoport Interview Questions
2.9
 • 53 Interviews
MagicPin Interview Questions
2.7
 • 50 Interviews
Netmeds.com Interview Questions
3.6
 • 42 Interviews
MediBuddy Interview Questions
3.5
 • 31 Interviews
Portea Medical Interview Questions
3.8
 • 28 Interviews
View all
Relationship Manager
24 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Inside Sales Specialist
20 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Customer Success Specialist
17 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Operations Analyst
17 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Product Manager
15 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Lybrate with

Practo

3.2
Compare

Tata 1mg

3.6
Compare

Netmeds.com

3.6
Compare

PharmEasy

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview