In this post I will discuss the solution to the leetcode problem — Remove Duplicates from Sorted List. Problem: Given the head of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well. Example 1: Input: head = [1,1,2] Output…

In this post I will discuss the solution to the leetcode problem — Climbing Stairs. Problem: 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? Example…

In this post I will discuss the solution to the leetcode problem —Plus One. Problem: Given a non-empty array of decimal digits representing a non-negative integer, increment one to the integer. The digits are stored such that the most significant digit is at the head of the list, and each element…

In this post I will discuss the solution to the leetcode problem — Length of Last Word. Problem: Given a string s consists of some words separated by spaces, return the length of the last word in the string. If the last word does not exist, return 0. A word is…

In this post I will discuss the solution to the leetcode problem — Remove Element Problem: Given an array nums and a value val, remove all instances of that value in-place and return the new length. Do not allocate extra space for another array, you must do this by modifying the…

In this post I will discuss the solution to the leetcode problem — Remove Duplicates from Sorted Array Problem: Given a sorted array nums, remove the duplicates in-place such that each element appears only once and returns the new length. Do not allocate extra space for another array, you must do…

In this post I will discuss the solution to the leetcode problem — Merge Two Sorted Lists. Problem: Merge two sorted linked lists and return it as a sorted list. The list should be made by splicing together the nodes of the first two lists. Example 1: Input: l1 = [1,2,4]…

In this post I will discuss the solution to the leetcode problem — Valid Parentheses. Problem: Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An input string is valid if: Open brackets must be closed by the…

In this post I will discuss the solution to the leetcode problem — Longest Common Prefix. Problem: Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". Example 1: Input: strs = ["flower","flow","flight"] Output: "fl" …