xperzy.github.io

yucoding.blogspot.com

Yu's Coding Garden : leetCode Question: Serialize and Deserialize Binary Tree

http://yucoding.blogspot.com/2017/01/leetcode-question-serialize-and.html

My blog for LeetCode Questions and Answers. Tuesday, January 3, 2017. LeetCode Question: Serialize and Deserialize Binary Tree. Serialize and Deserialize Binary Tree. Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment. For example, you may serialize the following tree. Let's first see the simpl...

yucoding.blogspot.com

Yu's Coding Garden : leetCode Question: H-Index II

http://yucoding.blogspot.com/2016/12/leetcode-question-h-index-ii.html

My blog for LeetCode Questions and Answers. Thursday, December 15, 2016. LeetCode Question: H-Index II. Follow up for H-Index. Array is sorted in ascending order? Could you optimize your algorithm? This problem added another condition that the array is already sorted. And the time requirement is restricted to O(log n). Naturally, O(log n) reminds us to use binary search approach. C[mid] = sz - mid. C[mid] sz - mid. C[mid] sz - mid. Subscribe to: Post Comments (Atom). My Google Scholar Page: here. All the...

yucoding.blogspot.com

Yu's Coding Garden : LeetCode Online Judge Questions Table

http://yucoding.blogspot.com/2014/04/leetcode-online-judge-questions-table.html

My blog for LeetCode Questions and Answers. Sunday, April 23, 2017. LeetCode Online Judge Questions Table. Range Sum Query - Immutable. Serialize and Deserialize Binary Tree. Find Median from Data Stream. Find the Duplicate Number. Two Pointers, Linked list. Integer to English Words. Different Ways to Add Parentheses. Search a 2D Matrix II. Product of Array Except Self. Delete Node in a Linked List. Lowest Common Ancestor of a Binary Tree. Lowest Common Ancestor of a Binary Search Tree. Number of 1 Bits.

yucoding.blogspot.com

Yu's Coding Garden : leetcode Question: Perfect Squares

http://yucoding.blogspot.com/2016/12/leetcode-question-perfect-square.html

My blog for LeetCode Questions and Answers. Monday, December 19, 2016. Leetcode Question: Perfect Squares. Given a positive integer. Find the least number of perfect square numbers (for example,. For example, given. For this problem, I'd like to show the approach using BFS, and the DP. These methods is not very optimal since there is a mathematical soluiton can runs much faster. However, this problem also serves as a good practice for the BFS and DP. Every time we subtract the value. I am starting to add.

yucoding.blogspot.com

Yu's Coding Garden : leetCode Question: Nim Game

http://yucoding.blogspot.com/2017/01/leetcode-question-nim-game.html

My blog for LeetCode Questions and Answers. Tuesday, January 3, 2017. LeetCode Question: Nim Game. You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be the winner. You will take the first turn to remove the stones. Let's first simulate the game with a small number of stones, say 4. We will take the first turn to remove the stones. We take 1, 3 left. We take 2, 3 ...

yucoding.blogspot.com

Yu's Coding Garden : leetcode Question: Range Sum Query - Immutable

http://yucoding.blogspot.com/2017/01/leetcode-question-range-sum-query.html

My blog for LeetCode Questions and Answers. Thursday, January 5, 2017. Leetcode Question: Range Sum Query - Immutable. Range Sum Query - Immutable. Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive. Given nums = [-2, 0, 3, -5, 2, -1]. SumRange(0, 2) - 1. SumRange(2, 5) - -1. SumRange(0, 5) - -3. You may assume that the array does not change. There are many calls to sumRange function. Nums = [-2, 0, 3, -5, 2, -1]. Sum[ i ] can be viewed as sum[ 0 to i ].

yucoding.blogspot.com

Yu's Coding Garden : leetcode Question: Ugly Number II

http://yucoding.blogspot.com/2016/11/leetcode-question-ugly-number-ii.html

My blog for LeetCode Questions and Answers. Wednesday, November 30, 2016. Leetcode Question: Ugly Number II. Write a program to find the. Ugly numbers are positive numbers whose prime factors only include. Is the sequence of the first. Is typically treated as an ugly number. This problem needs a little thinking about how to generate the next ugly number. From the definition and examples we know that:. Maintain 3 lists, each one stores the ugly number times 2, 3, and 5, respectively. I have just got my Ph...

yucoding.blogspot.com

Yu's Coding Garden : leetCode Question: Integer to English Words

http://yucoding.blogspot.com/2016/12/leetcode-question-integer-to-english.html

My blog for LeetCode Questions and Answers. Friday, December 16, 2016. LeetCode Question: Integer to English Words. Integer to English Words. Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 2 31. 123 - "One Hundred Twenty Three" 12345 - "Twelve Thousand Three Hundred Forty Five" 1234567 - "One Million Two Hundred Thirty Four Thousand Five Hundred Sixty Seven". This problem is not difficult but should pay more attention for the corner cases.

yucoding.blogspot.com

Yu's Coding Garden : leetCode Question: Find Median from Data Stream

http://yucoding.blogspot.com/2017/01/leetcode-question-find-median-from-data.html

My blog for LeetCode Questions and Answers. Friday, January 6, 2017. LeetCode Question: Find Median from Data Stream. Find Median from Data Stream. Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value. 2,3,4] , the median is 3. 2,3], the median is (2 3) / 2 = 2.5. Design a data structure that supports the following two operations:. Double findMedian() - Return the median of all elements so far.

yucoding.blogspot.com

Yu's Coding Garden : leetCode Question: First Bad Version

http://yucoding.blogspot.com/2016/12/leetcode-question-first-bad-version.html

My blog for LeetCode Questions and Answers. Friday, December 16, 2016. LeetCode Question: First Bad Version. You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also bad. And you want to find out the first bad one, which causes all the following ones to be bad. You are given an API. We know that ever...