📰 Dev.to · tracelit

Find the kth smallest element in a Binary Search Tree (BST), where k is 1-indexed. The function should return the value of the kth smallest node when all nodes

Design a class that efficiently finds the kth largest element in a stream of integers, where new values are continuously added and we need to return the kth lar

Find the minimum eating speed (bananas per hour) such that Koko can eat all banana piles within h hours, where she can only eat from one pile per hour.

Find the minimum number of jumps needed to reach the last index of an array, where each element represents the maximum jump length from that position.

Given the root of a binary tree, invert the tree by swapping the left and right children of every node, and return the root of the inverted tree.

Implement a Trie (prefix tree) data structure that supports inserting words, searching for complete words, and checking if any words start with a given prefix.

Given an array of non-negative integers representing the amount of money in each house, determine the maximum amount you can rob without robbing two adjacent ho

Determine if a number is happy by repeatedly replacing it with the sum of the square of its digits until it equals 1 (happy) or loops endlessly in a cycle (not

Determine if you can rearrange a hand of cards into groups where each group has exactly W cards forming consecutive sequences.

Given n nodes and a list of undirected edges, determine if the edges form a valid tree. A valid tree must be connected and have exactly n-1 edges with no cycles

Find the starting gas station index from which you can complete a circular trip, where each station has gas to collect and cost to travel to the next station.

Design a data structure that supports adding integers from a data stream and finding the median of all elements added so far in constant time.

Design an algorithm to encode a list of strings into a single string, then decode it back to the original list of strings. The encoded string should handle edge

Given two strings s and t, return the number of distinct subsequences of s which equals t. A subsequence is formed by deleting some characters without changing

Find the diameter of a binary tree, which is the length of the longest path between any two nodes in the tree. The path may or may not pass through the root.

Design a data structure that supports adding words and searching for words with wildcard ''.'' characters that can match any single letter.

Given an array of daily temperatures, return an array where each element represents how many days you have to wait until a warmer temperature. If there is no fu

Given a number of courses and their prerequisites, return the order in which courses should be taken to complete all courses, or an empty array if impossible du

Given an integer n, return an array where the i-th element represents the number of 1-bits in the binary representation of integer i for all numbers from 0 to n

Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.

Given an array of heights representing vertical lines, find two lines that together with the x-axis form a container that can hold the most water.

Find all unique combinations of candidates where the candidate numbers sum to target, where each number may be used multiple times.

Find all unique combinations from a given array of candidates where each number can be used only once and the sum equals the target value.

Given an array of coin denominations and a target amount, find the number of different combinations of coins that make up that amount.