1. Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order. ...get Solution
  2. You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list. You may assume the two numbers do not contain any leading zero, except the number 0 itself. ...get Solution
  3. Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). ...get Solution
  4. Given two integers a and b, return the sum of the two integers without using the operators + and -. ...get Solution
  5. Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-231, 231 - 1], then return 0. ...get Solution
  6. Implement the myAtoi(string s) function, which converts a string to a 32-bit signed integer (similar to C/C++'s atoi function). ...get Solution
  7. A valid number can be split up into these components (in order) ...get Solution
  8. An integer is a palindrome when it reads the same backward as forward. ...get Solution
  9. Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list. ...get Solution
  10. Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. ...get Solution
  11. Given an unsorted integer array nums, return the smallest missing positive integer. ...get Solution