JobsJob TrackerJob alerts

OPPO ยท 11 questions

All 11Coding 7Behavioral 1
  • Permutations where prime indices contain prime numbersCoding
  • Count subarrays with sum less than or equal to kCoding
  • Total sum of floor of array element pairsCoding
  • HackerEarth Proctored Coding AssessmentCoding
  • LeetCode Standard Tree and Linked List ProblemsCoding
  • Internal Variable Storage Puzzle
  • Operating Systems and Self-Balancing Trees
  • OS concepts
  • Continuous color areaCoding
  • Project reviewBehavioral
  • Longest palindromic substringCoding
โ† OPPO questions
  1. Interview questions
  2. OPPO
  3. HackerEarth Proctored Coding Assessment
CodingHard

HackerEarth Proctored Coding Assessment

Filed under OPPO

The question

Solve three coding questions of varying difficulties (Easy, Medium, Hard), where the hard question required a segment tree.

No write-up yet. Related questions below have one.

Related OPPO questions

  • Count subarrays with sum less than or equal to k
  • Total sum of floor of array element pairs
  • LeetCode Standard Tree and Linked List Problems
  • Continuous color area
โ† Total sum of floor of array element pairsLeetCode Standard Tree and Linked List Problems โ†’

Collected from public candidate posts and coding forums. Updated Nov 2026.