[LeetCode] 529. Minesweeper Let’s play the minesweeper game (Wikipedia, online game)! You are given an m x n char matrix board representing the game board where: ‘M’ represents an unrevealed mine,‘E’ represents an unrevealed emp 2020-07-23 #leetcode #array #java #dfs #matrix
[LeetCode] 417. Pacific Atlantic Water Flow There is an m x n rectangular island that borders both the Pacific Ocean and Atlantic Ocean. The Pacific Ocean touches the island’s left and top edges, and the Atlantic Ocean touches the island’s righ 2020-07-23 #leetcode #java #bfs #dfs #flood fill
[LeetCode] 329. Longest Increasing Path in a Matrix Given an m x n integers matrix, return the length of the longest increasing path in matrix. From each cell, you can either move in four directions: left, right, up, or down. You may not move diagonall 2020-07-22 #leetcode #array #java #dfs #matrix #memoization
[LeetCode] 1100. Find K-Length Substrings With No Repeated Characters Given a string s and an integer k, return the number of substrings in s of length k with no repeated characters. Example 1:Input: s = “havefunonleetcode”, k = 5Output: 6Explanation: There ar 2020-07-20 #leetcode #hashmap #java #sliding window #sliding window with fixed size #string
[LeetCode] 1512. Number of Good Pairs Given an array of integers nums, return the number of good pairs. A pair (i, j) is called good if nums[i] == nums[j] and i < j. Example 1:Input: nums = [1,2,3,1,1,3]Output: 4Explanat 2020-07-13 #leetcode #array #hashmap #java #math
[LeetCode] 763. Partition Labels You are given a string s. We want to partition the string into as many parts as possible so that each letter appears in at most one part. Note that the partition is done so that after concatenating al 2020-07-10 #leetcode #two pointer #hashmap #java #greedy #string
[LeetCode] 1503. Last Moment Before All Ants Fall Out of a Plank We have a wooden plank of the length n units. Some ants are walking on the plank, each ant moves with speed 1 unit per second. Some of the ants move to the left, the other move to the right. When two 2020-07-05 #leetcode #array #java #javascript #brainteaser
[LeetCode] 271. Encode and Decode Strings Design an algorithm to encode a list of strings to a string. The encoded string is then sent over the network and is decoded back to the original list of strings. Machine 1 (sender) has the function: 2020-07-05 #leetcode #java #javascript #string #design
[LeetCode] 38. Count and Say The count-and-say sequence is a sequence of digit strings defined by the recursive formula:countAndSay(1) = “1”countAndSay(n) is the way you would “say” the digit string from countAndSay(n-1), wh 2020-07-04 #leetcode #java #string #simulation
[LeetCode] 279. Perfect Squares Given an integer n, return the least number of perfect square numbers that sum to n. A perfect square is an integer that is the square of an integer; in other words, it is the product of some integer 2020-06-28 #leetcode #java #javascript #dynamic programming #math #knapsack