All Posts

Leetcode 581: Shortest Unsorted Continuous Subarray

Given an integer array, find the shortest continuous subarray such that, if you sort this subarray in non-decreasing order, the whole array will become sorted.

Leetcode 609: Find Duplicate File in System

Given a list of directory paths, each containing file names and their content, return the groups of duplicate files that have the same content.

Leetcode 611: Valid Triangle Number

Given an array of integers, return the number of triplets that can form a valid triangle. A valid triangle is formed when the sum of any two sides is greater than the third side.

Leetcode 621: Task Scheduler

Given a list of tasks and a number n, determine the minimum number of CPU intervals required to complete all tasks, respecting the constraint that the same task must be separated by at least n intervals.

Leetcode 622: Design Circular Queue

Design and implement a Circular Queue. A circular queue is a linear data structure where the operations follow the FIFO principle, and the last position is connected to the first, forming a circle. This design allows better space utilization.

Leetcode 624: Maximum Distance in Arrays

You are given m sorted arrays. Your task is to pick two integers, each from a different array, and calculate the maximum distance between them, where the distance is defined as the absolute difference of the two numbers.