Review Math code problems

Num | Problem | Summary |
---|---|---|

1 | Check prime – Sieve of Eratosthenes | Leetcode: Count Primes |

2 | Check leap year | Leetcode: Day of the Week |

3 | GCD | Leetcode: Fraction Addition and Subtraction |

4 | Overlapping area of two rectangles | Leetcode: Rectangle Area |

5 | Rotate Array by k steps | Leetcode: Rotate Array |

6 | Mapping data range of getRand algorithm | Leetcode: Implement Rand10() Using Rand7() |

7 | Deal with float | Leetcode: Minimize Max Distance to Gas Station |

8 | Sum of Subsequence Widths | Leetcode: Sum of Subsequence Widths |

9 | Remove 9 | Leetcode: Remove 9 |

10 | Fraction to Recurring Decimal | Leetcode: Fraction to Recurring Decimal |

11 | Check if two line segments intersect |

See all math problems: #math

- Review: Math Problems
- Leetcode: Water and Jug Problem
- Leetcode: Valid Square
- Leetcode: Valid Perfect Square
- Leetcode: Valid Boomerang
- Leetcode: Ugly Number III
- Leetcode: Transform to Chessboard
- Leetcode: Swap Adjacent in LR String
- Leetcode: Super Pow
- Leetcode: Sum of Two Integers

See more blog_{posts}.