📄️ Add Two Numbers
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.
📄️ Longest substring without repeating characters
Given a string s, find the length of the longest substring without repeating characters.
📄️ Rotate Image
You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise).
📄️ Spiral Matrix
Given an m x n matrix, return all elements of the matrix in spiral order.
📄️ Number of Islands
Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.
📄️ Remove starts from string
You are given a string s, which contains stars *.
📄️ Product of Array Except Self
Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].
📄️ Container with most water
You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).
📄️ Increasing triplet subsequence
Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k].
📄️ Decode string
Given an encoded string, return its decoded string.
📄️ Best time to buy & sell stock
You are given an integer array prices where prices[i] is the price of a given stock on the ith day.
📄️ trie
A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of this data structure, such as autocomplete and spellchecker.
📄️ Odd even linked list
Given the head of a singly linked list, group all the nodes with odd indices together followed by the nodes with even indices, and return the reordered list.
📄️ Delete the middle node of a linked list
You are given the head of a linked list. Delete the middle node, and return the head of the modified linked list.
📄️ Dota2 Senate
In the world of Dota2, there are two parties: the Radiant and the Dire.
📄️ String to integer
Problem statement
📄️ Valid Sudoku
Explanation:
📄️ Set Matrix Zeros
📄️ Validate Binary Search Tree
Before moving ahead let us understand what is binary search tree?
📄️ Kth smallest element in BST
Problem statement
📄️ Binary Tree Level Order Traversal
Level order traversal is a method of visiting all nodes in a binary tree level by level, from top to bottom and left to right within each level. It's also known as Breadth-First Search (BFS) for trees.
📄️ Binary Tree Right Side View
Problem Statement
📄️ Largest Number
Given a list of non-negative integers nums, arrange them such that they form the largest number and return it.
📄️ Construct Binary Tree from Preorder and Inorder Traversal
Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, construct and return the binary tree.
📄️ Find All Anagrams in a String
Problem statement
📄️ Longest Palidromic Substring
Problem Statement
📄️ Longest repeating character replacement
Problem statement
📄️ Course Schedule
There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai.
📄️ Lowest Common Ancestor of binary tree.md
Problem statement
📄️ Reorder List
Problem statement
📄️ Rotate list
Problem statement
📄️ Sort List
Problem Statement
📄️ Path sum
Given the root of a binary tree and an integer targetSum, return all root-to-leaf paths where the sum of the node values in the path equals targetSum. Each path should be returned as a list of the node values, not node references.
📄️ Max width of a binary tree
Given the root of a binary tree, return the maximum width of the given tree.