NumberAppearingOddTimesTest.java

packagecom.thealgorithms.bitmanipulation;

importstaticorg.junit.jupiter.api.Assertions.assertEquals;

importjava.util.stream.Stream;
importorg.junit.jupiter.params.ParameterizedTest;
importorg.junit.jupiter.params.provider.Arguments;
importorg.junit.jupiter.params.provider.MethodSource;

classNumberAppearingOddTimesTest {

/**
 * Parameterized test for findOddOccurrence method. Tests multiple
 * input arrays and their expected results.
 */
@ParameterizedTest
@MethodSource("provideTestCases")
voidtestFindOddOccurrence(int[] input, intexpected) {
assertEquals(expected, NumberAppearingOddTimes.findOddOccurrence(input));
 }

/**
 * Provides test cases for the parameterized test.
 * Each test case consists of an input array and the expected result.
 */
privatestaticStream<Arguments> provideTestCases() {
returnStream.of(
// Single element appearing odd times (basic case)
Arguments.of(newint[] {5, 6, 7, 8, 6, 7, 5}, 8),

// More complex case with multiple pairs
Arguments.of(newint[] {2, 3, 5, 4, 5, 2, 4, 3, 5, 2, 4, 4, 2}, 5),

// Case with only one element appearing once
Arguments.of(newint[] {10, 10, 20, 20, 30}, 30),

// Negative numbers with an odd occurrence
Arguments.of(newint[] {-5, -5, -3, -3, -7, -7, -7}, -7),

// All elements cancel out to 0 (even occurrences of all elements)
Arguments.of(newint[] {1, 2, 1, 2}, 0),

// Array with a single element (trivial case)
Arguments.of(newint[] {42}, 42),

// Large array with repeated patterns
Arguments.of(newint[] {1, 1, 2, 2, 3, 3, 3, 4, 4}, 3));
 }
}