{"id":24707967,"url":"https://github.com/t-kalv/longest-increasing-subsequence","last_synced_at":"2025-03-22T05:40:51.025Z","repository":{"id":181605959,"uuid":"324784777","full_name":"T-Kalv/Longest-Increasing-Subsequence","owner":"T-Kalv","description":"Longest Increasing Subsequence","archived":false,"fork":false,"pushed_at":"2020-12-27T14:59:58.000Z","size":3,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-01-27T06:20:03.743Z","etag":null,"topics":["algorithm"],"latest_commit_sha":null,"homepage":"","language":"Python","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/T-Kalv.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}},"created_at":"2020-12-27T14:57:27.000Z","updated_at":"2023-02-05T13:16:17.000Z","dependencies_parsed_at":"2023-07-16T13:38:52.269Z","dependency_job_id":null,"html_url":"https://github.com/T-Kalv/Longest-Increasing-Subsequence","commit_stats":null,"previous_names":["t-kalv/longest-increasing-subsequence"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/T-Kalv%2FLongest-Increasing-Subsequence","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/T-Kalv%2FLongest-Increasing-Subsequence/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/T-Kalv%2FLongest-Increasing-Subsequence/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/T-Kalv%2FLongest-Increasing-Subsequence/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/T-Kalv","download_url":"https://codeload.github.com/T-Kalv/Longest-Increasing-Subsequence/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244913005,"owners_count":20530769,"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","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":["algorithm"],"created_at":"2025-01-27T06:20:09.558Z","updated_at":"2025-03-22T05:40:51.006Z","avatar_url":"https://github.com/T-Kalv.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Longest-Increasing-Subsequence\nLongest Increasing Subsequence\n\nYou are given an array of integers. Return the length of the longest increasing subsquence (does not have to be necessarily contiguous) in the array.\n\nE.g. [0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15]\n\nThe following input should return 6.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ft-kalv%2Flongest-increasing-subsequence","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ft-kalv%2Flongest-increasing-subsequence","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ft-kalv%2Flongest-increasing-subsequence/lists"}