LeetCode 189. Rotate Array
Description https://leetcode.com/problems/rotate-array/ Given an array, rotate the array to the right by k steps, where k is non-negative. Example 1: Input: [1,2,3,4,5,6,7] and k…
Be a Good Techer and Tech for Good. www.goodtecher.com
Description https://leetcode.com/problems/rotate-array/ Given an array, rotate the array to the right by k steps, where k is non-negative. Example 1: Input: [1,2,3,4,5,6,7] and k…
Description https://leetcode.com/problems/contains-duplicate/ Given an array of integers, find if the array contains any duplicates. Your function should return true if…
Description https://leetcode.com/problems/plus-one/ You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are…
Description https://leetcode.com/problems/reverse-string/ Write a function that reverses a string. The input string is given as an array of characters char[]. Do…
Description https://leetcode.com/problems/maximum-subarray/ Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum…
Description Given a string, find the first non-repeating character in it and return it’s index. If it doesn’t exist, return…
Description https://leetcode.com/problems/binary-tree-level-order-traversal/ Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by…
Description Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest…
Description https://leetcode.com/problems/trapping-rain-water/description/ Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water…
Description Implement int sqrt(int x). Compute and return the square root of x, where x is guaranteed to be a non-negative integer. Since the…