Reverse Bits LeetCode Solution
Reverse bits of a given 32 bits unsigned integer.
Reverse Bits LeetCode Solution Read More »
Leetcode SolutionEasy
Intersection of Two Linked Lists LeetCode Solution
Given the heads of two singly linked-lists headA and headB, return the node at which the two lists intersect. If the two linked lists have no intersection at all, return null.
Intersection of Two Linked Lists LeetCode Solution Read More »
Leetcode SolutionSingle Number LeetCode Solution
Given a non-empty array of integers nums, every element appears twice except for one. Find that single one.
Single Number LeetCode Solution Read More »
Leetcode SolutionValid Parentheses LeetCode Solution
Given a string s containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[‘ and ‘]’, determine if the input string is valid.
Valid Parentheses LeetCode Solution Read More »
Leetcode SolutionNim Game LeetCode Solution
Given n, the number of stones in the heap, return true if you can win the game assuming both you and your friend play optimally, otherwise return false.
Nim Game LeetCode Solution Read More »
Leetcode SolutionReverse Linked List LeetCode Solution
Given the head of a singly linked list, reverse the list, and return the reversed list.
Reverse Linked List LeetCode Solution Read More »
Leetcode SolutionClimbing Stairs LeetCode Solution
You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
Climbing Stairs LeetCode Solution Read More »
Leetcode SolutionMerge Two Sorted Lists LeetCode Solution
You are given the heads of two sorted linked lists list1 and list2. Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists. Return the head of the merged linked list.
Merge Two Sorted Lists LeetCode Solution Read More »
Leetcode SolutionRemove Element LeetCode Solution
Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The relative order of the elements may be changed.
Remove Element LeetCode Solution Read More »
Leetcode SolutionSearch Insert Position LeetCode Solution
Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
Search Insert Position LeetCode Solution Read More »
Leetcode Solution