Skip to content
Navigation Menu
Sign in
Appearance settings
Platform
AI CODE CREATION
GitHub Copilot
Write better code with AI
GitHub Copilot app
Direct agents from issue to merge
MCP Registry
Integrate external tools
DEVELOPER WORKFLOWS
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Code Quality
Enforce quality at merge
APPLICATION SECURITY
GitHub Advanced Security
Find and fix vulnerabilities
Code security
Secure your code as you build
Secret protection
Stop leaks before they start
EXPLORE
Why GitHub
Documentation
Blog
Changelog
Marketplace
View all features
Solutions
BY COMPANY SIZE
Enterprises
Small and medium teams
Startups
Nonprofits
BY USE CASE
App Modernization
DevSecOps
DevOps
CI/CD
View all use cases
BY INDUSTRY
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
EXPLORE BY TOPIC
AI
Software Development
DevOps
Security
View all topics
EXPLORE BY TYPE
Customer stories
Events & webinars
Ebooks & reports
Business insights
GitHub Skills
SUPPORT & SERVICES
Documentation
Customer support
Community forum
Trust center
Partners
View all resources
Open Source
COMMUNITY
GitHub Sponsors
Fund open source developers
PROGRAMS
Security Lab
Maintainer Community
Accelerator
GitHub Stars
Archive Program
REPOSITORIES
Topics
Trending
Collections
Enterprise
ENTERPRISE SOLUTIONS
Enterprise platform
AI-powered developer platform
AVAILABLE ADD-ONS
GitHub Advanced Security
Enterprise-grade security features
Copilot for Business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
BangKartavya
/
LeetCode
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
1
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
main
Branches
Tags
Go to file
Code
Open more actions menu
Latest commit
History
673 Commits
673 Commits
Folders and files
Name
Name
Last commit message
Last commit date
1-bit and 2-bit Characters
1-bit and 2-bit Characters
2 Keys Keyboard
2 Keys Keyboard
24 Game
24 Game
Add One Row to Tree
Add One Row to Tree
Adding Spaces to a String
Adding Spaces to a String
Adjacent Increasing Subarrays Detection I
Adjacent Increasing Subarrays Detection I
Adjacent Increasing Subarrays Detection II
Adjacent Increasing Subarrays Detection II
Alice and Bob Playing Flower Game
Alice and Bob Playing Flower Game
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
Amount of Time for Binary Tree to Be Infected
Amount of Time for Binary Tree to Be Infected
Append Characters to String to Make Subsequence
Append Characters to String to Make Subsequence
Apple Redistribution into Boxes
Apple Redistribution into Boxes
Apply Operations to Maximize Score
Apply Operations to Maximize Score
Apply Operations to an Array
Apply Operations to an Array
Arithmetic Slices II - Subsequence
Arithmetic Slices II - Subsequence
Assign Cookies
Assign Cookies
Average Waiting Time
Average Waiting Time
Avoid Flood in The City
Avoid Flood in The City
Bag of Tokens
Bag of Tokens
Balance a Binary Search Tree
Balance a Binary Search Tree
Best Sightseeing Pair
Best Sightseeing Pair
Best Time to Buy and Sell Stock V
Best Time to Buy and Sell Stock V
Best Time to Buy and Sell Stock using Strategy
Best Time to Buy and Sell Stock using Strategy
Binary Prefix Divisible By 5
Binary Prefix Divisible By 5
Binary Search Tree to Greater Sum Tree
Binary Search Tree to Greater Sum Tree
Binary Subarrays With Sum
Binary Subarrays With Sum
Binary Tree Postorder Traversal
Binary Tree Postorder Traversal
Bitwise AND of Numbers Range
Bitwise AND of Numbers Range
Bitwise ORs of Subarrays
Bitwise ORs of Subarrays
Bitwise XOR of All Pairings
Bitwise XOR of All Pairings
Boats to Save People
Boats to Save People
Build Array from Permutation
Build Array from Permutation
Buy Two Chocolates
Buy Two Chocolates
Calculate Money in Leetcode Bank
Calculate Money in Leetcode Bank
Candy
Candy
Cheapest Flights Within K Stops
Cheapest Flights Within K Stops
Check If All 1's Are at Least Length K Places Away
Check If All 1's Are at Least Length K Places Away
Check If Array Pairs Are Divisible by k
Check If Array Pairs Are Divisible by k
Check If Digits Are Equal in String After Operations I
Check If Digits Are Equal in String After Operations I
Check If N and Its Double Exist
Check If N and Its Double Exist
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 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
Cherry Pickup II
Cherry Pickup II
Circular Sentence
Circular Sentence
Clear Digits
Clear Digits
Climbing Stairs
Climbing Stairs
Closest Prime Numbers in Range
Closest Prime Numbers in Range
Combination Sum II
Combination Sum II
Compare Version Numbers
Compare Version Numbers
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
Container With Most Water
Container With Most Water
Contiguous Array
Contiguous Array
Continuous Subarray Sum
Continuous Subarray Sum
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
Convert Integer to the Sum of Two No-Zero Integers
Convert Integer to the Sum of Two No-Zero Integers
Convert an Array Into a 2D Array With Conditions
Convert an Array Into a 2D Array With Conditions
Count Complete Subarrays in an Array
Count Complete Subarrays in an Array
Count Covered Buildings
Count Covered Buildings
Count Days Without Meetings
Count Days Without Meetings
Count Elements With Maximum Frequency
Count Elements With Maximum Frequency
Count Equal and Divisible Pairs in an Array
Count Equal and Divisible Pairs in an Array
Count Good Triplets in an Array
Count Good Triplets in an Array
Count Good Triplets
Count Good Triplets
Count Hills and Valleys in an Array
Count Hills and Valleys in an Array
Count Largest Group
Count Largest Group
Count Mentions Per User
Count Mentions Per User
Count Negative Numbers in a Sorted Matrix
Count Negative Numbers in a Sorted Matrix
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 Nice Subarrays
Count Number of Nice Subarrays
Count Number of Teams
Count Number of Teams
Count Odd Numbers in an Interval Range
Count Odd Numbers in an Interval Range
Count Operations to Obtain Zero
Count Operations to Obtain Zero
Count Partitions with Even Sum Difference
Count Partitions with Even Sum Difference
Count Prefix and Suffix Pairs I
Count Prefix and Suffix Pairs I
Count Servers that Communicate
Count Servers that Communicate
Count Square Submatrices with All Ones
Count Square Submatrices with All Ones
Count Sub Islands
Count Sub Islands
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 Submatrices With All Ones
Count Submatrices With All Ones
Count Total Number of Colored Cells
Count Total Number of Colored Cells
Count Triplets That Can Form Two Arrays of Equal XOR
Count Triplets That Can Form Two Arrays of Equal XOR
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
View all files
About
No description, website, or topics provided.
Activity
Stars
1
star
Watchers
1
watching
Forks
0
forks
Report repository
Releases
Packages
Contributors
Languages
You can’t perform that action at this time.