Merge pull request #30 from vishalmishraa/29-add-problems-tags

29 add problems tags

apps/boilerplate-generator/test/directory.test.ts

@@ -6,6 +6,80 @@ dotenv.config();
 
 const problemsPath: string = process.env.PROBLEMS_DIR_PATH || '';
 
+const tags = [
+    'ARRAY',
+    'STRING',
+    'HASH_TABLE',
+    'DYNAMIC_PROGRAMMING',
+    'MATH',
+    'SORTING',
+    'GREEDY',
+    'DEPTH_FIRST_SEARCH',
+    'DATABASE',
+    'BINARY_SEARCH',
+    'BREADTH_FIRST_SEARCH',
+    'TREE',
+    'MATRIX',
+    'BIT_MANIPULATION',
+    'TWO_POINTERS',
+    'BINARY_TREE',
+    'HEAP',
+    'PREFIX_SUM',
+    'STACK',
+    'SIMULATION',
+    'GRAPH',
+    'COUNTING',
+    'DESIGN',
+    'SLIDING_WINDOW',
+    'BACKTRACKING',
+    'ENUMERATION',
+    'UNION_FIND',
+    'LINKED_LIST',
+    'ORDERED_SET',
+    'MONOTONIC_STACK',
+    'NUMBER_THEORY',
+    'TRIE',
+    'SEGMENT_TREE',
+    'DIVIDE_AND_CONQUER',
+    'QUEUE',
+    'RECURSION',
+    'BITMASK',
+    'BINARY_SEARCH_TREE',
+    'GEOMETRY',
+    'MEMOIZATION',
+    'BINARY_INDEXED_TREE',
+    'HASH_FUNCTION',
+    'COMBINATORICS',
+    'TOPOLOGICAL_SORT',
+    'STRING_MATCHING',
+    'SHORTEST_PATH',
+    'ROLLING_HASH',
+    'GAME_THEORY',
+    'INTERACTIVE',
+    'DATA_STREAM',
+    'BRAINTEASER',
+    'MONOTONIC_QUEUE',
+    'RANDOMIZED',
+    'MERGE_SORT',
+    'ITERATOR',
+    'DOUBLY_LINKED_LIST',
+    'CONCURRENCY',
+    'PROBABILITY_AND_STATISTICS',
+    'QUICKSELECT',
+    'SUFFIX_ARRAY',
+    'COUNTING_SORT',
+    'BUCKET_SORT',
+    'MINIMUM_SPANNING_TREE',
+    'SHELL',
+    'LINE_SWEEP',
+    'RESERVOIR_SAMPLING',
+    'STRONGLY_CONNECTED_COMPONENT',
+    'EULERIAN_CIRCUIT',
+    'RADIX_SORT',
+    'REJECTION_SAMPLING',
+    'INCONSISTENT_COMPARISON',
+];
+
 // check if problem directory exist or not
 describe('Problem folder exist', () => {
     it('should have problems folder', () => {
@@ -61,6 +135,37 @@ describe('Problem folder exist', () => {
             });
         })
     });
+
+    fs.readdirSync(problemsPath).filter(file => {
+        it(`${file} should have tags.md file`, () => {
+            const problemFolderPath = path.join(problemsPath, file);
+            const tagsPath = path.join(problemFolderPath, 'tags.md');
+            expect(fs.existsSync(tagsPath)).toBe(true);
+        });
+    });
+
+    fs.readdirSync(problemsPath).filter(file => {
+        it(`${file} tags should belong to predefined tags`, () => {
+            const problemFolderPath = path.join(problemsPath, file);
+            const tagsPath = path.join(problemFolderPath, 'tags.md');
+            const tagsContent = fs.readFileSync(tagsPath, 'utf8');
+            const fetchedTags = tagsContent.split('\n').map(tag => tag.trim());
+            fetchedTags.forEach(tag => {
+                expect(tags.includes(tag)).toBe(true);
+            });
+        });
+        //there should be no empty spaces && one line should have only one word which is predefined
+        it(`${file} tags should not have empty spaces`, () => {
+            const problemFolderPath = path.join(problemsPath, file);
+            const tagsPath = path.join(problemFolderPath, 'tags.md');
+            const tagsContent = fs.readFileSync(tagsPath, 'utf8');
+            const fetchedTags = tagsContent.split('\n').map(tag => tag.trim());
+            fetchedTags.forEach(tag => {
+                expect(tag).not.toBe('');
+            });
+        });
+    });
+
 });
 
 

apps/problems/Broken-SubArray/tags.md

@@ -0,0 +1,3 @@
+ARRAY
+STRING
+HASH_TABLE

apps/problems/Calculate-Fibonacci/tags.md

@@ -0,0 +1,2 @@
+  ARRAY
+  GREEDY

apps/problems/Check-Palindrome/tags.md

@@ -0,0 +1,5 @@
+  ARRAY
+  STRING
+  MATH
+  SORTING
+  GREEDY

apps/problems/Find-Median/tags.md

@@ -0,0 +1,3 @@
+  ARRAY
+  STRING
+  GREEDY

apps/problems/Find-Prime-Numbers/tags.md

@@ -0,0 +1,7 @@
+  ARRAY
+  STRING
+  HASH_TABLE
+  DYNAMIC_PROGRAMMING
+  MATH
+  SORTING
+  GREEDY

apps/problems/Intersting-Arrays/tags.md

@@ -0,0 +1,5 @@
+  ARRAY
+  STRING
+  HASH_TABLE
+  SORTING
+  GREEDY

apps/problems/Kth-Smallest/tags.md

@@ -0,0 +1,5 @@
+  ARRAY
+  STRING
+  MATH
+  SORTING
+  GREEDY

apps/problems/Matrix-Paths/tags.md

@@ -0,0 +1,5 @@
+  ARRAY
+  STRING
+  HASH_TABLE
+  DYNAMIC_PROGRAMMING
+  MATH

apps/problems/Max-Element/tags.md

@@ -0,0 +1,5 @@
+  ARRAY
+  DYNAMIC_PROGRAMMING
+  MATH
+  SORTING
+  GREEDY

apps/problems/Merge-Sorted-Arrays/tags.md

@@ -0,0 +1,7 @@
+  ARRAY
+  STRING
+  HASH_TABLE
+  DYNAMIC_PROGRAMMING
+  MATH
+  SORTING
+  GREEDY

apps/problems/Reverse-String/tags.md

@@ -0,0 +1,7 @@
+  ARRAY
+  STRING
+  HASH_TABLE
+  DYNAMIC_PROGRAMMING
+  MATH
+  SORTING
+  GREEDY

apps/problems/Software-Dev/tags.md

@@ -0,0 +1,7 @@
+  ARRAY
+  STRING
+  HASH_TABLE
+  DYNAMIC_PROGRAMMING
+  MATH
+  SORTING
+  GREEDY

apps/problems/Sort-Array/tags.md

@@ -0,0 +1,7 @@
+  ARRAY
+  STRING
+  HASH_TABLE
+  DYNAMIC_PROGRAMMING
+  MATH
+  SORTING
+  GREEDY

apps/problems/Two-Sum/tags.md

@@ -0,0 +1,4 @@
+  ARRAY
+  MATH
+  SORTING
+  GREEDY

packages/db/prisma/schema.prisma

@@ -64,6 +64,13 @@ model Problem {
   contests           ContestProblem[]
   submissions        Submission[]
   defaultCode        DefaultCode[]
+  tags               Tag[]             
+}
+
+model Tag {
+  id                  String    @id @default(cuid())
+  name                String    @unique
+  problems            Problem[] 
 }
 
 model DefaultCode {