📰 Dev.to · tracelit

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 minimum cost to connect all points in a 2D plane where the cost between any two points is the Manhattan distance (sum of absolute differences of coordi

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

Given a string, find and return the longest contiguous substring that reads the same forwards and backwards (palindrome).

Given an unsorted array of integers, find the length of the longest sequence of consecutive elements. The algorithm must run in O(n) time complexity.

Find the kth largest element in an unsorted array. Note that it is the kth largest element in sorted order, not the kth distinct element.

Given an array of non-negative integers where each element represents the maximum jump length from that position, determine if you can reach the last index star

Find the maximum amount of money you can rob from houses arranged in a circle, where you cannot rob two adjacent houses and the first and last houses are neighb

Group anagrams together from an array of strings, where anagrams are words that contain the same characters in different orders.

Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2. The allowed operations are insert, delete, or rep

Design a simplified Twitter system that supports posting tweets, following/unfollowing users, and retrieving a user''s news feed containing the 10 most recent t

Count the number of ''good'' nodes in a binary tree, where a node is considered good if there are no nodes with a value greater than it in the path from root to

Given two arrays representing preorder and inorder traversals of a binary tree, reconstruct and return the original binary tree.

Given cars at different positions with different speeds all heading to the same target, determine how many car fleets will arrive at the target. Cars form a fle

Find the maximum sum of any path in a binary tree, where a path is defined as any sequence of nodes connected by parent-child relationships. The path can start

Given a list of words from an alien language sorted lexicographically, determine the order of letters in the alien alphabet. Return the alien dictionary as a st

Given a 2D board of characters and a target word, determine if the word exists in the grid by connecting adjacent cells horizontally or vertically.

Find the length of the shortest transformation sequence from beginWord to endWord, where each transformation changes exactly one letter and each intermediate wo

Given a string s and a dictionary of words wordDict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.

Given the root of a binary tree, determine if it is a valid binary search tree where all left descendants are less than the node and all right descendants are g

Determine if a string containing parentheses ''('', '')'', and wildcards ''*'' is valid, where ''*'' can represent ''('', '')'', or an empty string.

Determine if a given string is a valid palindrome, considering only alphanumeric characters and ignoring cases. A palindrome reads the same forward and backward