0 solved

The Fibonacci numbers, commonly denoted `F(n)` form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. …

Dynamic Programming Math
1.0s
256MB
0 solved

Given an integer `x`, return `true` if `x` is a palindrome, and `false` otherwise. An integer is a palindrome when it reads the same backward as forward. For example, `121` …

Math
1.0s
256MB

Two Sum

Easy
0 solved

Given an array of integers `nums` and an integer `target`, return the indices of the two numbers such that they add up to `target`. You may assume that each input …

Arrays
2.0s
256MB
0 solved

Given a string `s` containing just the characters `'('`, `')'`, `'{'`, `'}'`, `'['` and `']'`, determine if the input string is valid. An input string is valid if: 1. Open …

Stack Strings
1.0s
256MB
0 solved

Given an integer array `nums`, find the subarray with the largest sum, and return its sum. A subarray is a contiguous non-empty sequence of elements within an array.

Arrays Dynamic Programming
2.0s
256MB