# LeetCode 53. Maximum Subarray

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 and…

Be a Good Techer and Tech for Good. www.goodtecher.com

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 and…

Description https://leetcode.com/problems/first-unique-character-in-a-string/description/ Given a string, find the first non-repeating character in it and return it’s index. If it doesn’t exist,…

Description https://leetcode.com/problems/binary-tree-level-order-traversal/description/ Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by…

Description https://leetcode.com/problems/maximum-depth-of-binary-tree/description/ Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the…

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 https://leetcode.com/problems/sqrtx/description/ Implement int sqrt(int x). Compute and return the square root of x. x is guaranteed to be a non-negative integer. Example…

Description https://leetcode.com/problems/reverse-integer/ Reverse digits of an integer. Example1: x = 123, return 321Example2: x = -123, return -321 Explanation The…

Description https://leetcode.com/problems/two-sum/ Given an array of integers, return indices of the two numbers such that they add up to a specific target.…