{"id":27047233,"url":"https://github.com/rishant/dsa","last_synced_at":"2026-01-20T10:32:11.152Z","repository":{"id":179889684,"uuid":"422806157","full_name":"rishant/dsa","owner":"rishant","description":"concept and implementation using java","archived":false,"fork":false,"pushed_at":"2021-10-30T09:24:24.000Z","size":3,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-05T06:29:45.191Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":null,"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/rishant.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":"2021-10-30T06:46:58.000Z","updated_at":"2021-10-30T09:24:26.000Z","dependencies_parsed_at":null,"dependency_job_id":"f6a5af87-0ce7-4515-8e3d-5bee30c58d6c","html_url":"https://github.com/rishant/dsa","commit_stats":null,"previous_names":["rishant/dsa"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/rishant/dsa","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rishant%2Fdsa","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rishant%2Fdsa/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rishant%2Fdsa/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rishant%2Fdsa/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rishant","download_url":"https://codeload.github.com/rishant/dsa/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rishant%2Fdsa/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28601826,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-20T09:39:28.479Z","status":"ssl_error","status_checked_at":"2026-01-20T09:38:10.511Z","response_time":117,"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":"2025-04-05T06:28:44.955Z","updated_at":"2026-01-20T10:32:11.147Z","avatar_url":"https://github.com/rishant.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# dsa\nconcept and implementation using java\n\n# Hashing:\n - It is used for fast retrival and store value.\n\nHashing Technics for resolve collision(टक्कर):\n1. Division\n2. Folding \n3. Mid Squre\n4. Moduler multiplication\n\nSearch Technics:\n1. Linear Search - O(n)\n2. Binary Search - O(log n)\n\nOpen Addressing - Chaining Method\n\nChaining Method:\n   - (If collision happens then compare exsting value and build chain example: Hashmap - Array-Of-LinkedList)\nhttps://www.youtube.com/watch?v=zeMa9sg-VJM\n\nClose Addressing - Linear Probling, Quarditic Probling, Double Probling Method\n - Linear Probling: \n   - (If collision happens then find next available location and insert element)\nhttps://www.youtube.com/watch?v=zeMa9sg-VJM\n   - Steps:\n   - 1. key = 5, m = 10; where m is maxBucketSize.\n   - Calculate Hash value of key hash(key) = key % m; hash(5) = 5%10;\n   - run loop to find available local from hash-calculated for i = 0..10 increse i++ { arr[(hash(5)+i)%m] == null -\u003e insert(5); break;}\nQuarditic Probling:\nhttps://www.youtube.com/watch?v=dxrLtf-Fybk\n   - Steps:\n   - 1. key = 5, m = 10; where m is maxBucketSize.\n   - Calculate Hash value of key hash(key) = key % m; hash(5) = 5%10;\n   - run loop to find available local from hash-calculated for i = 0..10 increse i++ { arr[(hash(5)+(i power 2))%m] == null -\u003e insert(5); break;}\nDouble Hashing:\nhttps://www.youtube.com/watch?v=AYcsTOeFVas\n   - for i = 0..10 increse i++ { arr[(hash(5)+ (V*i))%m] == null -\u003e insert(5); break;}\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frishant%2Fdsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frishant%2Fdsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frishant%2Fdsa/lists"}