* feat: FloodFill Algorithm with iterative approach
- nested class Point: helper class, represents point in 2D field (x,y)
- shouldSkipPixel method: helper method to validate point
- floodFill method: iterative version of floodFill, uses Queue to add and poll Points and change it color if allowed
* feat: tests for IterativeFloodFill
-same tests as for normal floodFill and test for a big image
* docs: add link to floodFill algorithm
* codeStyle fix
* tests: add tests for edge cases
* codeStyle fix
* codeStyle fix
* codeStyle fix
* refactor: reorganize structure and add JavaDoc
- Move private methods after public methods for better readability
- Add class-level JavaDoc documentation with algorithm description and links to references
* Add Sum of Squares algorithm implementation
* Format code and add Wikipedia URL for Lagrange's theorem
* Fixed clang-format issues
* Added Mo's Algorithm and DiceThrower recursive algorithms
- Mo's Algorithm: Square root decomposition for offline range queries(Imp in CP)
- DiceThrower: Recursive backtracking for dice combinations(very imp)
- Both algorithms include comprehensive test suites
- Formatted with clang-format and i follow contribution guidelines
* Fixed checkstyle violation
* Fixed SpotBugs issue
* Added in PMD exclusions
* Improved test coverage for better Codecov scores.
* Fixed clang-format issues in test files
* Add Mo's Algorithm and DiceThrower algorithms with comprehensive tests
* Fixed PartitionProblem.java documentation comment placement
* Fix MiniMaxAlgorithm setScores bug and add comprehensive tests
- Fix bug in setScores method where scores.length % 1 == 0 always returned true
- Add isPowerOfTwo helper method to properly validate array length
- Add comprehensive unit tests covering edge cases and algorithm correctness
- Tests include validation for power of 2 check, minimax logic, and error handling
Fixes issue with incorrect validation logic in MiniMaxAlgorithm.setScores()
* Fix Checkstyle violations and improve setScores validation
- Replace star imports with explicit imports in test file
- Remove trailing whitespaces from all lines
- Add proper file ending newline
- Improve setScores method to handle edge cases properly
- Use direct bit manipulation for power-of-2 check as suggested
- Ensure error message is printed and scores remain unchanged for invalid input
All Checkstyle violations resolved and tests pass successfully.
* Add missing newline at end of MiniMaxAlgorithmTest.java
- Fix Checkstyle violation: NewlineAtEndOfFile
- Ensure file ends with proper newline character
- All tests continue to pass successfully
* Fix PMD violation by utilizing isPowerOfTwo method
- Replace inline bit manipulation with isPowerOfTwo method call
- Resolves PMD UnusedPrivateMethod violation
- Maintains same validation logic and error handling
- All tests continue to pass successfully
* test: improve MiniMaxAlgorithm test coverage for CodeCov
- Add comprehensive test cases for isPowerOfTwo function edge cases
- Test setScores method with various invalid array lengths (0, 3, 5, 6, 7, 9, 10, 15)
- Add tests for large valid powers of 2 (up to 64 elements)
- Ensure complete coverage of error handling branches
- Increase test count from 14 to 19 tests
- Fix partial coverage issues identified in CodeCov report
Resolves CodeCov coverage gaps in MiniMaxAlgorithm.java
* Fix checkstyle errors
* Fix checkstyle errors
---------
Co-authored-by: ssaha <ssaha@wiley.com>
Co-authored-by: Deniz Altunkapan <93663085+DenizAltunkapan@users.noreply.github.com>
* fix: revert ReverseStack deletions and ensure lint compliance
* Fix formatting for ReverseStack and test files
* Delete ReverseStackUsingRecursion and its test as requested
---------
Co-authored-by: Deniz Altunkapan <93663085+DenizAltunkapan@users.noreply.github.com>
* Create ArrayRightRotationTest.java
* Create ArrayRightRotation.java
* The updated one
* The updated one
* Added the test cases
* Added new test cases!
* Update ArrayRightRotation.java
* Update ArrayRightRotationTest.java
* modify code to make use of java Optional class
* revert changes
* add java.util.Optional<Integer>
* add java.util.Optional
* refactors: make `findmajor` return `optional`
* refactors: make method name findMajor and split it
* refactors: change method name in tests
* Apply suggestions from code review
Co-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>
* change back to int
* fix: swap arguments
* tests: add some test cases
* refactor: add `isMajority` and avoid rounding
* style: use `var`
* style: swap arguments of `countOccurrences`
---------
Co-authored-by: vil02 <vil02@o2.pl>
Co-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>
* Number of count of major element in Boyer Moore algorithm
* test: add `BoyerMooreTest`
* style: basic linting
* tests: add test case from the issue
---------
Co-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>
Co-authored-by: vil02 <vil02@o2.pl>
* Moved StackPostfixNotation.java from the Others section to the Stack section
* Put all stack related algo in a separate stack directory in the algorithms directory. The stack directory under data-structures now only contains various implementations of the stack data structure.
* formatted files
