JobsJob TrackerJob alerts

Affirm ยท 8 questions

All 8Coding 5System Design 2Behavioral 1
  • Insert Delete GetRandom O(1) - Duplicates AllowedCoding
  • Design Hit CounterCoding
  • Find the shortest unique substring for every string in a listCoding
  • High-level technical discussion of a recent project and past internshipBehavioral
  • Design WhatsappSystem Design
  • Dictionary with O(1) random deletionCoding
  • Evaluate a Decision TreeCoding
  • Design an RPC-based system for immutable clients with radio broadcast queueSystem Design
โ† Affirm questions
  1. Interview questions
  2. Affirm
  3. Evaluate a Decision Tree
CodingReported in a candidate post, Jul 2020

Evaluate a Decision Tree

Filed under Affirm

The question

Given a modified binary tree representing a decision tree with signals, constants, and boolean leaf nodes, write methods to build the tree, evaluate the expression to a boolean value, and modify a leaf.

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

Related Affirm questions

  • Insert Delete GetRandom O(1) - Duplicates Allowed
  • Design Hit Counter
  • Find the shortest unique substring for every string in a list
  • Dictionary with O(1) random deletion
โ† Dictionary with O(1) random deletionDesign an RPC-based system for immutable clients with radio broadcast queue โ†’

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