msboffl/ds-algo

AI Summary: This issue requests the implementation of an Iterator for an existing ArrayList data structure. It is labeled as an enhancement and a good first issue, suggesting it's a well-defined, beginner-friendly task that is part of a larger data structures project.

AI Summary: This issue requests the implementation of dynamic resizing logic for an unspecified data structure. It is categorized as an enhancement and a sub-task, specifically designed to be a good first issue for new contributors.

AI Summary: This issue involves implementing a basic ArrayList class, likely as a new data structure component within a larger project. It is designated as a good first issue, making it suitable for new contributors to get acquainted with the codebase by adding fundamental functionality.

AI Summary: This issue requests the implementation of a dynamic array, similar to an ArrayList, that adheres to the Collection interface. It requires core functionalities such as add, get, set, remove, size, and isEmpty, along with automatic resizing when capacity is exceeded. The implementation must also support iteration using an Iterator and include comprehensive unit tests covering various edge cases.

AI Summary: This issue requests the implementation of a singly linked list data structure. It should adhere to the Collection interface, supporting core operations like add, get, remove, size, and isEmpty, along with an iterator for traversal and comprehensive unit tests.

AI Summary: This issue requests the implementation of the selection sort algorithm. The solution must be capable of sorting both numerical and string data types, and include comprehensive unit tests covering normal and edge cases.

AI Summary: This issue requests the implementation of the linear search algorithm for generic collections. The solution should work with both ArrayList and LinkedList, returning the index of the first matching element or -1 if not found. Comprehensive unit tests covering normal and edge cases are also required.

AI Summary: This issue involves implementing a First-In, First-Out (FIFO) queue data structure. The implementation should support standard queue operations such as enqueue, dequeue, peek, isEmpty, and size, utilizing either an ArrayList or LinkedList for underlying storage. Comprehensive unit tests are required to ensure correct FIFO behavior and cover edge cases.

AI Summary: This issue requests the implementation of a Last-In, First-Out (LIFO) stack data structure. The stack should utilize either an ArrayList or LinkedList for its internal storage and support standard operations like push, pop, peek, isEmpty, and size, along with comprehensive unit tests for various conditions.