How nakulbajaj101/practice-data-structures-and-algorithms works
Project type and purpose
• This is an educational “practice” repository of data-structures and algorithm implementations.
• It contains parallel implementations in two languages: JavaScript and Python.
• There are no external services, deployment scripts or runtime components—it’s purely code samples.
File structure
• Top-level files and folders correspond to major topics:
• Arrays (arraySection, arrayStructure, repeatedArray)
• Linked lists (linkedLists, doubly_linked_lists)
• Stacks and queues (stacks, queues, stackWithQueue)
• Hash tables (hashTables)
• Trees (binary_search_trees)
• Graphs (graphs)
• Recursion (folder containing factorial, fibonacci, reversal)
• Sorting (folder containing bubble, insertion, merge, quick, selection)
• Each topic has two implementations: .js files and .py files.
• No controllers, no services—just modules.
README for additional insights
• Confirms the repo is a playground for coding and practice.
• No architectural hints beyond topic grouping.