1
1
#define CATCH_CONFIG_MAIN
2
- #include " ../catch_amalgamated.hpp"
3
2
#include " contains_duplicate.cpp"
4
3
4
+ #include " ../catch_amalgamated.hpp"
5
+
5
6
TEST_CASE (" Contains Duplicate" , " [contains_duplicate]" ) {
6
7
Solution solution;
7
8
@@ -124,7 +125,7 @@ TEST_CASE("Contains Duplicate", "[contains_duplicate]") {
124
125
125
126
// Large array with one duplicate at the end
126
127
vector<int > large_with_dup = large_unique;
127
- large_with_dup.push_back (500 ); // Duplicate of existing element
128
+ large_with_dup.push_back (500 ); // Duplicate of existing element
128
129
REQUIRE (solution.containsDuplicate (large_with_dup) == true );
129
130
}
130
131
@@ -139,7 +140,7 @@ TEST_CASE("Contains Duplicate", "[contains_duplicate]") {
139
140
140
141
// Fibonacci-like sequence
141
142
vector<int > nums3 = {1 , 1 , 2 , 3 , 5 , 8 , 13 };
142
- REQUIRE (solution.containsDuplicate (nums3) == true ); // Two 1's
143
+ REQUIRE (solution.containsDuplicate (nums3) == true ); // Two 1's
143
144
}
144
145
145
146
SECTION (" Multiple duplicates" ) {
@@ -192,4 +193,4 @@ TEST_CASE("Contains Duplicate", "[contains_duplicate]") {
192
193
vector<int > unsorted_dup = {3 , 1 , 4 , 1 , 5 , 9 , 2 };
193
194
REQUIRE (solution.containsDuplicate (unsorted_dup) == true );
194
195
}
195
- }
196
+ }
0 commit comments