diff --git a/DIRECTORY.md b/DIRECTORY.md
index 4f1c033352..2d70c5d6a2 100644
--- a/DIRECTORY.md
+++ b/DIRECTORY.md
@@ -9,10 +9,12 @@
* [SumOfSubset](Backtracking/SumOfSubset.js)
* **Bit-Manipulation**
* [BinaryCountSetBits](Bit-Manipulation/BinaryCountSetBits.js)
+ * [IsPowerofFour](Bit-Manipulation/IsPowerofFour.js)
* [IsPowerOfTwo](Bit-Manipulation/IsPowerOfTwo.js)
* [LogTwo](Bit-Manipulation/LogTwo.js)
* [NextPowerOfTwo](Bit-Manipulation/NextPowerOfTwo.js)
* [SetBit](Bit-Manipulation/SetBit.js)
+ * [UniqueElementInAnArray](Bit-Manipulation/UniqueElementInAnArray.js)
* **Cache**
* [LFUCache](Cache/LFUCache.js)
* [LRUCache](Cache/LRUCache.js)
@@ -270,6 +272,7 @@
* [Problem017](Project-Euler/Problem017.js)
* [Problem018](Project-Euler/Problem018.js)
* [Problem020](Project-Euler/Problem020.js)
+ * [Problem021](Project-Euler/Problem021.js)
* [Problem023](Project-Euler/Problem023.js)
* [Problem025](Project-Euler/Problem025.js)
* [Problem028](Project-Euler/Problem028.js)
diff --git a/Project-Euler/test/Problem044.test.js b/Project-Euler/test/Problem044.test.js
index b542b3db6d..e1eeae0e6c 100644
--- a/Project-Euler/test/Problem044.test.js
+++ b/Project-Euler/test/Problem044.test.js
@@ -12,8 +12,8 @@ describe('checking nth prime number', () => {
expect(problem44(1)).toBe(5482660)
})
// Project Euler Second Value for Condition Check
- // FIXME skip this test for now because it runs very long and clogs up the CI & pre-commit hook
- test('if the number is greater or equal to 2167', () => {
+ // Skipping this by default as it makes CI runs take way too long
+ test.skip('if the number is greater or equal to 2167', () => {
expect(problem44(2167)).toBe(8476206790)
})
})
pFad - Phonifier reborn
Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies:
Alternative Proxy
pFad Proxy
pFad v3 Proxy
pFad v4 Proxy