LeetCode

LeetCode Problems' Solutions

LeetCode Top Interview Questions

Array / String | Difficulty - Easy

LeetCode Python

• Merge Sorted Array
• Remove Element
• Remove Duplicates from Sorted Array
• Majority Element
• Best Time to Buy and Sell Stock
• Roman to Integer
• Length of Last Word
• Longest Common Prefix
• Find the Index of the First Occurrence in a String

LeetCode Rust

• Merge Sorted Array
• Remove Element
• Remove Duplicates from Sorted Array
• Majority Element
• Best Time to Buy and Sell Stock
• Roman to Integer
• Length of Last Word
• Longest Common Prefix
• Find the Index of the First Occurrence in a String

70 LeetCode Problems YouTube Video

LeetCode Python

Arrays

• Contains Duplicates
• Missing Number
• Find All Numbers Disappeared in an Array
• Two Sum
• Final Value After Operations
• How Many Numbers Are Smaller Than the Current Number
• Minimum Time Visiting All Points
• Spiral Matrix
• Number of Islands

LeetCode Rust

Arrays

• Contains Duplicates
• Missing Number
• Find All Numbers Disappeared in an Array
• Two Sum
• Final Value After Operations
• How Many Numbers Are Smaller Than the Current Number
• Minimum Time Visiting All Points
• Spiral Matrix
• Number of Islands

LeetCode Python

Arrays Two Pointers

• Best Time to Buy and Sell Stocks
• Squares of a Sorted Array
• 3Sum
• Longest Mountain in Array

LeetCode Rust

Arrays Two Pointers

• Best Time to Buy and Sell Stocks
• Squares of a Sorted Array
• 3Sum
• Longest Mountain in Array

LeetCode Python

Arrays Sliding Windows

• Contains Duplicates II
• Minimum Absolute Difference
• Minimum Size Subarray Sum

LeetCode Rust

Arrays Sliding Windows

• Contains Duplicates II
• Minimum Absolute Difference
• Minimum Size Subarray Sum

LeetCode Python

Bit Manipulation

• Single Number

LeetCode Rust

Bit Manipulation

• Single Number

LeetCode Python

Dynamic Programming

• Coin Change
• Climbing Stairs
• Maximum Subarray
• Counting Bits
• Range Sum Query - Immutable

LeetCode Rust

Dynamic Programming

• Coin Change
• Climbing Stairs
• Maximum Subarray
• Counting Bits
• Range Sum Query - Immutable

LeetCode Python

Back Tracking

• Letter Case Permutation
• Subsets
• Combinations
• Permutations

LeetCode Rust

Back Tracking

• Letter Case Permutation
• Subsets
• Combinations
• Permutations

LeetCode Python

Linked Lists

• Middle of Linked List
• Linked List Cycle
• Reverse Linked List
• Remove Linked List Elements
• Reverse Linked List II
• Palindrome Linked List
• Merge Two Sorted List

LeetCode Rust

Linked Lists

• Middle of Linked List
• Linked List Cycle
• Reverse Linked List
• Remove Linked List Elements
• Reverse Linked List II
• Palindrome Linked List
• Merge Two Sorted List

LeetCode Python

Stacks

• Min Stack
• Valid Parentheses
• Evaluate Reverse Polish Notation
• Stack Sorting

LeetCode Rust

Stacks

• Min Stack
• Valid Parentheses
• Evaluate Reverse Polish Notation
• Stack Sorting

LeetCode Python

Queues

• Implement Stack as Queues
• Time Needed to Buy Ticket
• Reverse The First K Element of a Queue

LeetCode Rust

Queues

• Implement Stack as Queues
• Time Needed to Buy Ticket
• Reverse The First K Element of a Queue

LeetCode Python

Binary Trees

• Average of Levels in Binary Tree
• Minimum Depth of Binary Tree
• Maximum Depth of Binary Tree
• Min/Max Value Binary Tree
• Binary Tree Level Order Traversal
• Same Tree
• Path Sum
• Diameter of a Binary Tree
• Invert Binary Tree
• Lowest Common Ancestor of a Binary Tree

LeetCode Rust

Binary Trees

• Average of Levels in Binary Tree
• Minimum Depth of Binary Tree
• Maximum Depth of Binary Tree
• Min/Max Value Binary Tree
• Binary Tree Level Order Traversal
• Same Tree
• Path Sum
• Diameter of a Binary Tree
• Invert Binary Tree
• Lowest Common Ancestor of a Binary Tree

LeetCode Python

Binary Search Trees

• Search in a Binary Search Tree
• Insert into a Binary Search Tree
• Convert Sorted Arrya to Binary search Tree
• Two Sum IV - Input is a BST
• Lowest Common Ancestor of a Binary Search Tree
• Minimum Absolute Difference in BST
• Balance a Binary Search Tree
• Delete Node in a BST
• Kth Smallest Element in a BST

LeetCode Rust

Binary Search Trees

• Search in a Binary Search Tree
• Insert into a Binary Search Tree
• Convert Sorted Arrya to Binary search Tree
• Two Sum IV - Input is a BST
• Lowest Common Ancestor of a Binary Search Tree
• Minimum Absolute Difference in BST
• Balance a Binary Search Tree
• Delete Node in a BST
• Kth Smallest Element in a BST

LeetCode Python

Heaps

• Kth Largest Element in an Array
• K Closest Point to Origin
• Top K Frequent Elements
• Task Scheduler

LeetCode Rust

Heaps

• Kth Largest Element in an Array
• K Closest Point to Origin
• Top K Frequent Elements
• Task Scheduler

LeetCode Python

Graphs

• Breadth And Depth First Traversal
• Clone Graph
• Core Graph Operations
• Cheapest Flights Within K Stops

LeetCode Rust

Graphs

• Breadth And Depth First Traversal
• Clone Graph
• Core Graph Operations
• Cheapest Flights Within K Stops