JobsJob TrackerJob alerts

WheelsEye ยท 8 questions

All 8Coding 8
  • Minimum Magician Tricks for Ordering Wise and Strong PeopleCoding
  • Sum of Values with Different Parity from IndexCoding
  • Lexicographically Smallest String Based on Substring ConditionsCoding
  • Search a 2D MatrixCoding
  • Search in rotated array, max sum non-adjacent, matrix adjacent checkCoding
  • Candies distribution, tree split edge, queue using stacksCoding
  • Implement Map, sort stack, and largest sum subarrayCoding
  • Sliding window maximum, egg dropping puzzle, and jail puzzleCoding
โ† WheelsEye questions
  1. Interview questions
  2. WheelsEye
  3. Candies distribution, tree split edge, queue using stacks
Coding

Candies distribution, tree split edge, queue using stacks

Filed under WheelsEye

The question

Solve the Candies problem, determine if a tree can be divided into two equal parts with the same number of nodes by removing an edge, and implement a queue using stacks.

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

Related WheelsEye questions

  • Minimum Magician Tricks for Ordering Wise and Strong People
  • Sum of Values with Different Parity from Index
  • Lexicographically Smallest String Based on Substring Conditions
  • Search in rotated array, max sum non-adjacent, matrix adjacent check
  • Implement Map, sort stack, and largest sum subarray
โ† Search in rotated array, max sum non-adjacent, matrix adjacent checkImplement Map, sort stack, and largest sum subarray โ†’

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