BLOG | Union N aligning rectangles’ area

This is a follow up for merging intervals. Instead of merging 1D items, consider the case when each interval comes with a height, and compute the total overlapping area. We would use a sweep line algorithm for this question. Maintain a horizontal projection for all rectangles. Use 1D union to compute the total union area.… Continue reading BLOG | Union N aligning rectangles’ area

BLOG | Feynman technique: the ultimate best way to learn computer science

If you learn as a student, you will always be a student. A better way to learn knowledge is to learn as a teacher. My journey as a CS student I had both my B.S and M.S degrees in engineering. I still remember how excited I was when I had my first programming course, and… Continue reading BLOG | Feynman technique: the ultimate best way to learn computer science