JobsJob TrackerJob alerts

Directi ยท 111 questions

All 111Coding 99System Design 3Low-Level Design 3
  • Blueberry Cheese Cake distributionCoding
  • Poor Valet car parking arrangementCoding
  • XML ValidatorCoding
  • Optimal Substring Reversal for Lexicographical MinimizationCoding
  • Query Object PropertiesCoding
  • Max sum of two non-overlapping K-length subarraysCoding
  • Count subarrays with median >= kCoding
  • Design BookMyShowLow-Level Design
  • Find valid T and S combinations for a tennis gameCoding
  • Design a chat messenger with message ordering constraintsSystem Design
  • Advertisement logic for maximum profitCoding
โ† Directi questions
  1. Interview questions
  2. Directi
  3. Max sum of two non-overlapping K-length subarrays
Coding

Max sum of two non-overlapping K-length subarrays

Filed under Directi

The question

Given an array of length N, select two non-overlapping subarrays of length K such that the sum of their elements is maximized.

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

Related Directi questions

  • Find maximum sum of path between any two leaf nodes in a binary tree
  • 0-1 Knapsack maximum profit
  • Maximum area of rectangle of 1s in a modified matrix
  • Count valid letter-mapping keys for word ciphers
  • Largest triangle with different vertex colors on a grid
โ† Query Object PropertiesCount subarrays with median >= k โ†’

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