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
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 }}
Tamilvendhan23
GeeksForGeeks
Repository navigation
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
main
Breadcrumbs
GeeksForGeeks
/
Difficulty: Easy
/
Copy path
Directory actions
More options
More options
Directory actions
More options
More options
Latest commit
History
History
History
main
Breadcrumbs
GeeksForGeeks
/
Difficulty: Easy
/
Copy path
Top
Folders and files
Name
Name
Last commit message
Last commit date
parent directory
..
Anagram
Anagram
Array Duplicates
Array Duplicates
Array Leaders
Array Leaders
Assign Mice Holes
Assign Mice Holes
BFS of graph
BFS of graph
Bird and Max Fruit Gathering
Bird and Max Fruit Gathering
Bitonic Point
Bitonic Point
Buildings with Sunlight
Buildings with Sunlight
Bus Conductor
Bus Conductor
Bus Ticket Change
Bus Ticket Change
Check for BST
Check for BST
Check if a String is Subsequence of Other
Check if a String is Subsequence of Other
Check if an Array is Max Heap
Check if an Array is Max Heap
Chocolate Distribution Problem
Chocolate Distribution Problem
Closest Neighbour in BST
Closest Neighbour in BST
Common in 3 Sorted Arrays
Common in 3 Sorted Arrays
Construct an array from its pair-sum array
Construct an array from its pair-sum array
Count Pairs whose sum is less than target
Count Pairs whose sum is less than target
Count Prefix-Balanced Binary Strings
Count Prefix-Balanced Binary Strings
Count distinct elements in every window
Count distinct elements in every window
Count increasing Subarrays
Count increasing Subarrays
Count pairs Sum in matrices
Count pairs Sum in matrices
Count pairs with given sum
Count pairs with given sum
Coverage of all Zeros in a Binary Matrix
Coverage of all Zeros in a Binary Matrix
DFS of Graph
DFS of Graph
DFS ofGraphDFS
DFS ofGraphDFS
Delete Nodes with Greater on Right
Delete Nodes with Greater on Right
Dominant Pairs
Dominant Pairs
Equal Point in Brackets
Equal Point in Brackets
Equilibrium Point
Equilibrium Point
Express as Consecutive Number Sum
Express as Consecutive Number Sum
Find Kth Rotation
Find Kth Rotation
Find Only Repetitive Element from 1 to n-1
Find Only Repetitive Element from 1 to n-1
Find length of Loop
Find length of Loop
Find the closest pair from two arrays
Find the closest pair from two arrays
Find the first node of loop in linked list
Find the first node of loop in linked list
Generate Binary Numbers
Generate Binary Numbers
Height of Binary Tree
Height of Binary Tree
High Effort vs Low Effort
High Effort vs Low Effort
Inorder Traversal
Inorder Traversal
Intersection of Two Sorted Arrays
Intersection of Two Sorted Arrays
Intersection of Two arrays with Duplicate Elements
Intersection of Two arrays with Duplicate Elements
Isomorphic Strings
Isomorphic Strings
Josephus problem
Josephus problem
Largest Zigzag Sequence
Largest Zigzag Sequence
Largest number in one swap
Largest number in one swap
Largest subarray of 0's and 1's
Largest subarray of 0's and 1's
Left View of Binary Tree
Left View of Binary Tree
Level Order in spiral form
Level Order in spiral form
Level order traversal
Level order traversal
Longest substring with distinct characters
Longest substring with distinct characters
Lowest Common Ancestor in a BST
Lowest Common Ancestor in a BST
Make the array beautiful
Make the array beautiful
Max Digit Sum Number in 1 to n
Max Digit Sum Number in 1 to n
Max Gap Between Two Same
Max Gap Between Two Same
Max Sum Subarray of size K
Max Sum Subarray of size K
Maximize partitions in a String
Maximize partitions in a String
Maximum Sum Problem
Maximum Sum Problem
Mean of range in array
Mean of range in array
Meeting Rooms
Meeting Rooms
Minimum Deletions to Make Sorted
Minimum Deletions to Make Sorted
Minimum Moves to Sort Permutation
Minimum Moves to Sort Permutation
Minimum Toogles to partition
Minimum Toogles to partition
Mirror Tree
Mirror Tree
Missing And Repeating
Missing And Repeating
Missing in Array
Missing in Array
Move All Zeroes to End
Move All Zeroes to End
Non Repeating Character
Non Repeating Character
Number of occurrence
Number of occurrence
Pair with given sum in a sorted array
Pair with given sum in a sorted array
Pairs with Given GCD and LCM
Pairs with Given GCD and LCM
Pairs with Less Than K Diff
Pairs with Less Than K Diff
Pairs with certain difference
Pairs with certain difference
Palindrome Binary
Palindrome Binary
Palindrome Sentence
Palindrome Sentence
Parenthesis Checker
Parenthesis Checker
Perimeter of Shapes in Binary Matrix
Perimeter of Shapes in Binary Matrix
Postorder Traversal
Postorder Traversal
Print Diagonally
Print Diagonally
Product array puzzle
Product array puzzle
Queue Reversal
Queue Reversal
Replace with XOR of Adjacent
Replace with XOR of Adjacent
Reverse a Doubly Linked List
Reverse a Doubly Linked List
Reverse a linked list
Reverse a linked list
Roman Number to Integer
Roman Number to Integer
Rotate Deque By K
Rotate Deque By K
Rotate by 90 degree
Rotate by 90 degree
Search in a Row-Column sorted matrix
Search in a Row-Column sorted matrix
Search in a row-wise sorted matrix
Search in a row-wise sorted matrix
Search insert position of K in a sorted array
Search insert position of K in a sorted array
Seating Arrangement
Seating Arrangement
Segregate 0s and 1s
Segregate 0s and 1s
Shop in Candy Store
Shop in Candy Store
Smallest window containing 0, 1 and 2
Smallest window containing 0, 1 and 2
Sort 0s, 1s and 2s
Sort 0s, 1s and 2s
Sort by Set Bit Count
Sort by Set Bit Count
Sorted and Rotated Minimum
Sorted and Rotated Minimum
Split Array into Minimum Subsets
Split Array into Minimum Subsets
Stock Buy and Sell – Max one Transaction Allowed
Stock Buy and Sell – Max one Transaction Allowed
Strings Rotations of Each Other
Strings Rotations of Each Other
View all files
You can’t perform that action at this time.