## 435 Non-overlapping Intervals

Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.

**Note:**

Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.

**Note:**

Given a string that consists of only uppercase English letters, you can replace any letter in the string with another letter at most *k* times. Find the length of a longest substring containing all repeating letters you can get after performing the above operations.

Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters.

Please note that the string does not contain any **non-printable** characters.

Given a **non-empty** string containing an out-of-order English representation of digits `0-9`

, output the digits in ascending order.

Given an 2D board, count how many battleships are in it. The battleships are represented with `'X'`

s, empty slots are represented with `'.'`

s. You may assume the following rules:

Given two non-negative integers `num1`

and `num2`

represented as string, return the sum of `num1`

and `num2`

.

Given a **non-empty** array of integers, return the **third** maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).

A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.

Write a program that outputs the string representation of numbers from 1 to *n*.

But for multiples of three it should output “Fizz” instead of the number and for the multiples of five output “Buzz”. For numbers which are multiples of both three and five output “FizzBuzz”.

Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.