10+ Avataar Skincare Interview Questions and Answers

BFS traversal of a B Tree involves visiting each level of the tree from left to right before moving to the next level.

• Start by visiting the root node

• Add the root node to a queue

• While the queue is not empty, dequeue a node, visit it, and enqueue its children

• Continue this process until all nodes have been visited

Given a rotated array, find a number efficiently.

• Use binary search to find the pivot point where the array is rotated.

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

• Handle the case when the target number is at the pivot point.

LRU (Least Recently Used) is a scheduling algorithm used in operating systems to manage memory efficiently.

• LRU replaces the least recently used page when a new page needs to be allocated in memory.

• It uses a data structure called a cache to store recently used pages.

• When a page is accessed, it is moved to the front of the cache, and the least recently used page is removed if the cache is full.

• Implementing LRU can be done using various programming languages, such as C++, Java, ...read more

Broadcasts are messages sent by the system or apps to inform other components of an event. Broadcast Receivers listen for these messages.

• Types of Broadcasts: Normal Broadcasts, Ordered Broadcasts, Sticky Broadcasts

• Types of Broadcast Receivers: Static Receivers, Dynamic Receivers

• Examples: System broadcasts like battery low, custom broadcasts within an app

Viewpager offscreenpagelimit is the number of pages to keep loaded on each side of the current page in a ViewPager.

• Determines how many pages are retained to either side of the current page in memory

• Default value is 1, meaning one page to the left and one page to the right of the current page will be kept in memory

• Increasing the offscreenpagelimit can improve performance by reducing the number of times pages need to be recreated

Clone a linked list with random pointers

• Create a new node for each node in the original linked list

• Map the original nodes to their corresponding new nodes

• Update the random pointers of the new nodes based on the mapping

Android provides various persistent storage options like SharedPreferences, SQLite databases, and internal/external storage.

• SharedPreferences: Key-value pairs stored in XML files.

• SQLite databases: Structured relational databases for storing data.

• Internal storage: Private storage for app-specific files.

• External storage: Public storage for files accessible by other apps.

To find the missing number in an arithmetic progression (AP)

• Calculate the common difference (d) between consecutive terms

• Find the sum of the given AP using the formula: sum = (n/2)(2a + (n-1)d)

• Find the sum of the actual AP using the formula: sum = (n/2)(2a + (n-1)d)

• Subtract the sum of the given AP from the sum of the actual AP to get the missing number