Building a Dynamic UI System at Carousell (Part 3)
This is the third and final part in a trilogy of articles about a dynamic UI system we’ve developed at Carousell over the past one and a…
Building a Dynamic UI System at Carousell (Part 2)
This is the second part in a trilogy of articles about a dynamic UI system we’ve developed at Carousell over the past one and a half years…
Building a Dynamic UI System at Carousell (Part 1)
For an e-commerce platform past a certain scale and size, having some sort of a dynamic UI system becomes a necessity due to the complexity…
An Interesting Exercise in Dynamic Programming
Given an array of building heights (with unit width), calculate the area of the largest rectangle that “fits” within these buildings. For…
0-1 Knapsack Problem in Python
The 0-1 Knapsack problem is a variation on the knapsack problem with one condition: there is only one copy of each item. You may choose to…
Iterative Tree Traversals in Python
Tree traversals are most naturally expressed in recursion, but iterative versions are cool too, plus they take only O(1) space. Inorder…