📰 Dev.to · tracelit

Given an array of distinct integers, return all possible permutations of the array elements in any order.

Find the lowest common ancestor (LCA) of two given nodes in a binary search tree, where the LCA is the deepest node that has both nodes as descendants.

Find the maximum profit from buying and selling stocks with a cooldown period of one day after each sale. You can complete multiple transactions but must wait o

Determine if a string containing only parentheses characters is valid, where every opening bracket has a corresponding closing bracket in the correct order.

Find the maximum element in each sliding window of size k as it moves from left to right through an array. Return an array containing the maximum value for each

Watch pointers move through a linked list reversal line by line. Interactive visualization with TraceLit.

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals and return an array of the non-overlapping intervals that cover

Given an array of stone weights, repeatedly smash the two heaviest stones together until at most one stone remains, returning the weight of the last stone or 0

Determine if it''s possible to finish all courses given a list of prerequisite pairs, where each pair [a,b] indicates course a requires course b to be completed

Given an array of coin denominations and a target amount, find the minimum number of coins needed to make up that amount, or return -1 if it''s impossible.

Given a 2D board of characters and a list of words, find all words from the list that can be formed by sequentially adjacent letters on the board, where each ce

Fill each empty room with the distance to its nearest gate, where rooms are represented by a 2D grid with gates (0), walls (-1), and empty rooms (INF).

Find the number of unique paths from the top-left corner to the bottom-right corner of an m x n grid, where you can only move right or down.

Given an elevation map represented by an array of non-negative integers, calculate how much water can be trapped after raining.

Given a 2D board containing ''X'' and ''O'', capture all regions of ''O'' that are completely surrounded by ''X'' by flipping them to ''X''. Regions connected t

Given an integer array nums of unique elements, return all possible subsets (the power set). The solution set must not contain duplicate subsets and can be retu

Find the index of a target value in a rotated sorted array, where a sorted array has been rotated at some pivot point. Return -1 if the target is not found.

Given a 2D grid representing oranges where 0=empty, 1=fresh orange, 2=rotten orange, determine the minimum time in minutes for all fresh oranges to rot, or retu

Given the head of a singly linked list, reorder it by alternating nodes from the beginning and end of the list in-place.

Given an integer array, determine if it can be partitioned into two subsets with equal sum.

Find all cells in a 2D matrix where rainwater can flow to both the Pacific Ocean (left and top edges) and Atlantic Ocean (right and bottom edges), where water f

Find the minimum window substring in string s that contains all characters of string t. If no such window exists, return an empty string.

Find the median of two sorted arrays without merging them into a single array. The overall run time complexity should be O(log (m+n)).

Given the root of a binary tree, return its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthe