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…
Tag: Microsoft Interview Question
LeetCode 217. Contains Duplicate
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…
LeetCode 66. Plus One
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…
LeetCode 344. Reverse String
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…
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…
LeetCode 70. Climbing Stairs
Description https://leetcode.com/problems/climbing-stairs/ You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In…
LeetCode 387. 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, return…
LeetCode 26. Remove Duplicates from Sorted Array
Description https://leetcode.com/problems/remove-duplicates-from-sorted-array/ Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length. Do not…
LeetCode 102. Binary Tree Level Order Traversal
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…
LeetCode 101. Symmetric Tree
Description https://leetcode.com/problems/symmetric-tree/description/ Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For…