# LeetCode 247. Strobogrammatic Number II

Description https://leetcode.com/problems/strobogrammatic-number-ii/ A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down).…

Be a Good Techer and Tech for Good. www.goodtecher.com

Description https://leetcode.com/problems/strobogrammatic-number-ii/ A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down).…

Description https://leetcode.com/problems/decode-string/ Given an encoded string, return its decoded string. The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is…

Description https://leetcode.com/problems/course-schedule/ There are a total of numCourses courses you have to take, labeled from 0 to numCourses-1. Some courses may have prerequisites, for example…

Description https://leetcode.com/problems/fruit-into-baskets/ In a row of trees, the i-th tree produces fruit with type tree[i]. You start at any tree of your choice, then repeatedly perform…

Description https://leetcode.com/problems/longest-increasing-path-in-a-matrix/ Given an integer matrix, find the length of the longest increasing path. From each cell, you can either…

Description https://leetcode.com/problems/course-schedule-ii/ There are a total of n courses you have to take labelled from 0 to n – 1. Some courses may have prerequisites, for…

Description https://leetcode.com/problems/meeting-rooms-ii/ Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],…] (si < ei), find the minimum number…

Description https://leetcode.com/problems/next-closest-time/ Given a time represented in the format “HH:MM”, form the next closest time by reusing the current digits.…

Description https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/ Given a string s , find the length of the longest substring t that contains at most 2 distinct characters. Example 1: Input: “eceba”…

Description https://leetcode.com/problems/backspace-string-compare/ Given two strings S and T, return if they are equal when both are typed into empty text editors. # means a backspace character. Note…