Zypp Electric Android Developer Interview Questions, Process, and Tips

Q1. Some Algo question based on Stock buy and sell
Add your answer
Q2. Projects and puzzles from gfg
Add your answer

Q1. Intersection of Linked list
Ans. 
Intersection of two linked lists is finding the common node(s) between them.
• Traverse both lists and compare each node to find the common node(s).

• Use a hash table to store the nodes of one list and check for their presence in the other list.

• Calculate the length of both lists and move the pointer of the longer list to match the length of the shorter list, then compare each node.
Answered by AI
Add your answer
Q2. Projects and Puzzles
Add your answer

Q1. Why This Company
Add your answer
Q2. What motivates you to work here
Add your answer
Q3. Some other Hr questions
Add your answer

Q1. Sort and Merge two linked list
Ans. 
Sort and merge two linked lists
• Traverse both linked lists simultaneously

• Compare the values of nodes and merge them in sorted order

• Handle cases where one list is longer than the other
Answered by AI
Add your answer

Q1. Question about SQDCM related each topics
Add your answer

Q1. How many ways we can share data between one app to another app?
Ans. 
There are multiple ways to share data between apps, including using intents, content providers, broadcast receivers, and shared preferences.
• Using Intents: Allows apps to send and receive data through an Intent object.

• Content Providers: Enable apps to share data with other apps by exposing a structured set of data through a URI.

• Broadcast Receivers: Apps can send broadcasts to other apps to share data or events.

• Shared Pr...read more
Answered by AI
Add your answer
Q2. Lifecycle of activity. What would be the state if app is running in the background. When it will be in onStop and onRestart state?
Ans. 
The app lifecycle includes states like running in the background, onStop, and onRestart.
• App running in the background: When the app is not visible but still running, it is in the background state.

• onStop state: Occurs when the activity is no longer visible to the user.

• onRestart state: Follows onStop and is called when the activity is being re-displayed to the user.
Answered by AI
Add your answer
Q3. What is AIDL in Android development?
Ans. 
AIDL stands for Android Interface Definition Language, used for inter-process communication in Android development.
• AIDL is a tool used to define the programming interface that clients and servers use to communicate with each other in Android.

• It allows different Android components to communicate with each other across different processes.

• AIDL files define the methods that can be called remotely, along with the data type
Answered by AI
Add your answer
Q4. Working experience with JNI
Ans. 
JNI stands for Java Native Interface, used to integrate Java code with native code written in languages like C/C++.
• Experience in writing Java code that interacts with native code through JNI

• Understanding of how to create and use JNI libraries

• Knowledge of passing data between Java and native code using JNI functions
Answered by AI
Add your answer
Q5. What is a service?
Ans. 
A service is a piece of code that performs specific tasks or functions to support the overall functionality of a software application.
• Services are often used for tasks such as data processing, communication with external systems, or background tasks.

• Examples of services include web services, REST APIs, and microservices.

• Services can run independently of the user interface and can be accessed by multiple components with
Answered by AI
Add your answer
Q6. Difference between Threads and Coroutines.
Ans. 
Threads are independent sequences of execution within a process, while coroutines are cooperative routines that can pause and resume.
• Threads are managed by the operating system, while coroutines are managed by the programmer.

• Threads run concurrently and can execute in parallel on multiple cores, while coroutines are typically single-threaded.

• Threads have their own stack and memory space, while coroutines share the same...read more
Answered by AI
Add your answer
Q7. How we can perform background tasks in Android?
Ans. 
Background tasks in Android can be performed using services, AsyncTask, JobScheduler, or WorkManager.
• Use Services for long-running tasks in the background

• AsyncTask for short background tasks that need to interact with the UI

• JobScheduler for deferrable background tasks that require network connectivity

• WorkManager for tasks that need to run reliably across different Android versions
Answered by AI
Add your answer

Q1. Djisktra Algorithm, cyclic graph, floyd warshal, Memory Threading, Semaphores, Mutex, Round Robin
Add your answer

Q1. Why you are a good fit? What's your strength? Why you want to join Ola? Past mishaps?
Add your answer

Round duration - 120 Minutes
Round difficulty - Medium

Machine Coding Round
2 Hours in Total
15 Mins for Question Explaination and Doubts
1.5 Hours for coding
15 mins to discuss the approach 

Timing - 3 to 5 pm (They are flexible)
Interviewer was very patient and helped me understand the question

Round duration - 60 Minutes
Round difficulty - Medium

2 Data Strucutre Questions
Timing 5-6 pm (They are flexible)
Google Meet
Online IDE

Q1. 
Unique Binary Search Trees Problem Statement
Given an integer 'N', your task is to compute the number of structurally unique BSTs (binary search trees) that can be formed using an exact number of 'N' uniq...read more
Ans. 
The task is to compute the number of structurally unique BSTs that can be formed using an exact number of unique values.
• Use dynamic programming to solve the problem efficiently.

• The number of structurally unique BSTs can be calculated using Catalan numbers.

• For N nodes, the number of structurally unique BSTs is given by the Nth Catalan number.

• Example: For N=3, the number of structurally unique BSTs is 5.
Answered by AI
Add your answer
Q2. 
Subsequences of String Problem Statement
You are provided with a string 'STR' that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determine all non-empty possible subsequen...read more
Ans. 
Generate all possible subsequences of a given string.
• Use recursion to generate all possible subsequences by including or excluding each character in the string.

• Maintain a current index to keep track of the characters being considered.

• Append the current character to each subsequence generated so far.

• Recursively call the function with the next index to include or exclude the next character.

• Base case: When the current ind...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

HIRING MANAGER ROUND

Discussion about the organisation now questions

HAckerrank based test