{"id":19691271,"url":"https://github.com/zenelhila/data-max-assignment","last_synced_at":"2025-10-16T21:32:12.137Z","repository":{"id":113681828,"uuid":"485289585","full_name":"zenelhila/Data-Max-Assignment","owner":"zenelhila","description":null,"archived":false,"fork":false,"pushed_at":"2022-04-25T08:51:15.000Z","size":4,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"main","last_synced_at":"2025-02-27T10:59:45.510Z","etag":null,"topics":["arrays","arraysort","fibonacci-sequence","java","linked-list"],"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/zenelhila.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":"2022-04-25T08:42:36.000Z","updated_at":"2022-10-23T14:43:51.000Z","dependencies_parsed_at":null,"dependency_job_id":"8ebbfc2c-f226-4177-9126-441a40fbdaa1","html_url":"https://github.com/zenelhila/Data-Max-Assignment","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/zenelhila/Data-Max-Assignment","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/zenelhila%2FData-Max-Assignment","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/zenelhila%2FData-Max-Assignment/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/zenelhila%2FData-Max-Assignment/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/zenelhila%2FData-Max-Assignment/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/zenelhila","download_url":"https://codeload.github.com/zenelhila/Data-Max-Assignment/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/zenelhila%2FData-Max-Assignment/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":266769597,"owners_count":23981404,"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-07-23T02:00:09.312Z","response_time":66,"last_error":null,"robots_txt_status":null,"robots_txt_updated_at":null,"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":["arrays","arraysort","fibonacci-sequence","java","linked-list"],"created_at":"2024-11-11T19:08:34.619Z","updated_at":"2025-10-16T21:32:07.102Z","avatar_url":"https://github.com/zenelhila.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Data Max Assignment\n\n## Exercise 1\nGiven a one-dimensional array, write a function that returns the length of the longest sequence of 1s.\nThe array consists of integers, and it contains only 1s and 0s.\n\nThe function receives as input the array.\n\n#### Example 1:\n\n| 1   | 0   | 0   | 1   | 1   | 1   | 1   | \n|-----|-----|-----|-----|-----|-----|-----|\n\nshould return 4\n\n#### Example 2:\n| 1   | 0   | 0   | 0   | 1   | 0   | 1   | \n|-----|-----|-----|-----|-----|-----|-----|\n\nshould return 1\n\n#### Example 3:\n| 0   | 0   | 0   | 0   | 0   | 0   | 0   | \n|-----|-----|-----|-----|-----|-----|-----|\n\nshould return 0\n\n#### Example 4:\n| 0   | 1   | 1   | 1   | 1   | 1   | 1   | \n|-----|-----|-----|-----|-----|-----|-----|\n\nshould return 6\n\n\n#### Example 5:\n| 0   | 1   | 1   | 1   | 0   | 1   | 1   | \n|-----|-----|-----|-----|-----|-----|-----|\n\nshould return 3\n\n## Exercise 2\n\nWhat are the differences between `linked lists` and `arrays`?\n\n## (Optional) Exercise 3\n\nWrite a function that returns the `n-th` fibonacci number. `n` is provided as input to the function\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fzenelhila%2Fdata-max-assignment","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fzenelhila%2Fdata-max-assignment","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fzenelhila%2Fdata-max-assignment/lists"}