[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] 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] 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] 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
[LeetCode] 1244. Design A Leaderboard Design a Leaderboard class, which has 3 functions: addScore(playerId, score): Update the leaderboard by adding score to the given player’s score. If there is no player with such id in the leaderboard, 2021-04-27 #leetcode #hashmap #java #sort #design
[LeetCode] 1838. Frequency of the Most Frequent Element The frequency of an element is the number of times it occurs in an array. You are given an integer array nums and an integer k. In one operation, you can choose an index of nums and increment the elem 2021-04-26 #leetcode #array #sort #sliding window #greedy #prefix sum
[LeetCode] 1670. Design Front Middle Back Queue Design a queue that supports push and pop operations in the front, middle, and back. Implement the FrontMiddleBack class:FrontMiddleBack() Initializes the queue.void pushFront(int val) Adds val to the 2021-04-18 #leetcode #java #design #queue
[LeetCode] 1704. Determine if String Halves Are Alike You are given a string s of even length. Split this string into two halves of equal lengths, and let a be the first half and b be the second half. Two strings are alike if they have the same number of 2021-04-08 #leetcode #two pointer #java #string
[LeetCode] 1801. Number of Orders in the Backlog You are given a 2D integer array orders, where each orders[i] = [price, amount, orderType] denotes that amount orders have been placed of type orderType at the price price. The orderTyp is:0 if i 2021-03-22 #leetcode #java #MOD #greedy #heap