{"id":22031692,"url":"https://github.com/sanish07/java-dsa","last_synced_at":"2025-07-27T15:11:26.685Z","repository":{"id":121157123,"uuid":"506497617","full_name":"Sanish07/Java-DSA","owner":"Sanish07","description":"This repository contains the coding problems solved in Java DSA. ","archived":false,"fork":false,"pushed_at":"2022-07-30T10:39:18.000Z","size":13,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-23T11:42:09.778Z","etag":null,"topics":["data-structures","dsa-practice","java-8"],"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/Sanish07.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-06-23T04:36:33.000Z","updated_at":"2022-06-24T14:30:59.000Z","dependencies_parsed_at":null,"dependency_job_id":"da2e207b-2d8b-4649-9b5a-bd466b69077a","html_url":"https://github.com/Sanish07/Java-DSA","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Sanish07/Java-DSA","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sanish07%2FJava-DSA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sanish07%2FJava-DSA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sanish07%2FJava-DSA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sanish07%2FJava-DSA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Sanish07","download_url":"https://codeload.github.com/Sanish07/Java-DSA/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sanish07%2FJava-DSA/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":267376348,"owners_count":24077299,"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-27T02:00:11.917Z","response_time":82,"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":["data-structures","dsa-practice","java-8"],"created_at":"2024-11-30T08:19:49.886Z","updated_at":"2025-07-27T15:11:26.680Z","avatar_url":"https://github.com/Sanish07.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Java-DSA\nThis repository contains the coding problems solved in Java DSA. \n\n\u003ch3\u003e Legend \u003c/h3\u003e\n\u003cli\u003e File Name :- Description   \u003cb\u003e(Implementation Code)\u003c/b\u003e \u003c/li\u003e\n\u003cli\u003e\u003cem\u003e File Name :- Description \u003c/em\u003e \u003cb\u003e (Solved DSA Problems Code) \u003c/b\u003e \u003c/li\u003e\n\n\u003ch2\u003e Basics \u003c/h2\u003e\n\u003cli\u003e Functions :- Functions in Array \u003c/li\u003e \n\u003cli\u003e Scoping :- Function Scoping \u003c/li\u003e  \n\u003cli\u003e  VarArgs :- Implementatation of VarArgs in Java \u003c/li\u003e \n\u003cli\u003e\u003cem\u003e PrimeNumber :- Checking if a Number is Prime or not. \u003c/em\u003e\u003c/li\u003e\n\u003cli\u003e\u003cem\u003e Armstrong :- To print all the 3 or less digit armstrong numbers upto 'n' \u003c/em\u003e\u003c/li\u003e\n\n\u003ch2\u003e Arrays \u003c/h2\u003e\n\u003cli\u003e ArrayListIntro :- Implementation of ArrayList in Java \u003c/li\u003e \n\u003cli\u003e\u003cem\u003e LargestElement :- Program to return the index of largest and second-largest element in an array \u003c/em\u003e\u003c/li\u003e  \n\u003cli\u003e\u003cem\u003e CheckForSort :- Program to find whether an array is sorted or not. \u003c/em\u003e\u003c/li\u003e \n\u003cli\u003e\u003cem\u003e Operations :- Performing insert and delete operations in Array \u003c/em\u003e\u003c/li\u003e\n\u003cli\u003e\u003cem\u003e ArrayRev :- Program to Reverse an Array\u003c/em\u003e\u003c/li\u003e\n\u003cli\u003e\u003cem\u003e RemoveDup :- To Remove Duplicates elements from a Sorted Array. \u003c/em\u003e\u003c/li\u003e\n\u003cli\u003e\u003cem\u003e MoveZeroes :- Moving Zeroes to the End of Array \u003c/em\u003e\u003c/li\u003e\n\u003cli\u003e\u003cem\u003e LeftRotateArr :- Programs to Left Rotate an Array by One and 'd' positions respectively in counter-clockwise fashion. \u003c/em\u003e\u003c/li\u003e\n\u003cli\u003e\u003cem\u003e LeadersArr :- Program to find the leader numbers in an array(sorted or unsorted). \u003c/em\u003e\u003c/li\u003e\n\u003cli\u003e\u003cem\u003e MaxDifference :- Maximum Difference Problem with Order - Program to find maximum value of arr[j] - arr[i] such that j \u003e i \u003c/em\u003e\u003c/li\u003e\n\u003cli\u003e\u003cem\u003e FrequencySortedArr :- Program to find the frequencies of each unique number in a sorted array. \u003c/em\u003e\u003c/li\u003e\n\u003cli\u003e\u003cem\u003e MaxOnes :- Problem to find the maximum number of consecutive 1's in a binary array. \u003c/em\u003e\u003c/li\u003e\n\u003cli\u003e\u003cem\u003e StockBS :- Stock Buy And Sell Problem, program to find maximum profit in buying and selling of stocks on different days. \u003c/em\u003e\u003c/li\u003e\n\u003cli\u003e\u003cem\u003e TrapRainwater :- Program to find the units of water that can be stored/trapped within a given set of bars. \u003c/em\u003e\u003c/li\u003e\n\u003cli\u003e\u003cem\u003e MaxSumSubArr :- Program to Find Subarray having maximum sum of elements. \u003c/em\u003e\u003c/li\u003e\n\u003cli\u003e\u003cem\u003e LongestEvenOdd :- Program to find the longest subarray with alternate appearing Even-Odd Numbers. \u003c/em\u003e\u003c/li\u003e\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsanish07%2Fjava-dsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsanish07%2Fjava-dsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsanish07%2Fjava-dsa/lists"}