No summary

Fast & Slow Pointers and Binary Search Solutions

We solved this problem by simulating vertical multiplication which factoring the multiplier into coefficient and exponent.

No summary

Given two binary strings, we calculate their sum.

In this problem, we use four pointers to get no repeating tuples, two for iteration and two for shrinking the solution space.

A problem set of 3Sum problems.

No summary

We can sort the intervals by the start time, if those intervals have no overlap, then the person could attend all meetings.

if we sort intervals by the start endpoint of an interval, those merge-able intervals must be consecutive.