Filter interviews by
I applied via Approached by Company and was interviewed before Sep 2023. There were 2 interview rounds.
Memory leaks in Android can occur when objects are not properly released from memory, leading to performance issues.
Avoid using static variables as they can hold references to objects longer than needed.
Be cautious with context references, as holding onto them can prevent objects from being garbage collected.
Use tools like LeakCanary to detect memory leaks and fix them before they become a problem.
Strong references prevent garbage collection, while weak references allow objects to be collected if no strong references exist.
Strong references prevent the garbage collector from collecting an object as long as the reference is active.
Weak references allow the garbage collector to collect an object if there are no strong references to it.
Strong references are typically used for objects that should not be collected, w...
To make RecyclerView more performant, optimize item layout, use view recycling, implement pagination, and prefetch data.
Optimize item layout by using ConstraintLayout for complex item views
Implement view recycling to reuse existing views instead of creating new ones
Implement pagination to load data in chunks and reduce memory usage
Prefetch data to load items in advance for smoother scrolling
Broadcast Receiver is a component in Android that allows the app to receive and react to broadcast messages from other apps or the system.
Broadcast Receiver is registered in the AndroidManifest.xml file or dynamically in code.
It can listen for system-wide broadcast messages or custom broadcast messages sent within the app.
Broadcast Receiver can perform actions like starting a service, updating UI, or triggering notific...
Services in Android are background components that perform long-running operations without a user interface.
Services run in the background even if the app is not in the foreground.
They can be used for tasks like playing music, downloading files, or syncing data.
There are two types of services: started services and bound services.
Started services are started with startService() and run independently of the app's lifecyc...
Top trending discussions
I am a Programmer Analyst with expertise in developing and maintaining software applications.
Proficient in programming languages such as Java, C++, and Python
Experience in analyzing user requirements and designing software solutions
Skilled in troubleshooting and debugging software issues
Strong knowledge of database management systems like MySQL and Oracle
Familiarity with software development methodologies like Agile an...
I come from a close-knit family with diverse backgrounds and interests.
My parents are both educators, and they instilled in me a love for learning and problem-solving.
I have two siblings, an older brother who works in finance and a younger sister who is studying medicine.
We often gather for family dinners and enjoy discussing various topics, from technology to current events.
My family has been a great support system th...
Flexibility can bring advantages like adaptability and creativity, but can also lead to indecisiveness and lack of focus.
Flexibility allows for adaptability to changing situations and creativity in problem-solving.
It can also lead to indecisiveness and lack of focus if not balanced with structure and clear goals.
Advantages include increased resilience, better teamwork, and improved communication.
Disadvantages include p...
My English score is bad due to lack of practice and exposure.
Lack of practice and exposure to English language
Difficulty in understanding complex grammar rules
Limited vocabulary and poor pronunciation
Lack of confidence in speaking and writing English
Possible language barrier if English is not my first language
I am a software engineer with experience in developing web applications and mobile apps.
I have a degree in Computer Science
I have worked with Java, Python, and JavaScript
I have experience with front-end frameworks like React and Angular
I have developed mobile apps using React Native
I am familiar with Agile methodologies
I have a passion for software development and enjoy the challenges it presents.
I have always been interested in technology and programming
I have taken courses and completed projects in software development
I enjoy problem-solving and finding efficient solutions
I believe software engineering is a constantly evolving field with endless opportunities for growth
A program to check if a given number is prime or not.
A prime number is a number that is only divisible by 1 and itself.
Start checking from 2 up to the square root of the number.
If the number is divisible by any number in the range, it is not prime.
Otherwise, it is prime.
Optimization: check only odd numbers after 2.
Fibonacci program generates a series of numbers where each number is the sum of the two preceding ones.
The program can be implemented using recursion or iteration.
The first two numbers in the series are always 0 and 1.
The next number is the sum of the previous two numbers.
Example: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418,...
Flowchart for two programs
Identify inputs and outputs
Determine program logic
Create decision points and loops
Connect program components
Include error handling
Test and debug
Document the flowchart
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
based on 5 interviews
Interview experience
based on 8 reviews
Rating in categories
Java Developer
9
salaries
| ₹2.4 L/yr - ₹8 L/yr |
Assistant Manager
7
salaries
| ₹4.8 L/yr - ₹6.3 L/yr |
Business Analyst
6
salaries
| ₹4.8 L/yr - ₹5.5 L/yr |
Manager
4
salaries
| ₹5.8 L/yr - ₹7.9 L/yr |
Quality Analyst
4
salaries
| ₹4.3 L/yr - ₹4.8 L/yr |
Infosys
TCS
Wipro
HCLTech