Leetcode-

In this repo , I will provide you the solutions of the leetcode questions which I solved till now .

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Repository files navigation

Leetcode-

About

Uh oh!

Releases

Packages

Name		Name	Last commit message	Last commit date
Latest commit History 424 Commits
2 Keys Keyboard		2 Keys Keyboard
Adding Spaces to a String		Adding Spaces to a String
All Ancestors of a Node in a Directed Acyclic Graph		All Ancestors of a Node in a Directed Acyclic Graph
All O`one Data Structure		All O`one Data Structure
Alternating Groups II		Alternating Groups II
Apply Operations to Maximize Score		Apply Operations to Maximize Score
Apply Operations to an Array		Apply Operations to an Array
Average Waiting Time		Average Waiting Time
Balance a Binary Search		Balance a Binary Search
Best Sightseeing Pair		Best Sightseeing Pair
Binary Tree Postorder Traversal		Binary Tree Postorder Traversal
Bitwise XOR of All Pairings		Bitwise XOR of All Pairings
Build Array from Permutation		Build Array from Permutation
Build a Matrix with Conditions		Build a Matrix with Conditions
Candy		Candy
Check If Array Pairs Are Divisible by k		Check If Array Pairs Are Divisible by k
Check If a Word Occurs As a Prefix of Any Word in a Sentence		Check If a Word Occurs As a Prefix of Any Word in a Sentence
Check if Array Is Sorted and Rotated		Check if Array Is Sorted and Rotated
Check if Grid can be Cut into Sections		Check if Grid can be Cut into Sections
Check if N and its Double exists		Check if N and its Double exists
Check if Number is a Sum of Powers of Three		Check if Number is a Sum of Powers of Three
Check if One String Swap Can Make Strings Equal		Check if One String Swap Can Make Strings Equal
Check if a Parentheses String Can Be Valid		Check if a Parentheses String Can Be Valid
Circular Sentence		Circular Sentence
Clear Digits		Clear Digits
Closest Prime Numbers in Range		Closest Prime Numbers in Range
Combination Sum II		Combination Sum II
Construct Binary Tree from Preorder and Postorder Traversal		Construct Binary Tree from Preorder and Postorder Traversal
Construct K Palindrome Strings		Construct K Palindrome Strings
Construct Smallest Number From DI String		Construct Smallest Number From DI String
Construct String With Repeat Limit		Construct String With Repeat Limit
Construct the Lexicographically Largest Valid Sequence		Construct the Lexicographically Largest Valid Sequence
Continuous Subarrays		Continuous Subarrays
Convert 1D Array Into 2D Array		Convert 1D Array Into 2D Array
Convert Binary Number in a Linked List to Integer		Convert Binary Number in a Linked List to Integer
Count Complete Subarrays in an Array		Count Complete Subarrays in an Array
Count Days Without Meetings		Count Days Without Meetings
Count Equal and Divisible Pairs in an Array		Count Equal and Divisible Pairs in an Array
Count Good Numbers		Count Good Numbers
Count Good Triplets		Count Good Triplets
Count Good Triplets in an Array		Count Good Triplets in an Array
Count Hills and Valleys in an Array		Count Hills and Valleys in an Array
Count Largest Group		Count Largest Group
Count Number of Bad Pairs		Count Number of Bad Pairs
Count Number of Balanced Permutations		Count Number of Balanced Permutations
Count Number of Maximum Bitwise-OR Subsets		Count Number of Maximum Bitwise-OR Subsets
Count Number of Maximum Bitwise-OR Subsets I		Count Number of Maximum Bitwise-OR Subsets I
Count Number of Teams		Count Number of Teams
Count Prefix and Suffix Pairs I		Count Prefix and Suffix Pairs I
Count Servers that Communicate		Count Servers that Communicate
Count Sub Isalnd		Count Sub Isalnd
Count Subarrays Where Max Element Appears at Least K Times		Count Subarrays Where Max Element Appears at Least K Times
Count Subarrays With Fixed Bounds		Count Subarrays With Fixed Bounds
Count Subarrays With Score Less Than K		Count Subarrays With Score Less Than K
Count Subarrays of Length Three With a Condition		Count Subarrays of Length Three With a Condition
Count Symmetric Integers		Count Symmetric Integers
Count Total Number of Colored Cells		Count Total Number of Colored Cells
Count Unguarded Cells in the Grid		Count Unguarded Cells in the Grid
Count Vowel Strings in Ranges		Count Vowel Strings in Ranges
Count Ways To Build Good Strings		Count Ways To Build Good Strings
Count and Say		Count and Say
Count elements with maximum frequency		Count elements with maximum frequency
Count number of Nice subarrays		Count number of Nice subarrays
Count of Interesting Subarrays		Count of Interesting Subarrays
Count of Substrings Containing Every Vowel and K Consonants II		Count of Substrings Containing Every Vowel and K Consonants II
Count the Hidden Sequences		Count the Hidden Sequences
Count the No of Fair Pairs		Count the No of Fair Pairs
Count the Number of Arrays with K Matching Adjacent Elements		Count the Number of Arrays with K Matching Adjacent Elements
Count the Number of Complete Components		Count the Number of Complete Components
Count the Number of Consistent Strings		Count the Number of Consistent Strings
Count the Number of Fair Pairs		Count the Number of Fair Pairs
Count the Number of Good Subarrays		Count the Number of Good Subarrays
Count the Number of Ideal Arrays		Count the Number of Ideal Arrays
Count the Number of Powerful Integers		Count the Number of Powerful Integers
Counting Words With a Given Prefix		Counting Words With a Given Prefix
Course Schedule IV		Course Schedule IV
Cousins in Binary Tree II		Cousins in Binary Tree II
Crawler Log Folder		Crawler Log Folder
Create Binary Tree From Descriptions		Create Binary Tree From Descriptions
Defuse the Bomb		Defuse the Bomb
Delete to Make Fancy String 1		Delete to Make Fancy String 1
Delete Characters to Make Fancy String		Delete Characters to Make Fancy String
Delete Duplicate Folders in System		Delete Duplicate Folders in System
Delete Nodes From Linked List Present in Array		Delete Nodes From Linked List Present in Array
Design Circular Deque		Design Circular Deque
Design a Number Container System		Design a Number Container System
Design a Stack With Increment Operation		Design a Stack With Increment Operation
Different Ways to Add Parentheses		Different Ways to Add Parentheses
Distribute Candies Among Children II		Distribute Candies Among Children II
Divide Array Into Arrays With Max Difference		Divide Array Into Arrays With Max Difference
Divide Nodes Into the Maximum Number of Groups		Divide Nodes Into the Maximum Number of Groups
Divide Players Into Teams of Equal Skill		Divide Players Into Teams of Equal Skill
Divide array into two equal pairs		Divide array into two equal pairs
Divisible and Non-divisible Sums Difference		Divisible and Non-divisible Sums Difference
Domino and Tromino Tiling		Domino and Tromino Tiling
Extra Characters in a String		Extra Characters in a String
FIND COMMON CHARACTER		FIND COMMON CHARACTER
Filling Bookcase Shelves		Filling Bookcase Shelves
Final Array State After K Multiplication Operations I		Final Array State After K Multiplication Operations I
Final Prices With a Special Discount in a Shop		Final Prices With a Special Discount in a Shop

goaish/Leetcode-

Folders and files

Latest commit

History

Repository files navigation

Leetcode-

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Packages