{"id":31934436,"url":"https://github.com/srinivaskandukuri/javascript-zero-to-hero","last_synced_at":"2025-10-14T06:26:27.505Z","repository":{"id":139329522,"uuid":"107894928","full_name":"srinivasKandukuri/Javascript-Zero-to-Hero","owner":"srinivasKandukuri","description":"Javascript Basics, Advanced Topics,  DataStructures, Algorithms, Problems and Solutions.","archived":false,"fork":false,"pushed_at":"2024-05-01T14:25:43.000Z","size":1877,"stargazers_count":6,"open_issues_count":0,"forks_count":5,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-05-02T06:32:01.882Z","etag":null,"topics":["algorithms","datastructures","hackerrank","hackerrank-javascript","javascript","javascriptlogical","problems","solutions"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","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/srinivasKandukuri.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}},"created_at":"2017-10-22T19:12:32.000Z","updated_at":"2024-05-01T14:25:46.000Z","dependencies_parsed_at":null,"dependency_job_id":"0f85ee83-95a1-4366-9e77-88dd6c914763","html_url":"https://github.com/srinivasKandukuri/Javascript-Zero-to-Hero","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/srinivasKandukuri/Javascript-Zero-to-Hero","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/srinivasKandukuri%2FJavascript-Zero-to-Hero","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/srinivasKandukuri%2FJavascript-Zero-to-Hero/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/srinivasKandukuri%2FJavascript-Zero-to-Hero/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/srinivasKandukuri%2FJavascript-Zero-to-Hero/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/srinivasKandukuri","download_url":"https://codeload.github.com/srinivasKandukuri/Javascript-Zero-to-Hero/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/srinivasKandukuri%2FJavascript-Zero-to-Hero/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279018119,"owners_count":26086281,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-10-14T02:00:06.444Z","response_time":60,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["algorithms","datastructures","hackerrank","hackerrank-javascript","javascript","javascriptlogical","problems","solutions"],"created_at":"2025-10-14T06:26:23.708Z","updated_at":"2025-10-14T06:26:27.499Z","avatar_url":"https://github.com/srinivasKandukuri.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003ch1 align=\"center\"\u003e\n  \u003cbr\u003e\n    \u003cbr\u003e\n  Javascript DataStructures, Algorithms, Interview problems and Solutions\n  \u003cbr\u003e\u003cbr\u003e\n\u003c/h1\u003e\n\n\n![Jascript-Zero-to-Hero](https://raw.githubusercontent.com/srinivasKandukuri/Javascript-Zero-to-Hero/master/Sinppets/Images/c8fd384d7c164910c5758b34ea35e0aa.gif)\n\n## Introduction\n\nThis repository was created with the intention of helping developers master their concepts in JavaScript.\n\n## Community\n\nFeel free to submit a PR adding a link to your own recaps or reviews.\n\n\n## Table of Contents\n\n## Data Structures\n\nA data structure is a particular way of organizing and storing data in a computer so that it can\nbe accessed and modified efficiently. More precisely, a data structure is a collection of data\nvalues, the relationships among them, and the functions or operations that can be applied to\nthe data.\n\n* [Linked List](https://github.com/srinivasKandukuri/Javascript-Zero-to-Hero/tree/master/DataStructures/LinkedList)\n---\n\n\n\n\n\n\n\n## Useful Information\n\n### References\n\n[▶ Data Structures and Algorithms on YouTube](https://www.youtube.com/playlist?list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)\n\n### Big O Notation\n\nOrder of growth of algorithms specified in Big O notation.\n\n![Big O graphs](https://github.com/srinivasKandukuri/javascript-algorithms/blob/master/assets/big-o-graph.png)\n\nSource: [Big O Cheat Sheet](http://bigocheatsheet.com/).\n\nBelow is the list of some of the most used Big O notations and their performance comparisons against different sizes of the input data.\n\n| Big O Notation | Computations for 10 elements | Computations for 100 elements | Computations for 1000 elements  |\n| -------------- | ---------------------------- | ----------------------------- | ------------------------------- |\n| **O(1)**       | 1                            | 1                             | 1                               |\n| **O(log N)**   | 3                            | 6                             | 9                               |\n| **O(N)**       | 10                           | 100                           | 1000                            |\n| **O(N log N)** | 30                           | 600                           | 9000                            |\n| **O(N^2)**     | 100                          | 10000                         | 1000000                         |\n| **O(2^N)**     | 1024                         | 1.26e+29                      | 1.07e+301                       |\n| **O(N!)**      | 3628800                      | 9.3e+157                      | 4.02e+2567                      |\n\n### Data Structure Operations Complexity\n\n| Data Structure          | Access    | Search    | Insertion | Deletion  | Comments  |\n| ----------------------- | :-------: | :-------: | :-------: | :-------: | :-------- |\n| **Array**               | 1         | n         | n         | n         |           |\n| **Stack**               | n         | n         | 1         | 1         |           |\n| **Queue**               | n         | n         | 1         | 1         |           |\n| **Linked List**         | n         | n         | 1         | 1         |           |\n| **Hash Table**          | -         | n         | n         | n         | In case of perfect hash function costs would be O(1) |\n| **Binary Search Tree**  | n         | n         | n         | n         | In case of balanced tree costs would be O(log(n)) |\n| **B-Tree**              | log(n)    | log(n)    | log(n)    | log(n)    |           |\n| **Red-Black Tree**      | log(n)    | log(n)    | log(n)    | log(n)    |           |\n| **AVL Tree**            | log(n)    | log(n)    | log(n)    | log(n)    |           |\n\n### Array Sorting Algorithms Complexity\n\n| Name                  | Best      | Average   | Worst         | Memory    | Stable    | Comments  |\n| --------------------- | :-------: | :-------: | :-----------: | :-------: | :-------: | :-------- |\n| **Bubble sort**       | n         | n^2       | n^2           | 1         | Yes       |           |\n| **Insertion sort**    | n         | n^2       | n^2           | 1         | Yes       |           |\n| **Selection sort**    | n^2       | n^2       | n^2           | 1         | No        |           |\n| **Heap sort**         | n log(n)  | n log(n)  | n log(n)      | 1         | No        |           |\n| **Merge sort**        | n log(n)  | n log(n)  | n log(n)      | n         | Yes       |           |\n| **Quick sort**        | n log(n)  | n log(n)  | n^2           | log(n)    | No        |           |\n| **Shell sort**        | n log(n)  | depends on gap sequence   | n (log(n))^2  | 1         | No        |           |\n| **Counting sort**     | n + r     | n + r     | n + r         | n + r     | Yes       | r - biggest number in array |\n| **Radix sort**        | n * k     | n * k     | n * k         | n + k    | Yes        | k - length of longest key |\n\n**[⬆ Back to Top](#table-of-contents)**\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsrinivaskandukuri%2Fjavascript-zero-to-hero","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsrinivaskandukuri%2Fjavascript-zero-to-hero","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsrinivaskandukuri%2Fjavascript-zero-to-hero/lists"}