abc_begin

ÕªÒª£º Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. The function ÔĶÁÈ«ÎÄ

ÕªÒª£º Given a linked list, determine if it has a cycle in it. Given a linked list, determine if it has a cycle in it. Example Given -21->10->4->5, tail conn ÔĶÁÈ«ÎÄ

ÕªÒª£º Count the number of k's between 0 and n. k can be 0 - 9. Count the number of k's between 0 and n. k can be 0 - 9. Example if n = 12, k = 1 in [0, 1, 2 ÔĶÁÈ«ÎÄ

ÕªÒª£º Write a program to find the node at which the intersection of two singly linked lists begins. Notice If the two linked lists have no intersection at a ÔĶÁÈ«ÎÄ

ÕªÒª£º Given a binary search tree and a new tree node, insert the node into the tree. You should keep the tree still be a valid binary search tree. Notice Yo ÔĶÁÈ«ÎÄ

ÕªÒª£º As the title described, you should only use two stacks to implement a queue's actions. The queue should support push(element), pop() and top() where p ÔĶÁÈ«ÎÄ

ÕªÒª£º In the classic problem of Towers of Hanoi, you have 3 towers and N disks of different sizes which can slide onto any tower. The puzzle starts with dis ÔĶÁÈ«ÎÄ

ÕªÒª£º Given a list, rotate the list to the right by k places, where k is non-negative. Given a list, rotate the list to the right by k places, where k is no ÔĶÁÈ«ÎÄ

ÕªÒª£º Given an array of strings, return all groups of strings that are anagrams. Notice All inputs will be in lower-case Given an array of strings, return a ÔĶÁÈ«ÎÄ

ÕªÒª£º Find the Nth number in Fibonacci sequence. A Fibonacci sequence is defined as follow: The first two numbers are 0 and 1. The i th number is the sum of ÔĶÁÈ«ÎÄ