[LeetCode] 791. Custom Sort String order and str are strings composed of lowercase letters. In order, no letter occurs more than once. order was sorted in some custom order previously. We want to permute the characters of str so that t 2021-07-15 #leetcode #hashmap #java #counting sort #sort #string
[LeetCode] 1930. Unique Length-3 Palindromic Subsequences Given a string s, return the number of unique palindromes of length three that are a subsequence of s. Note that even if there are multiple ways to obtain the same subsequence, it is still only counte 2021-07-13 #leetcode #hashmap #java #string #palindrome
[LeetCode] 1905. Count Sub Islands You are given two m x n binary matrices grid1 and grid2 containing only 0’s (representing water) and 1’s (representing land). An island is a group of 1’s connected 4-directionally (horizontal or verti 2021-07-05 #leetcode #java #bfs #dfs #flood fill
[LeetCode] 1886. Determine Whether Matrix Can Be Obtained By Rotation Given two n x n binary matrices mat and target, return true if it is possible to make mat equal to target by rotating mat in 90-degree increments, or false otherwise. Example 1: Input: mat = [[0, 2021-06-17 #leetcode #array #java #matrix
[LeetCode] 1400. Construct K Palindrome Strings Given a string s and an integer k, return true if you can use all the characters in s to construct k palindrome strings or false otherwise. Example 1:Input: s = “annabelle”, k = 2Output: tru 2021-06-12 #leetcode #java #greedy #palindrome
[LeetCode] 1331. Rank Transform of an Array Given an array of integers arr, replace each element with its rank. The rank represents how large the element is. The rank has the following rules: Rank is an integer starting from 1. The larger the 2021-06-08 #leetcode #array #hashmap #java
[LeetCode] 1642. Furthest Building You Can Reach You are given an integer array heights representing the heights of buildings, some bricks, and some ladders. You start your journey from building 0 and move to the next building by possibly using bric 2021-05-13 #leetcode #java #greedy #heap
[LeetCode] 1720. Decode XORed Array There is a hidden integer array arr that consists of n non-negative integers. It was encoded into another integer array encoded of length n - 1, such that encoded[i] = arr[i] XOR arr[i + 1]. For 2021-05-06 #leetcode #java #bit manipulation
[LeetCode] 930. Binary Subarrays With Sum Given a binary array nums and an integer goal, return the number of non-empty subarrays with a sum goal. A subarray is a contiguous part of the array. Example 1:Input: nums = [1,0,1,0,1], goal 2021-05-05 #leetcode #array #hashmap #java #prefix sum #sliding window
[LeetCode] 1845. Seat Reservation Manager Design a system that manages the reservation state of n seats that are numbered from 1 to n. Implement the SeatManager class: SeatManager(int n) Initializes a SeatManager object that will manage n se 2021-05-02 #leetcode #java #design #heap