UST Interview Questions and Answers

Sort an array of strings into groups of K elements

• Iterate through the array and create subarrays of size K

• Use a loop to go through the array and add elements to the subarrays

• Handle cases where the array length is not divisible by K

Reverse a linked list by changing the next pointers of each node

• Start with three pointers: current, prev, and next

• Iterate through the list, updating the next pointer of each node to point to the previous node

• Update prev and current pointers for next iteration

Android is a mobile operating system developed by Google, based on the Linux kernel and designed primarily for touchscreen devices.

• Android is open-source and allows developers to create applications using Java programming language.

• Android applications are distributed through the Google Play Store.

• Android supports a wide range of hardware devices from various manufacturers.

• Android provides a rich set of APIs for developers to access device features such as camera, GPS, and sen...read more

Reverse a linked list in groups of a specified size

• Break the linked list into groups of the specified size

• Reverse each group individually

• Connect the reversed groups back together

Building culture requires clear values, effective communication, and consistent actions.

• Define and communicate core values

• Encourage open communication and feedback

• Lead by example and consistently reinforce desired behaviors

• Create opportunities for team building and recognition

• Provide ongoing training and development

• Celebrate successes and learn from failures

A viewmodel is a class that stores and manages UI-related data in a lifecycle-conscious way.

• Viewmodel survives configuration changes like screen rotations

• It is not destroyed when the activity is destroyed

• It is typically used to hold data for the UI to display

Use Floyd's Tortoise and Hare algorithm to detect loop in a Linked List.

• Initialize two pointers, slow and fast, at the head of the Linked List.

• Move slow pointer by one step and fast pointer by two steps.

• If they meet at any point, there is a loop in the Linked List.