René's URL Explorer Experiment


Title: GitHub - Barun-Kumar/Algorithms: A collection of algorithms and data structures · GitHub

Open Graph Title: GitHub - Barun-Kumar/Algorithms: A collection of algorithms and data structures

X Title: GitHub - Barun-Kumar/Algorithms: A collection of algorithms and data structures

Description: A collection of algorithms and data structures. Contribute to Barun-Kumar/Algorithms development by creating an account on GitHub.

Open Graph Description: A collection of algorithms and data structures. Contribute to Barun-Kumar/Algorithms development by creating an account on GitHub.

X Description: A collection of algorithms and data structures. Contribute to Barun-Kumar/Algorithms development by creating an account on GitHub.

Opengraph URL: https://github.com/Barun-Kumar/Algorithms

X: @github

direct link

Domain: github.com

react-profiling0
react-import-mapreact,react-dom,react-dom/client,react-dom/profiling,react-is,react/compiler-runtime,react/jsx-dev-runtime,react/jsx-runtime,scheduler@b8488ee2c322
route-pattern/:user_id/:repository
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:c4b3d8c9-5193-8525-b960-e17d3ed519d9
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-idC966:14485C:27D4B1:337BBA:6AFE4965
html-safe-nonce263efc5d010002b33d97fb4808a3edfb8e5313648826e04a1812a539859aa6c9
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJDOTY2OjE0NDg1QzoyN0Q0QjE6MzM3QkJBOjZBRkU0OTY1IiwidmlzaXRvcl9pZCI6IjI1MDI5NDcxMjYxNzA3NjU2NzAiLCJyZWdpb25fZWRnZSI6ImlhZCIsInJlZ2lvbl9yZW5kZXIiOiJpYWQifQ==
visitor-hmac86448a971388a8db3a2dd495a19117f01cfc31006c7c8670002b2c7c01dc7bd7
hovercard-subject-tagrepository:404848972
github-keyboard-shortcutsrepository,copilot
google-site-verificationApib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I
octolytics-urlhttps://collector.github.com/github/collect
analytics-location//
fb:app_id1401488693436528
apple-itunes-appapp-id=1477376905, app-argument=https://github.com/Barun-Kumar/Algorithms
twitter:imagehttps://opengraph.githubassets.com/a17fd23bc7e5c112e31801e70a68c98c31e8ae1a5b5982298e1e9fb030fef812/Barun-Kumar/Algorithms
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/a17fd23bc7e5c112e31801e70a68c98c31e8ae1a5b5982298e1e9fb030fef812/Barun-Kumar/Algorithms
og:image:altA collection of algorithms and data structures. Contribute to Barun-Kumar/Algorithms development by creating an account on GitHub.
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
None894d3c8b932306ed8425e8dcbe0c1089667e487c5fe7b8a05d17e7b685207429
turbo-cache-controlno-cache
go-importgithub.com/Barun-Kumar/Algorithms git https://github.com/Barun-Kumar/Algorithms.git
octolytics-dimension-user_id11215019
octolytics-dimension-user_loginBarun-Kumar
octolytics-dimension-repository_id404848972
octolytics-dimension-repository_nwoBarun-Kumar/Algorithms
octolytics-dimension-repository_publictrue
octolytics-dimension-repository_is_forktrue
octolytics-dimension-repository_parent_id85371262
octolytics-dimension-repository_parent_nwowilliamfiset/algorithms
octolytics-dimension-repository_network_root_id85371262
octolytics-dimension-repository_network_root_nwowilliamfiset/algorithms
turbo-body-classeslogged-out env-production page-responsive
disable-turbofalse
browser-stats-urlhttps://api.github.com/_private/browser/stats
browser-errors-urlhttps://api.github.com/_private/browser/errors
release44570ad53e12be09be8000af683c29166c4007cb
ui-targetcanary-1
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://github.com/Barun-Kumar/Algorithms#start-of-content
https://github.com/
Sign inhttps://github.com/login?return_to=https%3A%2F%2Fgithub.com%2FBarun-Kumar%2FAlgorithms
GitHubRepository hosting, code review, and collaborationhttps://github.com/platform
CopilotAI coding agent for tasks, projects, and automated workhttps://github.com/features/copilot
ActionsCI/CD and automationhttps://github.com/features/actions
Code QualityQuality analysis, fixes, and enforcementhttps://github.com/features/code-quality
CodespacesCloud development environmentshttps://github.com/features/codespaces
Code SecurityVulnerability detection and remediationhttps://github.com/security/advanced-security/code-security
Secret ProtectionSecret scanning and leak preventionhttps://github.com/security/advanced-security/secret-protection
All Featureshttps://github.com/features
Documentationhttps://docs.github.com/en
Traininghttps://learn.github.com/skills
Certificationshttps://learn.github.com/credentials
Build with Copilothttps://github.com/features/ai
Customize Copilothttps://docs.github.com/en/copilot/how-tos/copilot-on-github/customize-copilot/customize-copilot-overview
Integrationshttps://github.com/marketplace
Trending reposhttps://github.com/trending
GitHub Sponsorshttps://github.com/open-source/sponsors
Developer articleshttps://github.com/resources/articles
ChangelogYour source for the latest features, improvements, and fixes across GitHub products, all in one place.https://github.blog/changelog/
Enterpriseshttps://github.com/enterprise
Teamhttps://github.com/team
Startupshttps://github.com/enterprise/startups
Nonprofitshttps://github.com/solutions/industry/nonprofits
Healthcarehttps://github.com/solutions/industry/healthcare
Financial serviceshttps://github.com/solutions/industry/financial-services
Manufacturinghttps://github.com/solutions/industry/manufacturing
Governmenthttps://github.com/solutions/industry/government
See all industrieshttps://github.com/solutions/industry
Why GitHubhttps://github.com/why-github
Customer Storieshttps://github.com/customer-stories
Business insightshttps://github.com/solutions/executive-insights
Trust Centerhttps://github.com/trust-center
GitHub Advanced SecurityEnterprise-grade code securityhttps://github.com/security/advanced-security
Copilot for businessEnterprise-grade AI featureshttps://github.com/features/copilot/copilot-business
Premium SupportEnterprise-grade 24/7 supporthttps://github.com/enterprise/premium-support
Documentationhttps://docs.github.com/en
Resource centerhttps://github.com/resources
Bloghttps://github.blog/
Events & webinarshttps://github.com/resources/events
Community Forumhttps://github.com/orgs/community/discussions
Customer Storieshttps://github.com/customer-stories
Integrationshttps://github.com/marketplace
Customer supporthttps://help.github.com/
Traininghttps://learn.github.com/skills
GitHub Statushttps://www.githubstatus.com/
Abouthttps://github.com/about
Partnershttps://github.com/partners
Changeloghttps://github.blog/changelog/
GitHub UniverseThe event for developers, by developers — talks, workshops, and what’s next for GitHub.https://githubuniverse.com/
Pricinghttps://github.com/pricing
Sign inhttps://github.com/login?return_to=https%3A%2F%2Fgithub.com%2FBarun-Kumar%2FAlgorithms
Sign uphttps://github.com/signup?ref_cta=Sign+up&ref_loc=header+logged+out&ref_page=%2F%3Cuser-name%3E%2F%3Crepo-name%3E&source=header-repo&source_repo=Barun-Kumar%2FAlgorithms
Reloadhttps://github.com/Barun-Kumar/Algorithms
Reloadhttps://github.com/Barun-Kumar/Algorithms
Reloadhttps://github.com/Barun-Kumar/Algorithms
Barun-Kumarhttps://github.com/Barun-Kumar
Algorithmshttps://github.com/Barun-Kumar/Algorithms
Codehttps://github.com/Barun-Kumar/Algorithms
Pull requestshttps://github.com/Barun-Kumar/Algorithms/pulls
Actionshttps://github.com/Barun-Kumar/Algorithms/actions
Projectshttps://github.com/Barun-Kumar/Algorithms/projects
Security and qualityhttps://github.com/Barun-Kumar/Algorithms/security
Insightshttps://github.com/Barun-Kumar/Algorithms/pulse
https://github.com/Barun-Kumar/Algorithms
Algorithmshttps://github.com/Barun-Kumar/Algorithms
williamfiset/algorithmshttps://github.com/williamfiset/algorithms
Notificationshttps://github.com/login?return_to=%2FBarun-Kumar%2FAlgorithms
Fork0 (0)https://github.com/login?return_to=%2FBarun-Kumar%2FAlgorithms
Star0 (0)https://github.com/login?return_to=%2FBarun-Kumar%2FAlgorithms
Readmehttps://github.com/Barun-Kumar/Algorithms#readme-ov-file
MIT licensehttps://github.com/Barun-Kumar/Algorithms#MIT-1-ov-file
Activityhttps://github.com/Barun-Kumar/Algorithms/activity
0 forkshttps://github.com/Barun-Kumar/Algorithms/forks
Report repositoryhttps://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2FBarun-Kumar%2FAlgorithms&report=Barun-Kumar+%28user%29
Brancheshttps://github.com/Barun-Kumar/Algorithms/branches
Tagshttps://github.com/Barun-Kumar/Algorithms/tags
https://github.com/Barun-Kumar/Algorithms/branches
https://github.com/Barun-Kumar/Algorithms/tags
1,484 Commitshttps://github.com/Barun-Kumar/Algorithms/commits/master/
https://github.com/Barun-Kumar/Algorithms/commits/master/
.github/workflowshttps://github.com/Barun-Kumar/Algorithms/tree/master/.github/workflows
.github/workflowshttps://github.com/Barun-Kumar/Algorithms/tree/master/.github/workflows
gradle/wrapperhttps://github.com/Barun-Kumar/Algorithms/tree/master/gradle/wrapper
gradle/wrapperhttps://github.com/Barun-Kumar/Algorithms/tree/master/gradle/wrapper
misc/imageshttps://github.com/Barun-Kumar/Algorithms/tree/master/misc/images
misc/imageshttps://github.com/Barun-Kumar/Algorithms/tree/master/misc/images
referenceshttps://github.com/Barun-Kumar/Algorithms/tree/master/references
referenceshttps://github.com/Barun-Kumar/Algorithms/tree/master/references
slideshttps://github.com/Barun-Kumar/Algorithms/tree/master/slides
slideshttps://github.com/Barun-Kumar/Algorithms/tree/master/slides
srchttps://github.com/Barun-Kumar/Algorithms/tree/master/src
srchttps://github.com/Barun-Kumar/Algorithms/tree/master/src
.gitignorehttps://github.com/Barun-Kumar/Algorithms/blob/master/.gitignore
.gitignorehttps://github.com/Barun-Kumar/Algorithms/blob/master/.gitignore
LICENSEhttps://github.com/Barun-Kumar/Algorithms/blob/master/LICENSE
LICENSEhttps://github.com/Barun-Kumar/Algorithms/blob/master/LICENSE
README.mdhttps://github.com/Barun-Kumar/Algorithms/blob/master/README.md
README.mdhttps://github.com/Barun-Kumar/Algorithms/blob/master/README.md
build.gradlehttps://github.com/Barun-Kumar/Algorithms/blob/master/build.gradle
build.gradlehttps://github.com/Barun-Kumar/Algorithms/blob/master/build.gradle
gradle.propertieshttps://github.com/Barun-Kumar/Algorithms/blob/master/gradle.properties
gradle.propertieshttps://github.com/Barun-Kumar/Algorithms/blob/master/gradle.properties
gradlewhttps://github.com/Barun-Kumar/Algorithms/blob/master/gradlew
gradlewhttps://github.com/Barun-Kumar/Algorithms/blob/master/gradlew
gradlew.bathttps://github.com/Barun-Kumar/Algorithms/blob/master/gradlew.bat
gradlew.bathttps://github.com/Barun-Kumar/Algorithms/blob/master/gradlew.bat
READMEhttps://github.com/Barun-Kumar/Algorithms
MIT licensehttps://github.com/Barun-Kumar/Algorithms
https://opensource.org/licenses/MIT
https://github.com/williamfiset/Algorithms/workflows/Java%20CI%20with%20Gradle/badge.svg
https://github.com/williamfiset/Algorithms/workflows/README%20URL%20Checker/badge.svg
https://www.paypal.com/donate?hosted_button_id=JUP2HZ6JUPB5C
https://github.com/Barun-Kumar/Algorithms#algorithms--data-structures-project
https://github.com/Barun-Kumar/Algorithms#contributing
Wikihttps://github.com/williamfiset/Algorithms/wiki
https://github.com/Barun-Kumar/Algorithms#other-programming-languages
https://github.com/akzare/Algorithmshttps://github.com/akzare/Algorithms
https://github.com/TianyiShi2001/Algorithmshttps://github.com/TianyiShi2001/Algorithms
https://github.com/Barun-Kumar/Algorithms#running-an-algorithm-implementation
https://github.com/Barun-Kumar/Algorithms#running-with-gradle-recommended
Gradle Wrapperhttps://docs.gradle.org/current/userguide/gradle_wrapper.html
https://github.com/Barun-Kumar/Algorithms#compiling-and-running-with-only-a-jdk
https://github.com/Barun-Kumar/Algorithms#create-a-classes-folder
https://github.com/Barun-Kumar/Algorithms#compile-the-algorithm
https://github.com/Barun-Kumar/Algorithms#run-the-algorithm
https://github.com/Barun-Kumar/Algorithms#example
https://github.com/Barun-Kumar/Algorithms#data-structures
🎥https://www.youtube.com/watch?v=q4fnJZr8ztY
Balanced Treeshttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/balancedtree
AVL Tree (recursive)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java
Red Black Tree (recursive)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/RedBlackTree.java
🎥https://www.youtube.com/watch?v=JfSdGQdAzq8
Binary Search Treehttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java
Splay Treehttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/SplayTree.java
🎥https://www.youtube.com/watch?v=PEnFFiQe1pM
Dynamic Arrayhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/dynamicarray
Dynamic array (integer only, fast)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/dynamicarray/IntArray.java
Dynamic array (generic)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/dynamicarray/DynamicArray.java
🎥https://www.youtube.com/watch?v=RgITNht_f4Q
Fenwick Treehttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/fenwicktree
Fenwick Tree (range query, point updates)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/fenwicktree/FenwickTreeRangeQueryPointUpdate.java
Fenwick Tree (range update, point query)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/fenwicktree/FenwickTreeRangeUpdatePointQuery.java
Fibonacci Heaphttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/fibonacciheap
🎥https://www.youtube.com/watch?v=2E54GqF0H4s
Hashtablehttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/hashtable
Hashtable (double hashing)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableDoubleHashing.java
Hashtable (linear probing)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableLinearProbing.java
Hashtable (quadratic probing)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableQuadraticProbing.java
Hashtable (separate chaining)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableSeparateChaining.java
🎥https://www.youtube.com/watch?v=-Yn5DU0_-lw
Linked Listhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/linkedlist/DoublyLinkedList.java
🎥https://www.youtube.com/watch?v=wptevk0bshY
Priority Queuehttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue
Min Binary Heaphttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java
Min Indexed Binary Heap (sorted key-value pairs, similar to hash-table)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedBinaryHeap.java
Min D-Heaphttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinDHeap.java
🎥https://www.youtube.com/watch?v=DT8xZ0Uf8wo
Min Indexed D-Heap (sorted key-value pairs, similar to hash-table)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java
🎥https://www.youtube.com/watch?v=KxzhEQ-zpDc
Queuehttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/queue
Queue (integer only, fixed size, fast)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/queue/IntQueue.java
Queue (linked list, generic)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/queue/Queue.java
Segment Treehttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/segmenttree
Segment tree (array based, compact)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/CompactSegmentTree.java
Segment tree (pointer implementation)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/Node.java
🎥https://youtu.be/uUatD9AudXo
Sparse Tablehttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java
🎥https://www.youtube.com/watch?v=L3ud3rXpIxA
Stackhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/stack
Stack (integer only, fixed size, fast)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/stack/IntStack.java
Stack (linked list, generic)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/stack/ListStack.java
Stack (array, generic)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/stack/ArrayStack.java
🎥https://www.youtube.com/watch?v=zqKlL3ZpTqs
Suffix Arrayhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/suffixarray
Suffix Array (O(n²logn) construction)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArraySlow.java
Suffix Array (O(nlog²(n)) construction)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java
Suffix Array (O(nlog(n)) construction)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayFast.java
Triehttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/trie/Trie.java
🎥https://www.youtube.com/watch?v=ibjEGG7ylHk
Union Findhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/datastructures/unionfind/UnionFind.java
https://github.com/Barun-Kumar/Algorithms#dynamic-programming
https://github.com/Barun-Kumar/Algorithms#dynamic-programming-classics
Coin change problemhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/dp/CoinChange.java
Edit distance (iterative)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/dp/EditDistanceIterative.java
Edit distance (recursive)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/dp/EditDistanceRecursive.java
🎥https://www.youtube.com/watch?v=cJ21moQpofY
Knapsack 0/1https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/dp/Knapsack_01.java
Knapsack unbounded (0/∞)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/dp/KnapsackUnbounded.java
Maximum contiguous subarrayhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/dp/MaximumSubarray.java
Longest Common Subsequence (LCS)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/dp/LongestCommonSubsequence.java
Longest Increasing Subsequence (LIS)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/dp/LongestIncreasingSubsequence.java
Longest Palindrome Subsequence (LPS)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/dp/LongestPalindromeSubsequence.java
🎥https://www.youtube.com/watch?v=cY4HiiFHO1o
Traveling Salesman Problem (dynamic programming, iterative)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/TspDynamicProgrammingIterative.java
Traveling Salesman Problem (dynamic programming, recursive)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/TspDynamicProgrammingRecursive.java
Minimum Weight Perfect Matching (iterative, complete graph)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java
https://github.com/Barun-Kumar/Algorithms#dynamic-programming-problem-examples
https://github.com/Barun-Kumar/Algorithms#adhoc
🎥https://www.youtube.com/watch?v=_tur2nPkIKo
Magic Cowshttps://github.com/williamfiset/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/dp/examples/magicalcows/MagicalCows.java
🎥https://youtu.be/oQQO_n57SB0
Narrow Art Galleryhttps://github.com/williamfiset/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/dp/examples/narrowartgallery/NarrowArtGalleryRecursive.java
https://github.com/Barun-Kumar/Algorithms#tiling-problems
🎥https://youtu.be/yn2jnmlepY8
Tiling Dominoeshttps://github.com/williamfiset/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/dp/examples/tilingdominoes/TilingDominoes.java
🎥https://www.youtube.com/watch?v=CecjOo4Zo-g
Tiling Dominoes and Trominoeshttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/dp/examples/domino-and-tromino-tiling
🎥https://youtu.be/pPgBZqY_Xh0
Mountain Sceneshttps://github.com/williamfiset/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/dp/examples/scenes/Scenes.java
https://github.com/Barun-Kumar/Algorithms#geometry
Angle between 2D vectorshttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/AngleBetweenVectors2D.java
Angle between 3D vectorshttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/AngleBetweenVectors3D.java
Circle-circle intersection point(s)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/CircleCircleIntersectionPoints.js
Circle-line intersection point(s)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/LineCircleIntersection.js
Circle-line segment intersection point(s)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/LineSegmentCircleIntersection.js
Circle-point tangent line(s)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/PointCircleTangent.java
Closest pair of points (line sweeping algorithm)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/ClosestPairOfPoints.java
Collinear points test (are three 2D points on the same line)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/CollinearPoints.java
Convex hull (Graham Scan algorithm)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/ConvexHullGrahamScan.java
Convex hull (Monotone chain algorithm)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/ConvexHullMonotoneChainsAlgorithm.java
Convex polygon areahttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/ConvexPolygonArea.java
Convex polygon cuthttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/ConvexPolygonCutWithLineSegment.java
Convex polygon contains pointshttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/ConvexPolygonContainsPoint.java
Coplanar points test (are four 3D points on the same plane)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/CoplanarPoints.java
Line class (handy infinite line class)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/Line.java
Line-circle intersection point(s)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/LineCircleIntersection.js
Line segment-circle intersection point(s)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/LineSegmentCircleIntersection.js
Line segment to general form (ax + by = c)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/LineSegmentToGeneralForm.java
Line segment-line segment intersectionhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/LineSegmentLineSegmentIntersection.java
Longitude-Latitude geographic distancehttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/LongitudeLatitudeGeographicDistance.java
Point is inside triangle checkhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/PointInsideTriangle.java
Point rotation about pointhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/PointRotation.java
Triangle area algorithmshttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/TriangleArea.java
[UNTESTED] Circle-circle intersection areahttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/CircleCircleIntersectionArea.java
[UNTESTED] Circular segment areahttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/geometry/CircularSegmentArea.java
https://github.com/Barun-Kumar/Algorithms#graph-theory
https://github.com/Barun-Kumar/Algorithms#tree-algorithms
🎥https://www.youtube.com/watch?v=2FFq2_je7Lg
Rooting an undirected treehttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java
🎥https://www.youtube.com/watch?v=OCKvEMF0Xac
Identifying isomorphic treeshttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeIsomorphism.java
🎥https://www.youtube.com/watch?v=nzF_9bjDzdc
Tree center(s)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.java
Tree diameterhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeDiameter.java
🎥https://www.youtube.com/watch?v=sD1IoalFomA
Lowest Common Ancestor (LCA, Euler tour)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/LowestCommonAncestorEulerTour.java
https://github.com/Barun-Kumar/Algorithms#network-flow
Bipartite graph verification (adjacency list)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/BipartiteGraphCheckAdjacencyList.java
🎥https://www.youtube.com/watch?v=LdOnanfc5TM
Max flow & Min cut (Ford-Fulkerson with DFS, adjacency list)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/FordFulkersonDfsSolverAdjacencyList.java
Max flow & Min cut (Ford-Fulkerson with DFS, adjacency matrix)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/FordFulkersonDFSAdjacencyMatrix.java
🎥https://www.youtube.com/watch?v=RppuJYwlcI8
Max flow & Min cut (Edmonds-Karp, adjacency list)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/EdmondsKarpAdjacencyList.java
🎥https://youtu.be/1ewLrXUz4kk
Max flow & Min cut (Capacity scaling, adjacency list)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java
🎥https://youtu.be/M6cm8UeeziI
Max flow & Min cut (Dinic's, adjacency list)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java
Maximum Cardinality Bipartite Matching (augmenting path algorithm, adjacency list)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MaximumCardinalityBipartiteMatchingAugmentingPathAdjacencyList.java
Min Cost Max Flow (Bellman-Ford, adjacency list)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowWithBellmanFord.java
Min Cost Max Flow (Johnson's algorithm, adjacency list)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowJohnsons.java
https://github.com/Barun-Kumar/Algorithms#main-graph-theory-algorithms
Articulation points/cut vertices (adjacency list)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java
Bellman-Ford (edge list, negative cycles, fast & optimized)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordEdgeList.java
🎥https://www.youtube.com/watch?v=lyw4FaxrwHg
Bellman-Ford (adjacency list, negative cycles)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordAdjacencyList.java
Bellman-Ford (adjacency matrix, negative cycles)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordAdjacencyMatrix.java
🎥https://www.youtube.com/watch?v=oDqjPvD54Ss
Breadth first search (adjacency list)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/BreadthFirstSearchAdjacencyListIterative.java
Breadth first search (adjacency list, fast queue)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/BreadthFirstSearchAdjacencyListIterativeFastQueue.java
Bridges/cut edges (adjacency list)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/BridgesAdjacencyList.java
Find connected components (adjacency list, union find)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsAdjacencyList.java
Find connected components (adjacency list, DFS)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsDfsSolverAdjacencyList.java
Depth first search (adjacency list, iterative)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/DepthFirstSearchAdjacencyListIterative.java
Depth first search (adjacency list, iterative, fast stack)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/DepthFirstSearchAdjacencyListIterativeFastStack.java
🎥https://www.youtube.com/watch?v=7fujbpJ0LB4
Depth first search (adjacency list, recursive)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/DepthFirstSearchAdjacencyListRecursive.java
🎥https://www.youtube.com/watch?v=pSqmAO-m7Lk
Dijkstra's shortest path (adjacency list, lazy implementation)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyList.java
🎥https://www.youtube.com/watch?v=pSqmAO-m7Lk
Dijkstra's shortest path (adjacency list, eager implementation + D-ary heap)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java
🎥https://www.youtube.com/watch?v=8MpoO2zA2l4
Eulerian Path (directed edges)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java
🎥https://www.youtube.com/watch?v=4NQ3HnhyNfQ
Floyd Warshall algorithm (adjacency matrix, negative cycle check)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/FloydWarshallSolver.java
Graph diameter (adjacency list)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/GraphDiameter.java
🎥https://www.youtube.com/watch?v=cIBFEhD77b4
Kahn's algorithm (topological sort, adjacency list)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java
Kruskal's min spanning tree algorithm (edge list, union find)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/KruskalsEdgeList.java
🎥https://www.youtube.com/watch?v=JZBQLXgSGfs
Kruskal's min spanning tree algorithm (edge list, union find, lazy sorting)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/KruskalsEdgeListPartialSortSolver.java
🎥https://www.youtube.com/watch?v=jsmMtJpPnhU
Prim's min spanning tree algorithm (lazy version, adjacency list)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/LazyPrimsAdjacencyList.java
Prim's min spanning tree algorithm (lazy version, adjacency matrix)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/LazyPrimsAdjacencyMatrix.java
🎥https://www.youtube.com/watch?v=xq3ABa-px_g
Prim's min spanning tree algorithm (eager version, adjacency list)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java
Steiner tree (minimum spanning tree generalization)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/SteinerTree.java
🎥https://www.youtube.com/watch?v=wUgWX0nc4NY
Tarjan's strongly connected components algorithm (adjacency list) https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/TarjanSccSolverAdjacencyList.java
🎥https://www.youtube.com/watch?v=eL-KzMXSXXI
Topological sort (acyclic graph, adjacency list)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/TopologicalSortAdjacencyList.java
Topological sort (acyclic graph, adjacency matrix)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/TopologicalSortAdjacencyMatrix.java
Traveling Salesman Problem (brute force)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/TspBruteForce.java
🎥https://www.youtube.com/watch?v=cY4HiiFHO1o
Traveling Salesman Problem (dynamic programming, iterative)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/TspDynamicProgrammingIterative.java
Traveling Salesman Problem (dynamic programming, recursive)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/TspDynamicProgrammingRecursive.java
https://github.com/Barun-Kumar/Algorithms#linear-algebra
Freivald's algorithm (matrix multiplication verification)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/linearalgebra/FreivaldsAlgorithm.java
Gaussian elimination (solve system of linear equations)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java
Gaussian elimination (modular version, prime finite field)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/linearalgebra/ModularLinearAlgebra.java
Linear recurrence solver (finds nth term in a recurrence relation)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/linearalgebra/LinearRecurrenceSolver.java
Matrix determinant (Laplace/cofactor expansion)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java
Matrix inversehttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java
Matrix multiplicationhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixMultiplication.java
Matrix powerhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixPower.java
Square matrix rotationhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/linearalgebra/RotateSquareMatrixInplace.java
https://github.com/Barun-Kumar/Algorithms#mathematics
[UNTESTED] Chinese remainder theoremhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java
Prime number sieve (sieve of Eratosthenes)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/math/SieveOfEratosthenes.java
Prime number sieve (sieve of Eratosthenes, compressed)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/math/CompressedPrimeSieve.java
Totient function (phi function, relatively prime number count)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/math/EulerTotientFunction.java
Totient function using sieve (phi function, relatively prime number count)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/math/EulerTotientFunctionWithSieve.java
Extended euclidean algorithmhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/math/ExtendedEuclideanAlgorithm.java
Greatest Common Divisor (GCD)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/math/GCD.java
Fast Fourier transform (quick polynomial multiplication)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/math/FastFourierTransform.java
Fast Fourier transform (quick polynomial multiplication, complex numbers)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/math/FastFourierTransformComplexNumbers.java
Primality checkhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/math/IsPrime.java
Primality check (Rabin-Miller)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/math/RabinMillerPrimalityTest.py
Least Common Multiple (LCM)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/math/LCM.java
Modular inversehttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/math/ModularInverse.java
Prime factorization (pollard rho)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java
Relatively prime check (coprimality check)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/math/RelativelyPrime.java
https://github.com/Barun-Kumar/Algorithms#other
Bit manipulationshttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/other/BitManipulations.java
List permutationshttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/other/Permutations.java
🎥https://www.youtube.com/watch?v=RnlHPR0lyOE
Power set (set of all subsets)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/other/PowerSet.java
Set combinationshttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/other/Combinations.java
Set combinations with repetitionhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/other/CombinationsWithRepetition.java
Sliding Window Minimum/Maximumhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/other/SlidingWindowMaximum.java
Square Root Decompositionhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/other/SquareRootDecomposition.java
Unique set combinationshttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/other/UniqueCombinations.java
Lazy Range Adderhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/other/LazyRangeAdder.java
https://github.com/Barun-Kumar/Algorithms#search-algorithms
Binary search (real numbers)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/search/BinarySearch.java
Interpolation search (discrete discrete)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/search/InterpolationSearch.java
Ternary search (real numbers)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/search/TernarySearch.java
Ternary search (discrete numbers)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/search/TernarySearchDiscrete.java
https://github.com/Barun-Kumar/Algorithms#sorting-algorithms
Bubble sorthttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/sorting/BubbleSort.java
Bucket sorthttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/sorting/BucketSort.java
Counting sorthttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/sorting/CountingSort.java
Heapsorthttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/sorting/Heapsort.java
Insertion sorthttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/sorting/InsertionSort.java
Mergesorthttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/sorting/MergeSort.java
Quicksort (in-place, Hoare partitioning)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/sorting/QuickSort.java
Quicksort3 (Dutch National Flag algorithm)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/sorting/QuickSort3.java
Selection sorthttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/sorting/SelectionSort.java
Radix sorthttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/sorting/RadixSort.java
https://github.com/Barun-Kumar/Algorithms#string-algorithms
Booth's algorithm (finds lexicographically smallest string rotation)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/strings/BoothsAlgorithm.java
Knuth-Morris-Pratt algorithm (finds pattern matches in text)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/strings/KMP.java
Longest Common Prefix (LCP) arrayhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java
🎥https://www.youtube.com/watch?v=Ic80xQFWevc
Longest Common Substring (LCS)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java
🎥https://www.youtube.com/watch?v=OptoHwC3D-Y
Longest Repeated Substring (LRS)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java
Manacher's algorithm (finds all palindromes in text)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/strings/ManachersAlgorithm.java
Rabin-Karp algorithm (finds pattern match positions in text)https://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java
Substring verification with suffix arrayhttps://github.com/Barun-Kumar/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/strings/SubstringVerificationSuffixArray.java
https://github.com/Barun-Kumar/Algorithms#license
MIT licensehttps://opensource.org/licenses/MIT
https://github.com/Barun-Kumar/Algorithms#donate
https://www.paypal.com/donate?hosted_button_id=JUP2HZ6JUPB5C
Readmehttps://github.com/Barun-Kumar/Algorithms#readme-ov-file
MIT licensehttps://github.com/Barun-Kumar/Algorithms#MIT-1-ov-file
Activityhttps://github.com/Barun-Kumar/Algorithms/activity
0 forkshttps://github.com/Barun-Kumar/Algorithms/forks
Report repositoryhttps://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2FBarun-Kumar%2FAlgorithms&report=Barun-Kumar+%28user%29
https://github.com
Termshttps://docs.github.com/site-policy/github-terms/github-terms-of-service
Privacyhttps://docs.github.com/site-policy/privacy-policies/github-privacy-statement
Securityhttps://github.com/security
Statushttps://www.githubstatus.com/
Communityhttps://github.community/
Docshttps://docs.github.com/
Contacthttps://support.github.com?tags=dotcom-footer

Viewport: width=device-width


URLs of crawlers that visited me.