JobsJob TrackerJob alerts

EzCred · 5 questions

All 5Coding 4Low-Level Design 1
  • Max Number of FruitsCoding
  • Intersection point of two Linked ListsCoding
  • Partition array into three equal sum segmentsCoding
  • Count pairs with sum divisible by KCoding
  • Authenticate user by nameLow-Level Design
← EzCred questions
  1. Interview questions
  2. EzCred
  3. Max Number of Fruits
Coding

Max Number of Fruits

Filed under EzCred

The question

Find the maximum subsequence sum where adjacent elements have at least a K difference in their indices.

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

Related EzCred questions

  • Partition array into three equal sum segments
  • Count pairs with sum divisible by K
Intersection point of two Linked Lists →

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