![演算法 [Java] LeetCode #921. Minimum Add to Make Parentheses Valid](https://allenhsieh1992.com/images/leetcode.webp)
A parentheses string is valid if and only if:
![演算法 [Java] LeetCode #921. Minimum Add to Make Parentheses Valid](https://allenhsieh1992.com/images/leetcode.webp)
A parentheses string is valid if and only if:
![演算法 [Java] LeetCode #1119. Remove Vowels from a String](https://allenhsieh1992.com/images/leetcode.webp)
Given a string s, remove the vowels 'a', 'e', 'i', 'o', and 'u' from it, and return the new string.
![演算法 [Java] LeetCode #1762. Buildings With an Ocean View](https://allenhsieh1992.com/images/leetcode.webp)
There are n buildings in a line. You are given an integer array heights of size n that represents the heights of the buildings in the line.
![演算法 [Java] LeetCode #304. Range Sum Query 2D - Immutable](https://allenhsieh1992.com/images/leetcode.webp)
Given a 2D matrix matrix, handle multiple queries of the following type:Calculate the sum of the elements of matrix inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).
![演算法 [Java] LeetCode #867. Transpose Matrix](https://allenhsieh1992.com/images/leetcode.webp)
Given a 2D integer array matrix, return the transpose of matrix.