AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
CelebritySchool Junior Android Developer Interview Questions and Answers
CelebritySchool Junior Android Developer Interview Experiences
1 interview found
Anonymous
Basic interview questions. Easy to clear
2 codes to be done online
Top trending discussions
Interview questions from similar companies
Interview Questionnaire
1 Question
- Q1. Experience
I applied via Campus Placement and was interviewed before Mar 2021. There were 3 interview rounds.
(16 Questions)
- Q1. What are your salary expectations?
- Ans.
I am open to discussing salary based on the responsibilities and opportunities offered by the position.
I am flexible and open to negotiation.
I am looking for a competitive salary that reflects my skills and experience.
I am more interested in the overall compensation package, including benefits and growth opportunities.
I would like to learn more about the company's salary range for this position.
I am confident that we c
- Q2. What is your family background?
- Ans.
My family background is diverse and multicultural.
My parents are from different countries, which has exposed me to different cultures and perspectives.
I have relatives who work in various industries, including technology and healthcare.
Growing up, my family encouraged me to pursue my interests in computer science and supported my education in the field.
- Q3. Share details of your previous job.
- Ans.
I worked as a Software Developer at XYZ Company.
Developed and maintained software applications using Java and Python.
Collaborated with a team of developers to design and implement new features.
Participated in code reviews and debugging sessions to ensure high-quality code.
Worked closely with clients to gather requirements and provide technical support.
Implemented unit tests and performed software testing to identify an...
- Q4. Why should we hire you?
- Ans.
I have a strong background in software development and a proven track record of delivering high-quality projects on time and within budget.
I have a deep understanding of various programming languages and frameworks, allowing me to adapt quickly to new technologies.
I am highly skilled in problem-solving and troubleshooting, which enables me to identify and resolve issues efficiently.
I am a team player and have excellent...
- Q5. Why are you looking for a change?
- Ans.
Looking for new challenges and growth opportunities.
Seeking a more challenging role to enhance my skills and knowledge.
Interested in working on cutting-edge technologies and projects.
Want to be part of a dynamic and innovative team.
Desire to expand my professional network and learn from industry experts.
- Q6. Where do you see yourself in 5 years?
- Ans.
In 5 years, I see myself as a senior software developer leading a team and working on complex projects.
Leading a team of developers
Working on complex projects
Continuously learning and staying updated with new technologies
Contributing to the growth and success of the company
- Q7. What are your strengths and weaknesses?
- Ans.
My strengths include problem-solving, attention to detail, and teamwork. My weaknesses include time management and public speaking.
Strengths: problem-solving, attention to detail, teamwork
Weaknesses: time management, public speaking
- Q8. Tell me about yourself.
- Ans.
I am a software developer with experience in various programming languages and a passion for creating innovative solutions.
Experienced in Java, C++, and Python
Developed a mobile app using React Native
Worked on a team to create a web application using Angular
Strong problem-solving and analytical skills
- Q9. Tell me about yourself
- Ans.
I am a software developer with experience in web development and a passion for problem-solving.
Experienced in web development using HTML, CSS, and JavaScript
Proficient in programming languages such as Java and Python
Familiar with frameworks like React and Angular
Strong problem-solving and analytical skills
Excellent teamwork and communication abilities
- Q10. What are your strength and weakness
- Ans.
My strength is problem-solving and my weakness is sometimes overthinking.
Strength: Problem-solving
Weakness: Overthinking
- Q11. Where do you see yourself in 5 year's
- Ans.
In 5 years, I see myself as a senior software developer leading a team and working on complex projects.
Leading a team of developers
Working on complex projects
Continuously learning and improving my skills
Contributing to the growth and success of the company
- Q12. Why are you looking for a change
- Ans.
Seeking new opportunities for professional growth and challenges.
Looking for a more challenging role
Want to expand my skill set
Seeking better career prospects
Interested in working with new technologies
Want to work in a more collaborative environment
- Q13. I think I am very flexible and adaptive to learning new things
- Q14. Share your details for your previous job
- Ans.
I worked as a Software Developer at XYZ Company.
Developed and maintained web applications using Java and Spring framework
Collaborated with cross-functional teams to gather requirements and design solutions
Implemented unit tests and performed code reviews to ensure code quality
Participated in Agile development process and attended daily stand-up meetings
Troubleshooted and resolved software defects reported by users
- Q15. What is your family background
- Ans.
My family background is diverse and multicultural, with members from different professions and cultural backgrounds.
My father is a doctor and my mother is a teacher.
I have two siblings, one is an engineer and the other is a lawyer.
We celebrate various cultural festivals and traditions together.
My family values education and encourages continuous learning.
- Q16. What are your salary expectations
- Ans.
I am open to discussing salary based on the responsibilities and opportunities offered by the position.
I am flexible and open to negotiation.
I am looking for a fair and competitive salary based on my skills and experience.
I am more interested in the overall compensation package, including benefits and growth opportunities.
I am confident that we can come to a mutually beneficial agreement.
Interview Preparation Tips
I'm from Vinukonda
I'm ready to the interview
I applied via Recruitment Consultant and was interviewed before Oct 2020. There was 1 interview round.
Interview Questionnaire
2 Questions
- Q1. What is Abstraction
- Ans.
Abstraction is the process of hiding complex implementation details and exposing only the necessary information.
Abstraction helps in reducing complexity and increasing efficiency.
It allows us to focus on the essential features of an object or system.
Abstraction can be achieved through abstract classes, interfaces, and encapsulation.
For example, a car can be abstracted as a vehicle with certain properties and methods.
Ab...
- Q2. Concept of hiding implementation
- Ans.
Hiding implementation means keeping the internal details of a class or function hidden from the outside world.
It is a fundamental principle of object-oriented programming.
It helps in achieving encapsulation and abstraction.
It prevents the user from accessing the internal workings of a class or function.
Examples include private variables and methods in a class.
It allows for easier maintenance and modification of code.
It...
Interview Preparation Tips
Interview Questionnaire
1 Question
- Q1. What is meant by javascript closure? And why do we use it?
- Ans.
A closure is a function that has access to its outer function's variables, even after the outer function has returned.
A closure is created when a function is defined inside another function.
It allows for private variables and functions in JavaScript.
Closures are used for data hiding, encapsulation, and creating modules.
Example: function outer() { var x = 10; function inner() { console.log(x); } return inner; } var clos
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 50 minutes
Round difficulty - Easy
Round duration - 60 minutes
Round difficulty - Easy
At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.
Round duration - 40 minutes
Round difficulty - Easy
The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked me some Computer Science fundamentals in this round as well as some behavioural questions.
- Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
- Ans.
Implement a Trie data structure with insert and search functions.
Create a TrieNode class with children and isEndOfWord attributes.
Implement insert function to add words by iterating through characters.
Implement search function to check if a word exists by traversing the Trie.
Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.
Interview Preparation Tips
Do lot of hard work and practice of Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.
Application resume tips for other job seekersMake your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.
Final outcome of the interviewSelectedSkills evaluated in this interview
I appeared for an interview before May 2021.
Round duration - 90 minutes
Round difficulty - Medium
Around 65-70 people sat for the test. 15 people were shortlisted. It consisted of the following to be done in 90 minutes.
- 28 MCQs based on core CS
- 2 Coding questions – everyone had different and random questions. Most questions were custom logic based (easy level) including some standard questions – LCS, LIS, topological sort.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Interviewer was very friendly. It started with the standard – tell me about yourself / introduce yourself type of question. Then he proceeded and asked two coding questions
- Q1.
Remove Duplicates from a Sorted Linked List
Your friend has homework to complete. Help him by removing duplicates from a sorted linked list.
You are given the 'Head' of a sorted linked list. Modify the l...
- Ans.
Remove duplicates from a sorted linked list without adjacent duplicates.
Traverse the linked list while comparing current and next nodes.
If they are equal, skip the next node by updating the current node's next pointer.
Repeat until the end of the list is reached.
- Q2.
Course Schedule Problem Statement
You are enrolled as a student and must complete
Ncourses, numbered from 1 to N, to earn your degree.Some courses have prerequisites, which means that to take course
i,... - Ans.
Check if it is feasible to complete all courses with prerequisites.
Create a graph representing the prerequisites with courses as nodes and edges as prerequisites.
Perform a topological sort on the graph to check if there is a cycle (if there is, then it's not feasible to complete all courses).
If there is no cycle, then it is feasible to complete all courses.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
This round had only 1 question. The interviewer introduced himself. And he advised me to clearly understand the problem before proceeding.
- Q1.
LCA of Binary Tree Problem Statement
You are given a binary tree of distinct integers, along with two nodes, ‘X’ and ‘Y’. Your task is to determine the Lowest Common Ancestor (LCA) of ‘X’ and ‘Y’.
The LC...
- Ans.
Find the Lowest Common Ancestor of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the Lowest Common Ancestor.
Implement a recursive function to efficiently find the LCA.
Handle cases where one node is an ancestor of the other.
Consider edge cases like when X or Y is the root node.
(4 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Pretty Good Round. Fast Paced. We covered a lot of ground.
- Q1.
Binary Search Tree Iterator Problem Statement
Design and implement a class
BSTIteratorto perform an in-order traversal over a Binary Search Tree (BST). Your implementation should include the following me... - Ans.
Design and implement a class BSTIterator to perform in-order traversal over a Binary Search Tree (BST).
Implement a parameterized constructor to initialize the iterator with the root of the BST.
Implement a method 'next()' to return the next smallest element in in-order traversal.
Implement a method 'hasNext()' to check if there exists a next smallest element in traversal.
Ensure the output is the in-order traversal of the
- Q2.
Maximum Consecutive Ones Problem Statement
Given a binary array 'ARR' of size 'N', your task is to determine the maximum length of a sequence consisting solely of 1’s that can be obtained by converting at...
- Ans.
Find the maximum length of a sequence of 1's by converting at most K zeroes into ones in a binary array.
Iterate through the array and keep track of the current window of 1's and zeroes.
Use a sliding window approach to find the maximum length of consecutive 1's by flipping at most K zeroes.
Update the window based on the number of zeroes flipped and keep track of the maximum length found so far.
Return the maximum length ...
- Q3.
BFS in Graph Problem Statement
You are given an undirected and disconnected graph
G(V, E)havingVvertices numbered from0toV-1andEedges. Your task is to print its BFS traversal starting from the 0t... - Ans.
BFS traversal of an undirected and disconnected graph starting from vertex 0.
Start BFS traversal from vertex 0 and visit all connected nodes in sorted order.
Use a queue to keep track of nodes to visit next.
Keep a visited array to avoid revisiting nodes.
Print the BFS traversal path as the nodes are visited.
Example: For input V=5, E=4 and edges 0-1, 0-2, 1-3, 2-4, the BFS traversal will be [0, 1, 2, 3, 4].
- Q4.
Dijkstra's Shortest Path Problem Statement
Given an undirected graph with
Vvertices (labeled 0, 1, ..., V-1) andEedges, each edge connects two nodesXandYwith a specified weight representing the dis... - Ans.
Dijkstra's algorithm is used to find the shortest path distance from a source node to all other nodes in an undirected graph.
Implement Dijkstra's algorithm to find the shortest path distance from node 0 to all other nodes in the graph.
Use a priority queue to efficiently select the next node with the shortest distance.
Initialize distances to all nodes as infinity, except for the source node which is 0.
Update distances t...
(1 Question)
Round duration - 60 minutes
Round difficulty - Hard
Bar Raised Round. Definitely felt the difficulty.
- Q1.
First Non-Repeating Character Problem Statement
You are given a string consisting of English alphabet characters. Your task is to identify and return the first character in the string that does not repeat...
- Ans.
Identify and return the first non-repeating character in a string, or the first character if all characters repeat.
Iterate through the string to count the frequency of each character
Iterate through the string again to find the first character with frequency 1
If no such character is found, return the first character of the string
Interview Preparation Tips
Tip 1 : Practice at least 250 Questions, Give yourself enough time for preparation. Cramming won't take you very far. In books, I really liked Elements of Programming Interviews.
Tip 2 : Make sure to brush up your basics - coding style, OOPs, Language features. They help in making an impression.
Tip 3 : Don't worry about solving the question in the interview. Learn to tackle any random problem with the best of your ability. More often than not, that'd be enough.
Tip 1 : Keep your resume clean - no graphics, no multiple fonts. Keep it one page.
Tip 2 : Don't go over board in mentioning skills, only mention the things you are truly confident about.
Skills evaluated in this interview
I applied via Walk-in and was interviewed in Jan 2020. There were 3 interview rounds.
Interview Questionnaire
5 Questions
- Q1. Basic structure of an HTML page
- Ans.
Basic structure of an HTML page includes doctype declaration, html, head, and body tags.
DOCTYPE declaration specifies the HTML version
HTML tag wraps the entire content of the page
Head tag contains meta information, title, and links to external resources
Body tag contains the visible content of the page
- Q2. What is the difference between padding and margin?
- Ans.
Padding is the space inside an element, while margin is the space outside an element.
Padding is used to create space between an element's content and its border.
Margin is used to create space between an element's border and the adjacent elements.
Padding is affected by the background color of the element, while margin is not.
Padding can be set individually for each side of an element (top, right, bottom, left), while ma...
- Q3. What is Box Model?
- Ans.
Box Model is a concept in CSS where every element is treated as a box with content, padding, border, and margin.
Box Model consists of content, padding, border, and margin.
Content is the actual content of the box.
Padding is the space between the content and the border.
Border is the line that goes around the padding and content.
Margin is the space outside the border.
- Q4. What are different types of directives in Angular?
- Ans.
Directives in Angular are markers on DOM elements that tell Angular to attach a specified behavior to that element.
There are three types of directives in Angular: Component, Structural, and Attribute.
Component directives are used to create reusable UI components.
Structural directives are used to change the structure of the DOM.
Attribute directives are used to change the appearance or behavior of an element.
Examples of ...
- Q5. Difference between JIT compiler and AOT?
- Ans.
JIT compiles code at runtime while AOT compiles code before runtime.
JIT stands for Just-In-Time compilation and compiles code at runtime.
AOT stands for Ahead-Of-Time compilation and compiles code before runtime.
JIT is used in Java Virtual Machine (JVM) while AOT is used in languages like C and C++.
JIT can result in slower startup time but faster execution while AOT can result in faster startup time but slower execution...
Interview Preparation Tips
Skills evaluated in this interview
Interview Questionnaire
1 Question
- Q1. Oops concept of java
- Ans.
Object-Oriented Programming (OOP) concepts in Java
Encapsulation: wrapping data and methods into a single unit
Inheritance: creating new classes from existing ones
Polymorphism: ability of objects to take on multiple forms
Abstraction: hiding implementation details from users
Interfaces: defining a set of methods that a class must implement
Classes: blueprint for creating objects
Skills evaluated in this interview
I applied via Campus Placement and was interviewed before Sep 2021. There was 1 interview round.
(1 Question)
- Q1. Java and spring based questions.
Interview Preparation Tips
CelebritySchool Interview FAQs
Tell us how to improve this page.
Interview Questions for Popular Designations
- Android Developer Interview Questions
- Senior Android Developer Interview Questions
- Senior Android Application Developer Interview Questions
- Android Mobile Application Developer Interview Questions
- IOS Developer Interview Questions
- React Native Developer Interview Questions
- Senior IOS Developer Interview Questions
- Mobile Application Developer Interview Questions
- Show more
CelebritySchool Junior Android Developer Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
TCS
Accenture
Wipro
Cognizant
- Home >
- Interviews >
- CelebritySchool Interview Questions >
- CelebritySchool Junior Android Developer Interview Questions
