Android Engineer

Android Engineer Interview Questions and Answers for Freshers

Updated 13 Jul 2025

Asked in Go-Jek

3d ago

Q. Beautiful String Problem Statement

Given a binary string STR containing either '0' or '1', determine the minimum number of operations needed to make it beautiful. A binary string is called beautiful if it conta...read more

Ans.

Determine the minimum number of operations needed to make a binary string beautiful by having alternating 0s and 1s.

Iterate through the binary string and count the number of operations needed to make it beautiful by flipping the bits if they are the same.
Keep track of the current bit and compare it with the next bit to determine if an operation is needed.
Return the total number of operations needed for each test case.

Asked in Go-Jek

6d ago

Q. Maximum Sum Rectangle Problem Statement

Given a matrix ARR with dimensions N x M, your task is to identify the rectangle within the matrix that has the maximum sum of its elements.

Input:

The first line contain...read more

Ans.

Find the rectangle within a matrix that has the maximum sum of its elements.

Iterate through all possible rectangles within the matrix
Calculate the sum of each rectangle
Keep track of the maximum sum found

Asked in Go-Jek

2d ago

Q. Reverse Blocks Problem Statement

You are provided with a Singly Linked List of integers and an integer array B of size N. Each element in the array B indicates a block size. Your task is to reverse the nodes wi...read more

Ans.

Reverse nodes within blocks of specified sizes in a singly linked list.

Iterate through the linked list and reverse nodes within each block size specified in the array.
Handle cases where block size exceeds remaining nodes by reversing the remaining nodes as one block.
Update pointers accordingly to reverse the nodes within each block size.