Climbing Stairs
Climbing Stairs: You are climbing a staircase. It takes n steps to reach the top.
-
-
Squares of a Sorted Array
Squares of a Sorted Array: Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order.
-
Implement Trie (Prefix Tree)
Implement Trie (Prefix Tree): A trie (pronounced as “try”) or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings.
-
Minimum Size Subarray Sum
Minimum Size Subarray Sum: Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal…
-
Permutation in String
Permutation in String: Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise.
-
Pow(x, n)
Pow(x, n): Implement pow(x, n), which calculates x raised to the power n (i.
