LeetCode 210. Course Schedule II
Description https://leetcode.com/problems/course-schedule-ii/ There are a total of numCourses courses you have to take, labeled from 0 to numCourses – 1. You are given an array prerequisites where prerequisites[i]…
Be a Good Techer and Tech for Good. www.goodtecher.com
Description https://leetcode.com/problems/course-schedule-ii/ There are a total of numCourses courses you have to take, labeled from 0 to numCourses – 1. You are given an array prerequisites where prerequisites[i]…
Description https://leetcode.com/problems/meeting-rooms-ii/ Given an array of meeting time intervals intervals where intervals[i] = [starti, endi], return the minimum number of conference rooms required. Example…
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/android-unlock-patterns/ Given an Android 3×3 key lock screen and two integers m and n, where 1 ≤ m ≤ n ≤ 9, count the…
Description https://leetcode.com/problems/word-search-ii/ Given an m x n board of characters and a list of strings words, return all words on the board. Each word must…
Description https://leetcode.com/problems/implement-trie-prefix-tree/ Implement a trie with insert, search, and startsWith methods. Example: Trie trie = new Trie(); trie.insert(“apple”); trie.search(“apple”); // returns true trie.search(“app”); //…
Description https://leetcode.com/problems/robot-room-cleaner/ You are controlling a robot that is located somewhere in a room. The room is modeled as an m…
Total 58 questions. Introduction Top interview questions asked by Microsoft as voted by the LeetCode community. LeetCode compiled this list…
Description https://leetcode.com/problems/word-ladder/ Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord to endWord, such…