JobsJob TrackerJob alerts

Housing.com ยท 12 questions

All 12Coding 11System Design 1
  • Determine repetition element with least space complexityCoding
  • Root to node path sum equals given numberCoding
  • Count buildings that can see the beachCoding
  • Contiguous subsequences with equal 0s and 1s in bit streamCoding
  • Find all valid words from input string using dictionary functionCoding
  • Longest Palindromic substringCoding
  • Longest substring with no repeating charactersCoding
  • Minimum number of jumps to reach the endCoding
  • All root to leaf paths with sum kCoding
  • Apple tree selection problemCoding
  • LCA of n-ary treeCoding
  • Web crawler storage and searchSystem Design
โ† Housing.com questions
  1. Interview questions
  2. Housing.com
  3. Apple tree selection problem
Coding

Apple tree selection problem

Filed under Housing.com

The question

Given n apple trees with specific counts, calculate the number of ways to pick apples in 3 rounds such that the count in round 1 > round 2 > round 3.

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

Related Housing.com questions

  • Determine repetition element with least space complexity
  • Root to node path sum equals given number
  • Count buildings that can see the beach
  • Contiguous subsequences with equal 0s and 1s in bit stream
  • Find all valid words from input string using dictionary function
โ† All root to leaf paths with sum kLCA of n-ary tree โ†’

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