{"id":20237184,"url":"https://github.com/santik/hackerrank","last_synced_at":"2025-08-27T07:08:24.749Z","repository":{"id":73389371,"uuid":"261708189","full_name":"santik/hackerrank","owner":"santik","description":"My solution for hackerrank puzzles","archived":false,"fork":false,"pushed_at":"2020-12-09T20:27:51.000Z","size":96,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-06-23T10:54:04.457Z","etag":null,"topics":["hackerrank","hackerrank-algorithms-solutions","hackerrank-java","hackerrank-solutions","hackerranksolutions","puzzles"],"latest_commit_sha":null,"homepage":"","language":"Java","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/santik.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":"2020-05-06T09:14:26.000Z","updated_at":"2020-12-09T20:27:54.000Z","dependencies_parsed_at":"2023-07-07T08:33:12.972Z","dependency_job_id":null,"html_url":"https://github.com/santik/hackerrank","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/santik/hackerrank","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/santik%2Fhackerrank","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/santik%2Fhackerrank/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/santik%2Fhackerrank/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/santik%2Fhackerrank/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/santik","download_url":"https://codeload.github.com/santik/hackerrank/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/santik%2Fhackerrank/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":272302225,"owners_count":24910142,"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-08-27T02:00:09.397Z","response_time":76,"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":["hackerrank","hackerrank-algorithms-solutions","hackerrank-java","hackerrank-solutions","hackerranksolutions","puzzles"],"created_at":"2024-11-14T08:25:23.044Z","updated_at":"2025-08-27T07:08:24.729Z","avatar_url":"https://github.com/santik.png","language":"Java","readme":"# Hackerrank \u0026 Leedcode Solutions\n\nMy hackerrank username is [santik](https://www.hackerrank.com/santik)  \nI'm planning to add here solutions for hackerrank and leedcode puzzles.  \nNot sure yet about old solutions, but will try to add everything new.\n\n\n### Solutions\n\n* [Cut the Tree](https://github.com/santik/hackerrank/blob/master/src/cutthetree/Solution.java)\n* [Waiter](https://github.com/santik/hackerrank/blob/master/src/waiter/Solution.java)\n* [Find Maximum Index Product](https://github.com/santik/hackerrank/blob/master/src/findmaximumindexproduct/Solution.java)\n* [Prim's (MST) : Special Subtree](https://github.com/santik/hackerrank/blob/master/src/primsmstsub/Solution.java)\n* [Breadth First Search: Shortest Reach](https://github.com/santik/hackerrank/blob/master/src/bfsshortreach/Solution.java)\n* [Almost Sorted](https://github.com/santik/hackerrank/blob/master/src/almostsorted/Solution.java)\n* [Bear and Steady Gene](https://github.com/santik/hackerrank/blob/master/src/bearandsteadygene/Solution.java)\n* [Gena Playing Hanoi](https://github.com/santik/hackerrank/blob/master/src/gena/Solution.java) _Fails some test with timeout._\n* [Queue using Two Stacks](https://github.com/santik/hackerrank/blob/master/src/queueusingtwostacks/Solution.java)\n* [Is This a Binary Search Tree?](https://github.com/santik/hackerrank/blob/master/src/isbinarysearchtree/Solution.java)\n* [Minimum Distances](https://github.com/santik/hackerrank/blob/master/src/minimumdistances/Solution.java)\n* [Designer PDF Viewer](https://github.com/santik/hackerrank/blob/master/src/designerpdfviewer/Solution.java)\n* [Picking Numbers](https://github.com/santik/hackerrank/blob/master/src/pickingnumbers/Solution.java)\n* [A Very Big Sum](https://github.com/santik/hackerrank/blob/master/src/averybigsum/Solution.java)\n* [Diagonal Difference](https://github.com/santik/hackerrank/blob/master/src/diagonaldifference/Solution.java)\n* [Staircase](https://github.com/santik/hackerrank/blob/master/src/staircase/Solution.java)\n* [Mini-Max Sum](https://github.com/santik/hackerrank/blob/master/src/minimaxsum/Solution.java)\n* [Array Manipulation](https://github.com/santik/hackerrank/blob/master/src/crush/Solution.java)\n* [Subarray Sum Equals K](https://github.com/santik/hackerrank/blob/master/src/subarraysumequalsk/Solution.java)\n* [Subrectangle Queries](https://github.com/santik/hackerrank/blob/master/src/subrectanglequeries/SubrectangleQueries.java)\n* [Count Square Submatrices with All Ones](https://github.com/santik/hackerrank/blob/master/src/countsquaresubmatriceswithallones/Solution.java)\n* [Longest Substring Without Repeating Characters](https://github.com/santik/hackerrank/blob/master/src/longestsubstringwithoutrepeatingcharacters/Solution.java)\n* [Distant Barcodes](https://github.com/santik/hackerrank/blob/master/src/distantbarcodes/Solution.java)\n* [Kids With the Greatest Number of Candies](https://github.com/santik/hackerrank/blob/master/src/kidswiththegreatestnumberofcandies/Solution.java)\n* [Third Maximum Number](https://github.com/santik/hackerrank/blob/master/src/thirdmaximumnumber/Solution.java)\n\n###Solutions for https://adventofcode.com/2020/\n* [Day1](https://github.com/santik/hackerrank/blob/master/src/reportrepair/Solution.java)\n* [Day2](https://github.com/santik/hackerrank/blob/master/src/passwordphilosophy/Solution.java)\n* [Day3](https://github.com/santik/hackerrank/blob/master/src/toboggantrajectory/Solution.java)\n* [Day4](https://github.com/santik/hackerrank/blob/master/src/passportprocessing/Solution.java)\n* [Day5](https://github.com/santik/hackerrank/blob/master/src/binaryboarding/Solution.java)\n* [Day6](https://github.com/santik/hackerrank/blob/master/src/customcustoms/Solution.java)\n* [Day7](https://github.com/santik/hackerrank/blob/master/src/handyhaversacks/Solution.java)\n* [Day8](https://github.com/santik/hackerrank/blob/master/src/handheldhalting/Solution.java)\n* [Day9](https://github.com/santik/hackerrank/blob/master/src/encodingerror/Solution.java)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsantik%2Fhackerrank","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsantik%2Fhackerrank","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsantik%2Fhackerrank/lists"}