Company OAsDSA SheetAll ProblemsPlacement DataInterview ExperiencesPremium
OAHelper

Built by students, for students - practice company-specific OAs, DSA sheets, and real interview experiences to land your dream role.

© 2026 OAHelper.in·Terms·Privacy·Refunds·Trust & Safety·Contact·
Ready to crack your next OA?

Practice company-specific questions trusted by thousands of students across India.

Start PracticingGo Premium
OA Practice·DSA·Placements

Disclaimer: OAHelper is an independent educational platform. We (oahelper.in) do not own the images or questions shown. Content is uploaded by users.

Google_28thjuly OA Questions 2026 — Online Assessment & Interview Practice

22 real Google_28thjuly online assessment questions from recent interviews. Includes coding rounds, MCQs, and Google_28thjuly interview preparation tips for SDE Intern, New Grad, and full-time roles.

  • Maximum XOR of Two Numbers in an Array
  • Binary Range Span
  • Permutation Prefix Range Count
  • Prefix Top K Sum
  • Snack Selection Optimization
  • Server Load Balancer Stability
  • The Maximum Number of Subarrays
  • Maximum Triplet Distance
  • Maximum Inversion Distance
  • Minimum Cost to Remove All Stones
  • Count Pairs
  • Lighthouse Flag Broadcast
  • Queries and Array
  • The Runner-Up Relay Route
  • Cost of Groups
  • Signal Window
  • Question 1
  • Ancient Scroll Restoration
  • Mega Batch Completion
  • Shrink the Array
  • Minimize the cost
  • Count Isomorphic
Browse All CompaniesInterview ExperiencesPlacement DataGoogle_28thjuly Array OA questions (5)Google_28thjuly Greedy OA questions (5)Google_28thjuly Hash Table OA questions (4)Google_28thjuly Sorting OA questions (4)Google_28thjuly Counting OA questions (3)Google_28thjuly Dynamic Programming OA questions (3)Google_28thjuly Math OA questions (3)Google_28thjuly String OA questions (3)
All Companies
G

Google_28thjuly OA Questions

22 QuestionsOnline Assessment
0 / 22 solved in this company0% complete
01

Maximum XOR of Two Numbers in an Array

bit-manipulationbit-manipulation
02

Binary Range Span

03

Permutation Prefix Range Count

04

Prefix Top K Sum

05

Snack Selection Optimization

06

Server Load Balancer Stability

07

The Maximum Number of Subarrays

08

Maximum Triplet Distance

09

Maximum Inversion Distance

ArrayTwo Pointers+1ArrayTwo PointersPrefix Sum
10

Minimum Cost to Remove All Stones

Dynamic ProgrammingGraph OrientationDynamic ProgrammingGraph Orientation
11

Count Pairs

ArrayBinary Indexed Tree+1ArrayBinary Indexed TreeSorting
12

Lighthouse Flag Broadcast

StringGreedy+2StringGreedyStackPrefix Sum
13

Queries and Array

ArrayBinary Search+3ArrayBinary SearchGreedySorting+1
14

The Runner-Up Relay Route

15

Cost of Groups

TreeGraph+3TreeGraphBreadth-First SearchSorting+1
16

Signal Window

Sliding Window Prefix Sum+1Sliding Window Prefix Sum Array
17

Question 1

Dynamic ProgrammingCounting+3Dynamic ProgrammingCountingGame TheorySimulation+1
18

Ancient Scroll Restoration

ArrayBinary Search+3ArrayBinary SearchGreedyHash Table+1
19

Mega Batch Completion

Dynamic ProgrammingGame Theory+2Dynamic ProgrammingGame TheoryMathCombinatorics
20

Shrink the Array

ArrayHash Table+2ArrayHash TableSortingSimulation
21

Minimize the cost

StringHash Table+2StringHash TableCountingGreedy
22

Count Isomorphic

StringHash Table+2StringHash TableCountingHash Function
Solve