{"id":15882420,"url":"https://github.com/another-guy/problem-solving-ts","last_synced_at":"2026-03-17T23:07:23.445Z","repository":{"id":44120395,"uuid":"132197894","full_name":"another-guy/problem-solving-ts","owner":"another-guy","description":"Coding Problems and Their Solutions in TypeScript","archived":false,"fork":false,"pushed_at":"2023-01-04T21:51:13.000Z","size":1039,"stargazers_count":4,"open_issues_count":13,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-05-28T14:03:17.281Z","etag":null,"topics":["codechef","codeeval","codeforces","coderbyte","codewars","coding-challenge","coding-game","coding-interviews","cracking-the-coding-interview","hackerrank","hackerrank-solutions","leetcode","project-euler","spoj","spoj-solutions","topcoder"],"latest_commit_sha":null,"homepage":null,"language":"TypeScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/another-guy.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":"LICENSE","code_of_conduct":"CODE_OF_CONDUCT.md","threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2018-05-04T23:24:09.000Z","updated_at":"2023-09-25T08:31:24.000Z","dependencies_parsed_at":"2023-02-02T21:15:36.131Z","dependency_job_id":null,"html_url":"https://github.com/another-guy/problem-solving-ts","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/another-guy/problem-solving-ts","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/another-guy%2Fproblem-solving-ts","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/another-guy%2Fproblem-solving-ts/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/another-guy%2Fproblem-solving-ts/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/another-guy%2Fproblem-solving-ts/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/another-guy","download_url":"https://codeload.github.com/another-guy/problem-solving-ts/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/another-guy%2Fproblem-solving-ts/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":30635156,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-03-17T22:38:22.569Z","status":"ssl_error","status_checked_at":"2026-03-17T22:38:11.804Z","response_time":56,"last_error":"SSL_read: 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":["codechef","codeeval","codeforces","coderbyte","codewars","coding-challenge","coding-game","coding-interviews","cracking-the-coding-interview","hackerrank","hackerrank-solutions","leetcode","project-euler","spoj","spoj-solutions","topcoder"],"created_at":"2024-10-06T04:03:16.446Z","updated_at":"2026-03-17T23:07:23.428Z","avatar_url":"https://github.com/another-guy.png","language":"TypeScript","readme":"# Problem Solving in TypeScript\n\n\n| Build Status – Travis CI | Maintainability | Code Coverage | Documentation |\n| ---------------- | ------------------ | ------------------- | ------------------- | \n| [![Build Status](https://travis-ci.org/another-guy/problem-solving-ts.svg?branch=master)](https://travis-ci.org/another-guy/problem-solving-ts)  | [![bitHound Overall Score](https://www.bithound.io/github/another-guy/problem-solving-ts/badges/score.svg)](https://www.bithound.io/github/another-guy/problem-solving-ts) [![bitHound Code](https://www.bithound.io/github/another-guy/problem-solving-ts/badges/code.svg)](https://www.bithound.io/github/another-guy/problem-solving-ts) [![Maintainability](https://api.codeclimate.com/v1/badges/0a3a7953a4d9cf89673a/maintainability)](https://codeclimate.com/github/another-guy/problem-solving-ts/maintainability) | [![Coverage Status](https://coveralls.io/repos/github/another-guy/problem-solving-ts/badge.svg?branch=master)](https://coveralls.io/github/another-guy/problem-solving-ts?branch=master) [![Test Coverage](https://api.codeclimate.com/v1/badges/0a3a7953a4d9cf89673a/test_coverage)](https://codeclimate.com/github/another-guy/problem-solving-ts/test_coverage) | [![Inline docs](http://inch-ci.org/github/another-guy/problem-solving-ts.svg?branch=master)](http://inch-ci.org/github/another-guy/problem-solving-ts) |\n\n| License | Liberapay | Repo hit count |\n| ------------------- | ------------------- | ------------------- |\n| [![MIT license](http://img.shields.io/badge/license-MIT-brightgreen.svg)](http://opensource.org/licenses/MIT) | [![Liberapay](https://img.shields.io/liberapay/patrons/another-guy.svg)](https://www.bithound.io/github/another-guy/problem-solving-ts) | [![HitCount](http://hits.dwyl.com/another-guy/problem-solving-ts.svg)](http://hits.dwyl.com/another-guy/problem-solving-ts) |\n\n\n## Table of Contents\n\n1. CodinGame\n    * Easy\n        * Chuck Norris (message encoding)\n1. Cracking the Coding Interview\n    * 1 TODO\n    * 2 TODO\n    * 3 Stacks and Queues\n        * 3.1 [MultiStack](https://github.com/another-guy/problem-solving-ts/blob/master/src/cracking-the-coding-interview/3-stacks-and-queues/3-1-single-array-multiple-stacks.cr.md). [[Code Review]](https://codereview.stackexchange.com/questions/194051/multiple-stacks-implemented-via-a-linked-lists-on-top-of-single-fixed-size-array)\n    * 4 Graphs\n        * 4.1 Existence of path between nodes\n    * 5 Bit Manipulation\n        * 5.0 [Bitwise Operations Cheat Sheet](https://github.com/another-guy/problem-solving-ts/blob/master/src/cracking-the-coding-interview/5-bit-manipulation/5-0-cheat-sheet.md)\n        * 5.1 Insert one bit sequence into another\n        * 5.3 [Flip bit to win](https://github.com/another-guy/problem-solving-ts/blob/master/src/cracking-the-coding-interview/5-bit-manipulation/5-3-flip-to-win.cr.md). [[Code Review]](https://codereview.stackexchange.com/questions/194733/find-the-longest-length-of-sequence-of-1-bits-achievable-by-flipping-a-single-bi)\n    * 6 Math and Logic Puzzles\n        * 6.2 Basketball\n    * 7 TODO\n    * 8 Recursion and Dynamic Programming\n        * 8.1 Triple step (non-recursive)\n        * 8.2 Robot on a grid (recursive and non-recursive). [[Code Review]](https://codereview.stackexchange.com/questions/194979/robot-on-a-grid-find-a-path-between-two-corners-with-forbidden-cells-on-the-roa)\n        * 8.3 Magic index (recursive).\n1. Leet Code\n   * 1 Two Sum\n1. Practice\n    * [Candidate algorithms](https://github.com/another-guy/problem-solving-ts/blob/master/src/practice/0-0-candidate-algorithms.md)\n    * 1 Graph\n        * 1.1 TopSort (Topological Sorting)\n        * 1.2 Dijkstra's shortest path\n        * 1.3 Prim's minimal spanning tree\n    * 9 Naive (hashtable-based) PriorityQueue\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanother-guy%2Fproblem-solving-ts","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanother-guy%2Fproblem-solving-ts","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanother-guy%2Fproblem-solving-ts/lists"}