...

# Category: LeetCode

This is a play ground… Once I have nothing to do, I will go to LeetCode to find some challenges

# <h1>838. Push Dominoes</h1>

There are N dominoes in a line, and we place each domino vertically upright.

In the beginning, we simultaneously push some of the dominoes either to the left or to the right.

...

# <h1>19. Remove Nth Node From End of List</h1>

Given a linked list, remove the n-th node from the end of list and return its head.

Example:

Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the linked list becomes 1->2->3->5.

...

# <h1>902. Numbers At Most N Given Digit Set</h1>

We have a sorted set of digits D, a non-empty subset of {‘1′,’2′,’3′,’4′,’5′,’6′,’7′,’8′,’9’}. (Note that ‘0’ is not included.)

Now, we write numbers using these digits, using each digit as many times as we want. For example, if D = {‘1′,’3′,’5′}, we may write numbers such as ’13’, ‘551’, ‘1351315’.

Return the number of positive integers that can be written (using the digits of D) that are less than or equal to N.

...