LeetCode 69. Sqrt(x)
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…
Be a Good Techer and Tech for Good. www.goodtecher.com
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…
Description https://leetcode.com/problems/fizz-buzz/ Write a program that outputs the string representation of numbers from 1 to n. But for multiples of three…
Description Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. Your algorithm’s…
Description https://leetcode.com/problems/binary-tree-preorder-traversal/description/ Given a binary tree, return the preorder traversal of its nodes’ values. For example: Given binary tree {1,#,2,3}, 1 \ 2…
Description Given a sorted array of distinct integers and a target value, return the index if the target is found.…
Description https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/ Say you have an array for which the ith element is the price of a given stock on day i. Design…
Description https://leetcode.com/problems/best-time-to-buy-and-sell-stock/ You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your…
Description https://leetcode.com/problems/valid-parentheses/ Given a string s containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[‘ and ‘]’, determine if the input string is valid. An input string is valid…
Description https://leetcode.com/problems/integer-to-roman/ Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from…
Description https://leetcode.com/problems/palindrome-number/ Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. Example 1:…