Apr 14, 2026 • Leetcode
132 Pattern
Given an array of n integers nums, a 132 pattern is a subsequence of three integers nums[i], nums[j] and nums[k] such that i < j <
Read more →Recent Articles
Apr 13, 2026 • Leetcode
Minimum Moves to Equal Array Elements
Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal.
Read more →Apr 12, 2026 • Leetcode
Exclusive Time of Functions
On a single-threaded CPU, we execute a program containing n functions. Each function has a unique ID between 0 and n-1.
Read more →Apr 11, 2026 • Leetcode
Battleships in a Board
Given an m x n matrix board where each cell is a battleship 'X' or empty '.', return the number of the battleships on board.
Read more →Apr 10, 2026 • Leetcode
Number of Longest Increasing Subsequence
Given an integer array nums, return the number of longest increasing subsequences.
Read more →Apr 07, 2026 • Leetcode
Super Ugly Number
A super ugly number is a positive integer whose prime factors are in the array primes.
Read more →
