Skip to main content

Leetcode Problems

 

Leetcode 1: Two Sum

Leetcode 2: Add Two Numbers

Leetcode 3: Longest Substring Without Repeating Characters

Leetcode 4: Median of Two Sorted Arrays

Leetcode 5: Longest Palindromic Substring

Leetcode 6: Zigzag Conversion

Leetcode 7: Reverse Integer

Leetcode 8: String to Integer (atoi)

Leetcode 9: Palindrome Number

Leetcode 10: Regular Expression Matching

Leetcode 11: Container With Most Water

Leetcode 12: Integer to Roman

Leetcode 13: Roman to Integer

Leetcode 14: Longest Common Prefix

Leetcode 15: 3Sum

Leetcode 16: 3Sum Closest

Leetcode 17: Letter Combinations of a Phone Number

Leetcode 18: 4Sum

Leetcode 19:Remove Nth Node From End of List

Leetcode 20: Valid Parentheses

Leetcode 21: Merge two Sorted Lists

Leetcode 22: Generate Parentheses

Leetcode 23: Merge k Sorted lists

Leetcode 24: Swap Nodes in Pairs

Leetcode 25: Reverse Nodes in k-group

Leetcode 26: Remove Duplicates from Sorted Array

Leetcode 27: Remove Element

Leetcode 28: Find the Index of the First Occurrence in a String

Leetcode 29: Divide Two Integers

Leetcode 30: Substring with Concatenation of All Words

Leetcode 31: Next Permutation

Leetcode 32: Longest Valid Parentheses

Leetcode 33: Search in Rotated Sorted Array

Leetcode 34: Find First and Last Position of Element in Sorted Array

Leetcode 35: Search Insert Position

Leetcode 36: Valid Sudoku

Leetcode 37: Sudoku Solver

Leetcode 38: Count and Say

Leetcode 39: Combination Sum

Leetcode 40: Combination Sum II

Leetcode 41: First Missing Positive

Leetcode 42: Trapping Rain Water

Leetcode 43: Multiply Strings

Leetcode 44: Wildcard Matching

Leetcode 45: Jump Game II

Leetcode 46: Permutations

Leetcode 47: Permutations II

Leetcode 48: Rotate Image

Leetcode 49: Group Anagrams

Leetcode 50: Pow(x, n)

Comments

Popular posts from this blog

Leetcode 1: Two Sum

  Leetcode Link: https://leetcode.com/problems/two-sum/ 1. Problem Statement (Simple Explanation) You are given: An array of integers nums An integer target You need to  return the indices of two numbers in the array  such that: Conditions: Each input has  exactly one solution . You  cannot use the same element twice . You can return the answer in  any order . 2. Examples Example 1 Input:                                    nums = [2, 7, 11, 15], target = 9 Output:                                 [0, 1] Explanation:                     nums[0]+nums[1]=2+7=9              So we return [0, 1]. Example 2 Input:           ...

Leetcode 3: Longest Substring Without Repeating Characters

  Leetcode Link 1. Problem Statement (Simple Explanation) You are given a string s. You need to find the length of the longest substring of s that does not  contain any repeated characters. A substring is a contiguous sequence of characters in the string. You must return an integer length, not the substring itself. 2. Examples Example 1 Input: s = "abcabcbb" Output: 3 Explanation: Some substrings without repeating characters: "abc", "bca", "cab"The longest length is 3. Example 2 Input: s = "bbbbb" Output: 1 Explanation: All substrings that are valid are just "b". The longest length is 1. Example 3 Input:   s = "pwwkew" Output:   3 Explanation: Possible substrings without repetition: "pw", "wke", "kew". "wke" or "kew" have length 3. "pwke" is not valid because it’s not contiguous in the original string (p and k are separated by ww). Constraints...

Leetcode 2: Add Two Numbers

Leetcode Link: https://leetcode.com/problems/add-two-numbers/ 1. Problem Statement (Simple Explanation) You are given  two non-empty linked lists , l1 and l2, that represent two non-negative integers. Each node contains a  single digit . The digits are stored in  reverse order  (i.e., the 1’s digit is at the head). You need to  add the two numbers  and return the  sum as a linked list , also in reverse order. You can assume: There are  no leading zeros , except when the number itself is 0. 2. Examples Example 1 Input:                l1 = [2,4,3]                l2 = [5,6,4]           Interpreting linked lists as numbers (reverse order): l1 represents 342 l2 represents 465 Output:                [7,0,8] Explanation:        ...