📰 Dev.to · tracelit

Given n stairs, find the number of distinct ways to climb to the top where you can climb either 1 or 2 steps at a time.

Given an array of balloons with coin values, find the maximum coins you can collect by bursting all balloons, where bursting a balloon gives coins equal to the

Given the root of a binary tree, return the values of the nodes you can see ordered from top to bottom when looking at the tree from the right side.

Given the root of a binary tree, return the level order traversal of its nodes'' values as a list of lists, where each inner list contains all node values at th

Given a sorted array of integers and a target value, return the index of the target if it exists in the array, otherwise return -1. The algorithm must run in O(

Find the maximum profit you can achieve by buying a stock on one day and selling it on a later day. You can only complete at most one transaction (buy once and

Determine if a binary tree is height-balanced, where for every node the heights of its left and right subtrees differ by at most one.

Given two non-empty linked lists representing two non-negative integers stored in reverse order, add the two numbers and return the sum as a linked list.

Find all unique triplets in an array that sum to zero. Each triplet must contain three distinct elements and no duplicate triplets should be returned.