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. Total sum of floor of array element pairs
CodingReported in a candidate post, Aug 2019

Total sum of floor of array element pairs

Filed under OPPO

The question

Given an array of n positive integers, calculate the total sum of the floor of (a[i]/a[j]) for every pair of indices i and j.

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

Related OPPO questions

  • Count subarrays with sum less than or equal to k
  • HackerEarth Proctored Coding Assessment
  • LeetCode Standard Tree and Linked List Problems
  • Continuous color area
โ† Count subarrays with sum less than or equal to kHackerEarth Proctored Coding Assessment โ†’

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