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. Count subarrays with sum less than or equal to k
CodingReported in a candidate post, Aug 2019

Count subarrays with sum less than or equal to k

Filed under OPPO · Also reported at Oppo R&D

The question

Given an array of n integers and a value k, for every possible length i from 1 to n, count the total subarrays whose sum of elements is less than or equal to k.

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

Related OPPO questions

  • Total sum of floor of array element pairs
  • HackerEarth Proctored Coding Assessment
  • LeetCode Standard Tree and Linked List Problems
  • Continuous color area
← Permutations where prime indices contain prime numbersTotal sum of floor of array element pairs →

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