Validate if a given string can be interpreted as a decimal number.
You’re given strings J representing the types of stones that are jewels, and S representing the stones you have. Each character in S is a type of stone you have. You want to know how many of the stones you have are also jewels.
Given a non-empty array of digits representing a non-negative integer, plus one to the integer.
Given two non-negative integers
num2 represented as strings, return the product of
num2, also represented as a string.
Given an absolute path for a file (Unix-style), simplify it.
In a UNIX-style file system, a period (‘.’) refers to the current directory, so it can be ignored in a simplified path.
Implement a trie with
Given an array, rotate the array to the right by k steps, where k is non-negative.
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences.
Given a non-empty string s and a dictionary wordDict containing a list of non-emptywords, determine if s can be segmented into a space-separated sequence of one or more dictionary words.