{"id":18400322,"url":"https://github.com/devluxor/common-sense-guide-to-dsa","last_synced_at":"2026-02-28T13:32:02.766Z","repository":{"id":173419042,"uuid":"650741760","full_name":"devluxor/common-sense-guide-to-dsa","owner":"devluxor","description":"This repository contains notes made while studying from the Jay Wengrow's book: 'A Common-Sense Guide to Data Structures and Algorithms: Level Up Your Core Programming Skills' .","archived":false,"fork":false,"pushed_at":"2024-11-11T11:42:10.000Z","size":2070,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-07-23T11:44:26.098Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/devluxor.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2023-06-07T17:55:23.000Z","updated_at":"2024-11-11T11:42:13.000Z","dependencies_parsed_at":"2025-07-23T11:27:13.097Z","dependency_job_id":"b3c42fcd-a66f-42a5-98cc-126cd8972e1f","html_url":"https://github.com/devluxor/common-sense-guide-to-dsa","commit_stats":null,"previous_names":["lucsorr/common_sense_guide_to_dsa","lux0rdev/common_sense_guide_to_dsa","devluxor/common_sense_guide_to_dsa","devluxor/common-sense-guide-to-dsa"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/devluxor/common-sense-guide-to-dsa","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/devluxor%2Fcommon-sense-guide-to-dsa","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/devluxor%2Fcommon-sense-guide-to-dsa/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/devluxor%2Fcommon-sense-guide-to-dsa/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/devluxor%2Fcommon-sense-guide-to-dsa/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/devluxor","download_url":"https://codeload.github.com/devluxor/common-sense-guide-to-dsa/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/devluxor%2Fcommon-sense-guide-to-dsa/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29935363,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-28T13:16:57.922Z","status":"ssl_error","status_checked_at":"2026-02-28T13:11:15.149Z","response_time":90,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-06T02:31:59.705Z","updated_at":"2026-02-28T13:32:02.717Z","avatar_url":"https://github.com/devluxor.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# A Common Sense Guide to Data Structures and Algorithms\n\nThis repository contains notes made while studying the Jay Wengrow's book: 'A Common-Sense Guide to Data Structures and Algorithms: Level Up Your Core Programming Skills'.\n\nFor an alternative approach to these topics, please visit the [Launch School 'Introduction to DSA' course](https://github.com/lucsorr/launch-school/tree/main/LS220/notes).\n\n## Contents:\n\n\n1. [Why Data Structures Matter](./01_why_data_structures_matter.md)\n\n    - The Array: The Foundational Data Structure\n    - Reading \n    - Searching \n    - Insertion \n    - Deletion \n    - Sets: How a Single Rule Can Affect Efficiency\n\n.\n\n2. [Why Algorithms Matter](./02_why_algorithms_matter.md)\n\n    - Ordered Arrays\n    - Searching an Ordered Array\n    - Binary Search\n    - Binary Search Vs. Linear Search\n\n.\n\n3. [Big O Notation](./03_big_o_notation.md)\n\n    - Big O: Count the Steps\n    - Constant Time Vs. Linear Time \n    - Same Algorithm, Different Scenarios\n    - An Algorithm of the Third Kind\n    - Logarithms \n    - O(log N) Explained\n\n.\n\n4. [Speeding Up Your Code with Big O](./04_speeding_up_your_code_with_big_o.md)\n\n    - Bubble Sort\n    - Bubble Sort Implemented\n    - The Efficiency of Bubble Sort\n    - A Quadratic Problem \n    - A Linear Solution [_Nice trick to check for duplicates in an array fast, in linear time_]\n\n.\n\n5. [Optimizing Code With and Without Big O](./05_optimizing_code_with_and_without_big_o.md)\n    - Selection Sort\n    - Selection Sort Implemented\n    - The Efficiency of Selection Sort\n    - Ignoring Constants\n    - The Role of Big O\n    - A Practical Example [_Nice trick to add every other element of an array to another array_]\n\n.\n\n6. [Optimizing for Optimistic Scenarios](./06_optimizing_for_optimistic_scenarios.md)\n    - Insertion Sort\n    - Insertion Sort Implemented\n    - The Efficiency of Insertion Sort\n    - The Average Case\n    - A Practical Example [_Nice trick to improve the speed of some nested iterations_]\n\n.\n\n7. [Blazing Fast Lookup With Hash Tables](./07_blazing_fast_lookup_with_hash_tables.md)\n    - Enter the Hash Table\n    - Hashing with Hash Functions\n    - How Hash Function Work\n    - Dealing with Collisions\n    - The Great Balancing Act [_Load factor (data/cells ratio) when implementing hashes_]\n\n.\n\n8. [Crafting Elegant Code with Stacks and Queues](./08_crafting_elegant_code_with_stacks_and_queues.md)\n    - Stacks\n    - Stacks in Action [_Algorithm to check for valid braces in a string_]\n    - Queues\n    - Queues in Action\n\n.\n\n9. [Recursively Recurse with Recursion](./09_recursively_recurse_with_recursion.md)\n    - Recurse Instead of Loop\n    - The Base Case\n    - Reading Recursive Code\n    - Recursion in the Eyes of the Computer\n    - Recursion in Action [_Algorithm to recursively traverse all files and subdirectories from a root folder_]\n\n.\n\n10. [Recursive Algorithms for Speed](./10_recursive_algorithms_for_speed.md)\n    - Partitioning\n    - Quicksort\n    - The Efficiency of Quicksort\n    - Worst Case Scenario \n    - Quickselect\n\n.\n\n11. [Node-based Data Structures](./11_node_based_data_structures.md)\n    - Linked Lists\n    - Implementing a Linked List\n    - Reading\n    - Searching\n    - Insertion\n    - Deletion\n    - Linked Lists in Action [_Good practice case for the need of a linked list_]\n    - Doubly Linked Lists\n\n.\n\n12. [Speeding Up All the Things with Binary Trees](./12_speeding_up_all_the_things_with_binary_trees.md)\n    - Binary Trees\n    - Searching\n    - Insertion\n    - Deletion\n    - Binary Trees in Action [_Includes traversal algorithm_]\n\n.\n\n13. [Connecting Everything with Graphs](./13_connecting_everything_with_graphs.md)\n    - Graphs\n    - Breadth-First Search\n    - Graph Databases\n    - Weighted Graphs\n    - Dijkstra's Algorithm\n\n.\n\n14. [Dealing with Space Constraints](./14_dealing_with_space_constraints.md)\n    - Big O Notation As Applied to Space Complexity\n    - Trade-offs between time and space","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdevluxor%2Fcommon-sense-guide-to-dsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdevluxor%2Fcommon-sense-guide-to-dsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdevluxor%2Fcommon-sense-guide-to-dsa/lists"}