Hysen Labs
Open-source project
sherxon/AlgoDS avatar
sherxon

AlgoDS

GitHub describes it as Implementation of Algorithms and Data Structures, Problems and Solutions. The repository metadata lists Java as its primary language. The metadata lists the MIT license. This article stays within the project description and details documented in the GitHub repository README.

3,431 stars601 forksJavaMIT
01
DEEP OPEN-SOURCE ANALYSIS

sherxon/AlgoDS: Algorithms and Data Structures

GitHub describes it as Implementation of Algorithms and Data Structures, Problems and Solutions. The repository metadata lists Java as its primary language. The metadata lists the MIT license. This article stays within the project description and details documented in the GitHub repository README.

02
DEEP OPEN-SOURCE ANALYSIS

Repository scope

GitHub describes it as Implementation of Algorithms and Data Structures, Problems and Solutions. The repository metadata lists Java as its primary language. The metadata lists the MIT license. The README describes the project this way: This is the collection of Algorithms, Data Structures and Interview Questions with solutions. This repository contains my solutions for common algorithmic problems and implementation of Data Structures in Java. I've created this repository to learn about algorithms. I am adding solutions continuously.

03
DEEP OPEN-SOURCE ANALYSIS

Questions

The README section "Questions" states: Here are questions divided by difficulty level: 1) Easy Questions and Answers 2) Medium Questions and Answers 3) Hard Questions and Answers

04
DEEP OPEN-SOURCE ANALYSIS

Arrays

The README section "Arrays" states: 1) Rotate Array 2) Contains Duplicate 3) Find Peak Element 4) Maximum Subarray 5) Kth Largest Element in an Array 6) Find All Duplicates in an Array 7) Longest Increasing Subsequence 8) Rotate Image, matrix 9) Shuffle an Array 10) Find Min in Rotated Array 11) Search in Rotated Array

05
DEEP OPEN-SOURCE ANALYSIS

Linked List

The README section "Linked List" states: 1) Singly Linked List Implementation 1) Doubly Linked List Implementation 3) Delete Node in a Linked List 4) Palindrome Linked List 5) Reverse Linked List 6) Intersection of Two Linked Lists 7) Linked List Cycle 8) Remove Nth Node From End of List 9) Merge Sort List 10) Find Linked List Cycle 11) Merge k Sorted Lists

06
DEEP OPEN-SOURCE ANALYSIS

Editorial conclusion

The repository README is the source for this review. It does not replace a local installation or an independent test.

07
DEEP OPEN-SOURCE ANALYSIS

Official sources

08
Community notes

Community notes