📄️ 0184. Department Highest Salary
Solution to Leetcode 184 Department Highest Salary
📄️ 0100 Same Tree
This is a solution to the Same Tree problem on LeetCode.
📄️ 0101 Symmetric Tree
This is a solution to the Symmetric Tree problem on LeetCode.
📄️ 0102 Binary Tree Level Order Traversal
This is a solution to the Binary Tree Level Order Traversal problem on LeetCode.
📄️ 0103-Zigzag Level Order
Given a binary tree, return the zigzag level order traversal of its nodes' values. (i.e., from left to right, then right to left for the next level and alternate between).
📄️ 0104 Maximum Depth of Binary Tree
This is a solution to the Maximum Depth of Binary Tree problem on LeetCode.
📄️ 0105-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.
📄️ 0151-Reverse Words in a String
Given an input string s, reverse the order of the words.
📄️ 0106-Construct-Binary-Tree-from-Inorder-and-postorder-Traversal
Given two integer arrays inorder and postorder where inorder is the inorder traversal of a binary tree and postorder is the postorder traversal of the same tree, construct and return the binary tree.
📄️ 0107-Binary-Tree-Level-Order-Traversal-II
Given the root of a binary tree, return the bottom-up level order traversal of its nodes' values. (i.e., from left to right, level by level from leaf to root).
📄️ 0108-convert-sorted-array-to-binary-search-tree
Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree.
📄️ 0109 Convert Sorted List to Binary Search Tree
This is a solution to the Convert Sorted List to Binary Search Tree problem on LeetCode.
📄️ 0110 Balanced Binary Tree
This is a solution to the Balanced Binary Tree problem on LeetCode.
📄️ 0111-Minimum Depth Of Binary tree
Find the minimum depth of a binary tree, which is the number of nodes along the shortest path from the root node down to the nearest leaf node.
📄️ 0112-Path Sum
Given the root of a binary tree and an integer targetSum, return true if the tree has a root-to-leaf path such that adding up all the values along the path equals targetSum.
📄️ 0113-Path Sum-II
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.
📄️ 0114 Flatten Binary Tree To Linked List
This is a solution to the Flatten Binary Tree To Linked List problem on LeetCode.
📄️ 0115 Distinct SubSequence
Given two strings s and t, return the number of distinct subsequences of s which equals t. The test cases are generated so that the answer fits on a 32-bit signed integer.
📄️ 0116-Populating Next Right Pointers in Each Node
Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.
📄️ 0117 Populating Next Right Pointer To Each Node II
Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.
📄️ 0118-Pascal's Triangle
Generate the first n rows of Pascal's Triangle.
📄️ 0119-Pascal's Triangle II
Return the kth row of Pascal's triangle.
📄️ 120-Min falling path sum in a Triangle
Given a triangular type matrix we need to return the minimum sum for reaching the bottom from the top . in each step we can either move down or diagonally right
📄️ 120-Min falling path sum in a Triangle
Given a triangular type matrix we need to return the minimum sum for reaching the bottom from the top . in each step we can either move down or diagonally right
📄️ 0121-Best-Time-to-Buy-and-Sell-Stock
This is a solution to the Best Time to Buy and Sell Stock problem on LeetCode.
📄️ 0122 Best-Time-to-Buy-and-Sell-Stock -II
This is a solution to the Best Time to Buy and Sell Stock problem -II on LeetCode.
📄️ 0123 -Best-Time-to-Buy-and-Sell-Stock -III
This is a solution to the Best Time to Buy and Sell Stock problem -III on LeetCode.
📄️ 0124-Binary Tree maximum path sum
This is a solution to the Binary Tree maximum path sum on LeetCode.
📄️ 0125 Valid Palindrome
This is a solution to the Valid Palindrome problem on LeetCode.
📄️ 0126 Word ladder II
This is a solution to the word ladder II problem on LeetCode.
📄️ 0127 Word ladder
This is a solution to the word ladder problem on LeetCode.
📄️ 0128-Longest Consecutive Sequence
Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence.
📄️ 0129-Sum root to leaf numbers
You are given the root of a binary tree containing digits from 0 to 9 only.Each root-to-leaf path in the tree represents a number.
📄️ 0130-Surrounded Regions
This is a solution to the Surrounded Regions problem on LeetCode.
📄️ 0131-Palindrom partitioning
This is a solution to the Palindrom Partitioning problem on LeetCode.
📄️ 0132-Palindrom partitioning -II
This is a solution to the Palindrom Partitioning -II problem on LeetCode.
📄️ 0133-Clone graph
This is a solution to the Clone graph problem on LeetCode.
📄️ 0134-Gas station
This is a solution to the Gas station problem on LeetCode.
📄️ 0135 Candy
This is a solution to the Candy problem on LeetCode.
📄️ 0136 Single Number
This is a solution to the Single Number problem on LeetCode.
📄️ 0137 Single Number II
This is a solution to the Single Number ii problem on LeetCode.
📄️ 0138 Copy List with Random Pointer
This is a solution to the Copy List with Random Pointer problem on LeetCode.
📄️ 0139-Word Break
Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words.
📄️ 0140 - Word Break II
This document provides solutions for the Word Break II problem.
📄️ 0141- Linked List Cycle
This is a solution to the Linked List cycle on LeetCode.
📄️ 0142- Linked List Cycle II
This is a solution to the Linked List cycle II on LeetCode.
📄️ 0143 - Reorder List
This is a solution to the Reorder List problem on LeetCode.
📄️ 0144 Binary Tree Preorder Traversal
This is a solution to the Binary Tree Preorder Traversal problem on LeetCode.
📄️ 0145 Binary-Tree-Postorder-Traversal
This is a solution to the Binary-Tree-Postorder-Traversal problem on LeetCode.
📄️ 0146-LRU Cache
This is a solution to the LRU Cache on LeetCode.
📄️ 0147-Insertion sort list
This is a solution to the Insertion sort list problem on LeetCode.
📄️ 0148- Sort List
This is a solution to the Sort List on LeetCode.
📄️ 0149- Max Points on a Line
This is a solution to the Max Point on a Line on LeetCode.
📄️ 150-Evaluate-Reverse-Polish_Notation
Problem Description
📄️ 0152 Maximum Product Subarray
This is a solution to the Maximum Product Subarray problem on LeetCode.
📄️ 0153-Find Minimum in Rotated Sorted Array
Given the sorted rotated array nums of unique elements, return the minimum element of this array.
📄️ 0154-Find Minimum in Rotated Sorted Array-II
Given the sorted rotated array nums of unique elements, return the minimum element of this array.
📄️ 0155-Min stack
Given the sorted rotated array nums of unique elements, return the minimum element of this array.
📄️ 0156-Binary Tree Upside Down
Solution to leetocde 156
📄️ 0157-Read N Characters Given
Solution to leetocde 157
📄️ 0158-Read N Characters Given Read4 -II
Solution to leetocde 157
📄️ 0159-Longest Substring Given At
Solution to leetocde 159
📄️ 0160-Intersection of Two Linked Lists
Solution to leetocde 160
📄️ 0161-One Edit Distance
Solution to leetocde 161
📄️ 0162-Find-Peak-Element
A peak element is an element that is strictly greater than its neighbors. Given a 0-indexed integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks. You may imagine that nums[-1] = nums[n] = -∞. In other words, an element is always considered to be strictly greater than a neighbor that is outside the array. You must write an algorithm that runs in O(log n) time.
📄️ 0163-Missing Range
Solution to the Missing range problem of leetcode
📄️ 0164-Maximum Gap
Given an integer array nums, return the maximum difference between two successive elements in its sorted form. If the array contains less than two elements, return 0.
📄️ 165-compare-version-numbers
Given two version strings, compare them. Return -1, 1, or 0 based on the comparison.
📄️ 0166-Fraction to Recurring Decimal
Given two integers representing the numerator and denominator of a fraction, return the fraction in string format.
📄️ 0167-Two Sum II - Input Array Is Sorted
Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number.
📄️ 0168-Excel Sheet Column Title
Given an integer columnNumber, return its corresponding column title as it appears in an Excel sheet.
📄️ 0169-Majority-Element
Given an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.
📄️ 0170-Two Sum III - Data Structure Design
Design and implement a TwoSum class.
📄️ 0172-Factorial Trailing Zeroes
Given an integer n, return the number of trailing zeroes in n!.
📄️ 0173-Binary Search Tree Iterator
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.
📄️ 0174-Dungeon Game
Given a 2D array representing a dungeon, return the minimum initial health required for a knight to reach the bottom-right corner.
📄️ 0175-Combine Two tables
Solution to the combine two tables problem of leetcode
📄️ 0176-Second highest salary
Given the solution to leetcode second highest salary problem
📄️ 0177-nth highest salary
Given the solution to leetcode nth highest salary problem
📄️ 0178-Rank Scores
Given the solution to leetcode Rank scores problem
📄️ 0179-Largest Number
Given a list of non-negative integers nums, arrange them such that they form the largest number and return it.
📄️ 0180-Consecutive Numbers
Given a table named Logs with two columns id and num we have to find all the numbers which are repeated three times consecutively.
📄️ 0181-Employees Earning More Than Their Managers
Given the solution to leetcode consecutive numbers problem
📄️ 0183. Duplicate Emails
Solution to Leetcode 183. Duplicate Emails
📄️ 0183. Customers Who Never Order
Solution to Leetcode 183. Customers Who Never Order
📄️ 0185-Department Top Three Salaries
Given two tables named Employee table with four columns named id, name, salary, departmentId and Department table with two columns named id, name we have to to find the employees who are high earners in each of the departments.
📄️ 0185-Deaprtment top three salaries
Solution to Leetcode 183. Customers Who Never Order
📄️ 0186-Reverse words in string -II
Given an input string , reverse the string word by word.
📄️ 0187-Repeated DNA Sequences
leetcode solution of problem 187
📄️ 0188-Best Time to Buy and Sell Stock IV
leetcode solution of problem 188
📄️ 0189 Rotate Array
This is a solution to the Rotate Array problem on LeetCode.
📄️ Reverse Bits
Problem Description
📄️ 0191-Number of 1 Bits
Write a function that takes the binary representation of a positive integer and returns the number of set bits it has (also known as the Hamming weight).
📄️ 0192 Word Frequency
This is a solution to the Word Frequency problem.
📄️ 0193-Valid-Phone-Numbers
Problem Description
📄️ 0194-Transpose-File
Problem Description
📄️ 0195-Tenth-Line
Problem Description
📄️ 0196-Delete-Duplicate-Emails
Problem Description
📄️ 0197-Rising-Temperature
Problem Description
📄️ 0189 Rotate Array
This is a solution to the Rotate Array problem on LeetCode.
📄️ 0199 Binary Tree Right Side View
This is a solution to the Binary Tree Right Side View problem on LeetCode.