leetcode-potd

Given a string formula representing a chemical formula, return the count of each atom. The atomic element always starts with an uppercase character, […]

There are n 1-indexed robots, each having a position on a line, health, and movement direction. You are given 0-indexed integer arrays positions, healths, and a string directions (directions[i] is

You are given a string s and two integers x and y. You can perform two types of operations any number of times. Remove substring “ab” and

You are given a string s that consists of lower case English letters and brackets. Reverse the strings in each pair of

The Leetcode file system keeps a log each time some user performs a change folder operation. The operations are described below: “../” :

Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome

You are given the root of a binary tree containing digits from 0 to 9 only. Each root-to-leaf path in the tree represents a number. For

Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two

Given the root of a binary tree, return the inorder traversal of its nodes’ values. Example 1: Input: root = [1,null,2,3] Output: [1,3,2]

A message containing letters from A-Z can be encoded into numbers using the following mapping: ‘A’ -> “1” ‘B’ -> “2” … ‘Z’ ->

Given a rows x cols binary matrix filled with 0‘s and 1‘s, find the largest rectangle containing only 1‘s and return its area. Example 1: Input: matrix =

There is a restaurant with a single chef. You are given an array customers, where customers[i] = [arrivali, timei]: arrivali is the arrival