Go-Jek Android Engineer Interview Questions and Answers

Round duration - 45 Minutes
Round difficulty - Easy

Q1. 
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...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.
Answered by AI
Add your answer
Q2. 
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 no...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.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

Q1. 
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...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
Answered by AI
Add your answer