Skip to content
Navigation Menu
Sign in
Products
Platform
GitHub
Repository hosting, code review, and collaboration
Copilot
AI coding agent for tasks, projects, and automated work
Build & Ship
Actions
CI/CD and automation
Code Quality
Quality analysis, fixes, and enforcement
Codespaces
Cloud development environments
Secure
Code Security
Vulnerability detection and remediation
Secret Protection
Secret scanning and leak prevention
All Features
Developers
Learn
Documentation
Training
Certifications
Build
Build with Copilot
Customize Copilot
Integrations
Explore
Trending repos
GitHub Sponsors
Developer articles
Changelog
Changelog
Your source for the latest features, improvements, and fixes across GitHub products, all in one place.
Businesses
By Stage
Enterprises
Team
Startups
Nonprofits
By Industry
Healthcare
Financial services
Manufacturing
Government
See all industries
Evaluate GitHub
Why GitHub
Customer Stories
Business insights
Trust Center
Add-ons
GitHub Advanced Security
Enterprise-grade code security
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Resources
Learn & Connect
Documentation
Resource center
Blog
Events & webinars
Community Forum
Customer Stories
Integrations
Support
Customer support
Training
GitHub Status
Company
About
Partners
Changelog
GitHub Universe
GitHub Universe
The event for developers, by developers — talks, workshops, and what’s next for GitHub.
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 }}
nikolatechie
Algorithms-and-Data-structures
Repository navigation
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Algorithms-and-Data-structures
Public
Notifications
You must be signed in to change notification settings
Fork
0
(
0
)
Star
0
(
0
)
You must be signed in to star a repository
About
Implementations of data structures and algorithms
Resources
Readme
Activity
Stars
0
stars
Watchers
1
watching
Forks
0
forks
Report repository
master
Branches
Tags
Go to file
Code
Open more actions menu
Latest commit
History
90 Commits
90 Commits
Folders and files
Name
Name
Last commit message
Last commit date
2D Fenwick Tree-BIT.cpp
2D Fenwick Tree-BIT.cpp
2D Kadane's algorithm.cpp
2D Kadane's algorithm.cpp
2D Segment Tree - RSQ.cpp
2D Segment Tree - RSQ.cpp
2D Sparse Table - RMQ.cpp
2D Sparse Table - RMQ.cpp
Area of Polygon.cpp
Area of Polygon.cpp
Bellman Ford's algorithm.cpp
Bellman Ford's algorithm.cpp
Centroid Decomposition structure.cpp
Centroid Decomposition structure.cpp
Check if two line segments intersect.cpp
Check if two line segments intersect.cpp
Closest pair of points.cpp
Closest pair of points.cpp
Convex hull - Jarvis' gift wrapping algorithm.cpp
Convex hull - Jarvis' gift wrapping algorithm.cpp
Count inversions using Merge sort.cpp
Count inversions using Merge sort.cpp
Count subsets whose sum is in given range - Meet In The Middle.cpp
Count subsets whose sum is in given range - Meet In The Middle.cpp
Dijkstra's algorithm - SSSP.cpp
Dijkstra's algorithm - SSSP.cpp
Dynamic Segment Tree.cpp
Dynamic Segment Tree.cpp
Euler's Totient Function - phi.cpp
Euler's Totient Function - phi.cpp
Euler's Totient Function for numbers up to N.cpp
Euler's Totient Function for numbers up to N.cpp
Expression parsing.cpp
Expression parsing.cpp
Extended Euclidean algorithm for GCD.cpp
Extended Euclidean algorithm for GCD.cpp
Fast Fibonacci.cpp
Fast Fibonacci.cpp
Fast Modular Exponentiation.cpp
Fast Modular Exponentiation.cpp
Fast Modular Multiplication.cpp
Fast Modular Multiplication.cpp
Faster Binary Search.cpp
Faster Binary Search.cpp
Fenwick Tree-BIT: Max sum of increasing subsequences.cpp
Fenwick Tree-BIT: Max sum of increasing subsequences.cpp
Find all topological sortings.cpp
Find all topological sortings.cpp
Finding bridges in a graph.cpp
Finding bridges in a graph.cpp
Floyd Warshall's algorithm.cpp
Floyd Warshall's algorithm.cpp
Ford Fulkerson's Max Flow algorithm.cpp
Ford Fulkerson's Max Flow algorithm.cpp
Heavy-light decomposition + Segment Tree with lazy propagation.cpp
Heavy-light decomposition + Segment Tree with lazy propagation.cpp
Implicit Splay Tree.cpp
Implicit Splay Tree.cpp
Implicit Treap.cpp
Implicit Treap.cpp
K-th smallest element - Quickselect algorithm.cpp
K-th smallest element - Quickselect algorithm.cpp
KMP Search.cpp
KMP Search.cpp
Knapsack with infinite stock - DP.cpp
Knapsack with infinite stock - DP.cpp
Kosaraju's Strongly Connected Components.cpp
Kosaraju's Strongly Connected Components.cpp
Leftist Heap.cpp
Leftist Heap.cpp
Longest common subsequence - DP.cpp
Longest common subsequence - DP.cpp
Longest common substring - DP.cpp
Longest common substring - DP.cpp
Longest palindromic subsequence - DP.cpp
Longest palindromic subsequence - DP.cpp
Longest substring repeated k times using Suffix array.cpp
Longest substring repeated k times using Suffix array.cpp
Maximum Bipartite Matching.cpp
Maximum Bipartite Matching.cpp
Maximum XOR Submatrix using Trie.cpp
Maximum XOR Submatrix using Trie.cpp
Median of two sorted arrays of same size.cpp
Median of two sorted arrays of same size.cpp
Min Heap.cpp
Min Heap.cpp
Minimum number of insertions to form a palindrome - DP.cpp
Minimum number of insertions to form a palindrome - DP.cpp
Pair with maximum GCD.cpp
Pair with maximum GCD.cpp
Palindrome pairs using bitmasks.cpp
Palindrome pairs using bitmasks.cpp
Persistent Segment Tree with graph.cpp
Persistent Segment Tree with graph.cpp
Persistent Treap.cpp
Persistent Treap.cpp
Persistent Trie.cpp
Persistent Trie.cpp
README.md
README.md
SQRT Decomposition + Mo's algorithm.cpp
SQRT Decomposition + Mo's algorithm.cpp
Sack - DSU on Tree (HLD style).cpp
Sack - DSU on Tree (HLD style).cpp
Segment Tree - Finding LCA.cpp
Segment Tree - Finding LCA.cpp
Self-organizing list.cpp
Self-organizing list.cpp
Shortest Common Supersequence - DP.cpp
Shortest Common Supersequence - DP.cpp
Shortest path in a graph with exactly K edges.cpp
Shortest path in a graph with exactly K edges.cpp
Sparse Table - Finding LCA.cpp
Sparse Table - Finding LCA.cpp
Splay Tree.cpp
Splay Tree.cpp
String hashing - counting all palindromes.cpp
String hashing - counting all palindromes.cpp
String rolling hash - pattern searching.cpp
String rolling hash - pattern searching.cpp
Suffix array - count distinct substrings.cpp
Suffix array - count distinct substrings.cpp
Suffix array and LCP.cpp
Suffix array and LCP.cpp
Tarjan's algorithm for finding articulation points.cpp
Tarjan's algorithm for finding articulation points.cpp
Tower of Hanoi.cpp
Tower of Hanoi.cpp
Treap.cpp
Treap.cpp
Trie.cpp
Trie.cpp
Wavelet Tree.cpp
Wavelet Tree.cpp
Z algorithm for pattern searching.cpp
Z algorithm for pattern searching.cpp
View all files
Repository files navigation
README
More
items
Algorithms-and-Data-structures
Implementations of data structures and algorithms
About
Implementations of data structures and algorithms
Resources
Readme
Activity
Stars
0
stars
Watchers
1
watching
Forks
0
forks
Report repository
Releases
Packages
Contributors
Languages
You can’t perform that action at this time.