Circus Tower: Longest Increasing Subsequence for Height and Weight (CTCI 17.8)

TL;DR

• The Problem: CTCI problem 17.8 technical mechanics.
• The Approach: CTCI problem 17.8: build tallest human tower where each person is shorter and lighter than the person below.
• Complexity: Optimal Time and Memory bounds.

This article provides a clear breakdown of CTCI problem 17.8.

1. Context and Problem Statement

CTCI problem 17.8: build tallest human tower where each person is shorter and lighter than the person below.

2. Technical Code & Mechanics

public class CircusTower {
    static class Person implements Comparable<Person> {
        int height, weight;
        public int compareTo(Person o) { return this.height != o.height ? Integer.compare(this.height, o.height) : Integer.compare(this.weight, o.weight); }
    }
}

3. Key Takeaways and Edge Cases

Always test boundary conditions and invalid input states.