## [Leetcode]252. Meeting Rooms

Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), determine if a person could attend all meetings.
Example 1:
Input: [[0,30],[5,10],[15,20]] Output: false

## [Leetcode problems]75. Sort Colors

Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue.
Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively.
Note: You are not suppose to use the library's sort function for this problem.
Example:
Input: [2,0,2,1,1,0] Output: [0,0,1,1,2,2]
Continue reading “[Leetcode problems]75. Sort Colors”

## Visualized! Intro to 7 Sorting Algorithms and their complexity analysis

After we introduced Graph Algorithm: Topological Sort, let’s now take a time to learn some more general and commonly used sorting algorithms! Actually, if you take a look at Introduction to Algorithms, you will find that sorting is the first algorithm you will learn! Time complexities of them will be appended at the end.

Continue reading “Visualized! Intro to 7 Sorting Algorithms and their complexity analysis”