📰 Dev.to · tracelit

Given a positive integer n, count and return the number of set bits (1s) in its binary representation.

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

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

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

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

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

Given an array of integers and a number k, return the k most frequently occurring elements in the array.

Calculate the sum of two integers without using the + or - operators, implementing addition using only bitwise operations.

Given two strings s1 and s2, return true if s2 contains a permutation of s1. A permutation is a rearrangement of characters, so we need to find if any substring

Given a 2D grid map of ''1''s (land) and ''0''s (water), count the number of islands where an island is surrounded by water and formed by connecting adjacent la

Design and implement a data structure for Least Recently Used (LRU) cache that supports get and put operations in O(1) time complexity.

Find the length of the longest substring containing the same letter that you can get after performing at most k character replacements. You can replace any char

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.

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