diff --git a/docusaurus.config.js b/docusaurus.config.js
index 4888f5318..2b4554347 100644
--- a/docusaurus.config.js
+++ b/docusaurus.config.js
@@ -546,7 +546,7 @@ const config = {
id: "product",
path: "product",
routeBasePath: "product",
- sidebarPath: require.resolve("./sidebarsProduct.js"),
+ sidebarPath: require.resolve("./sidebarsCommunity.js"),
remarkPlugins: [remarkMath],
rehypePlugins: [rehypeKatex],
showLastUpdateAuthor: true,
@@ -562,7 +562,7 @@ const config = {
path: "web-dev",
routeBasePath: "web-dev",
// editUrl: "#",
- sidebarPath: require.resolve("./sidebarsWebDev.js"),
+ sidebarPath: require.resolve("./sidebarsCommunity.js"),
remarkPlugins: [[npm2yarn, { sync: true }], remarkMath, rehypeKatex],
showLastUpdateAuthor: true,
showLastUpdateTime: true,
@@ -591,7 +591,7 @@ const config = {
path: "dsa-solutions",
routeBasePath: "dsa-solutions",
editUrl: "#",
- sidebarPath: require.resolve("./sidebarsDSASolutions.js"),
+ sidebarPath: require.resolve("./sidebarsCommunity.js"),
remarkPlugins: [remarkMath],
rehypePlugins: [rehypeKatex],
showLastUpdateAuthor: true,
@@ -605,7 +605,7 @@ const config = {
id: "dsa-problems",
path: "dsa-problems",
routeBasePath: "dsa-problems",
- sidebarPath: require.resolve("./sidebarsDSAProblems.js"),
+ sidebarPath: require.resolve("./sidebarsCommunity.js"),
remarkPlugins: [remarkMath],
rehypePlugins: [rehypeKatex],
showLastUpdateAuthor: true,
diff --git a/dsa-problems/gfg-problems/easy/0601-0700.md b/dsa-problems/gfg-problems/easy/0601-0700.md
index 38f8aee61..293206d71 100644
--- a/dsa-problems/gfg-problems/easy/0601-0700.md
+++ b/dsa-problems/gfg-problems/easy/0601-0700.md
@@ -8,616 +8,614 @@ keywords:
- gfg problems problems
---
-
export const problems = [
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-possible-sum-of-products3637/1",
- "solutionLink": "#",
- "problemName": "Maximum Possible Sum of Products"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/exchange-the-leaf-nodes/1",
- "solutionLink": "#",
- "problemName": "Exchange the Leaf Nodes"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-exception-handling3103/1",
- "solutionLink": "#",
- "problemName": "C++ Exception Handling"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-the-pattern1025/1",
- "solutionLink": "#",
- "problemName": "Print the pattern"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/twisted-prime-number0500/1",
- "solutionLink": "#",
- "problemName": "Twisted Prime Number"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/unique-binary-tree-requirements/1",
- "solutionLink": "#",
- "problemName": "Unique Binary Tree Requirements"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/student-of-the-year/1",
- "solutionLink": "#",
- "problemName": "Student of the Year"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/multiply-by-111820/1",
- "solutionLink": "#",
- "problemName": "Multiply by 11"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-if-a-integer-is-power-of-8-or-not2537/1",
- "solutionLink": "#",
- "problemName": "Check if a Integer is power of 8 or not"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/crack-the-series0304/1",
- "solutionLink": "#",
- "problemName": "Crack the series"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/prime-number-of-set-bits4632/1",
- "solutionLink": "#",
- "problemName": "Prime number of set bits"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/hungry-pizza-lovers3148/1",
- "solutionLink": "#",
- "problemName": "Hungry Pizza Lovers"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/rearrange-an-array-such-that-arri-i3618/1",
- "solutionLink": "#",
- "problemName": "Rearrange an array such that arr[i] = i"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-matrix-rotation-by-180-degree0745/1",
- "solutionLink": "#",
- "problemName": "C++ Matrix Rotation by 180 degree"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-template/1",
- "solutionLink": "#",
- "problemName": "C++ Template"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-swaps-required-to-group-all-1s-together2451/1",
- "solutionLink": "#",
- "problemName": "Minimum Swaps required to group all 1s together"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/xor-of-a-given-range/1",
- "solutionLink": "#",
- "problemName": "XOR of a given range"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/good-pairs4519/1",
- "solutionLink": "#",
- "problemName": "Good Pairs"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/numbers-with-same-first-and-last-digit4228/1",
- "solutionLink": "#",
- "problemName": "Numbers with same first and last digit"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-collection-set-1-arraylist/1",
- "solutionLink": "#",
- "problemName": "Java Collection | Set 1 (ArrayList) Part-2"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/left-out-candies5652/1",
- "solutionLink": "#",
- "problemName": "Left out candies"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/pair-sum-existence/1",
- "solutionLink": "#",
- "problemName": "Pair Sum Existence"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/min-manipulations-to-make-strings-anagram1421/1",
- "solutionLink": "#",
- "problemName": "Min Manipulations to make Strings Anagram"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/generate-grey-code-sequences/1",
- "solutionLink": "#",
- "problemName": "Generate Grey Code Sequences"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/increasing-sub-sequence1712/1",
- "solutionLink": "#",
- "problemName": "Increasing Sub Sequence"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/dictionary-in-python-ii/1",
- "solutionLink": "#",
- "problemName": "Dictionary in Python - II"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/carry-counter0937/1",
- "solutionLink": "#",
- "problemName": "Carry counter"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/rearrange-linked-list-in-place/1",
- "solutionLink": "#",
- "problemName": "Rearrange linked list in-place"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-function-overloading-1587115620/1",
- "solutionLink": "#",
- "problemName": "C++ Function overloading"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/geek-and-his-tricky-series2207/1",
- "solutionLink": "#",
- "problemName": "Geek and his Tricky Series"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/huffman-decoding-1/1",
- "solutionLink": "#",
- "problemName": "Huffman Decoding-1"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/inverted-triangle-of-stars0110/1",
- "solutionLink": "#",
- "problemName": "Inverted triangle of stars"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/gadgets-of-doraland--141631/1",
- "solutionLink": "#",
- "problemName": "Gadgets of Doraland"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/mean-of-range-in-array2123/1",
- "solutionLink": "#",
- "problemName": "Mean of range in array"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/multiset-operations/1",
- "solutionLink": "#",
- "problemName": "Multiset Operations"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/postorder-traversal-from-given-inorder-and-preorder-traversals/1",
- "solutionLink": "#",
- "problemName": "Postorder traversal from given Inorder and Preorder traversals"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/bitonic-generator-sort3343/1",
- "solutionLink": "#",
- "problemName": "Bitonic Generator Sort"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/depth-of-node/1",
- "solutionLink": "#",
- "problemName": "Depth of node"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/outermost-parentheses/1",
- "solutionLink": "#",
- "problemName": "Outermost Parentheses"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/boundary-elements-of-matrix1102/1",
- "solutionLink": "#",
- "problemName": "Boundary Elements of Matrix"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-corresponding-position-in-the-two-strings-that-hold-exactly-the-same-characters5013/1",
- "solutionLink": "#",
- "problemName": "Same characters in two strings"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/rope-cutting3334/1",
- "solutionLink": "#",
- "problemName": "Rope Cutting"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/geek-and-his-binary-strings1951/1",
- "solutionLink": "#",
- "problemName": "Geek and his Binary Strings"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/faithful-numbers0014/1",
- "solutionLink": "#",
- "problemName": "Faithful Numbers"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/dictionary-in-python-iii/1",
- "solutionLink": "#",
- "problemName": "Dictionary in Python - III"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/amicable-pair0804/1",
- "solutionLink": "#",
- "problemName": "Amicable Pair"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-odd-factors0844/1",
- "solutionLink": "#",
- "problemName": "Count Odd Factors"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-if-a-given-string-is-a-rotation-of-a-palindrome0317/1",
- "solutionLink": "#",
- "problemName": "Check if a given string is a rotation of a palindrome"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/rotate-matrix-elements-clockwise2336/1",
- "solutionLink": "#",
- "problemName": "Rotate matrix elements clockwise"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/kth-distance3757/1",
- "solutionLink": "#",
- "problemName": "Kth distance"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/multimap-operations/1",
- "solutionLink": "#",
- "problemName": "Multimap Operations"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/consecutive-array-elements2711/1",
- "solutionLink": "#",
- "problemName": "Consecutive Array Elements"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/next-greater-even-number0828/1",
- "solutionLink": "#",
- "problemName": "Next Greater Even Number"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/missing-ranges-of-numbers1019/1",
- "solutionLink": "#",
- "problemName": "Missing ranges of numbers"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/assign-mice-holes3053/1",
- "solutionLink": "#",
- "problemName": "Assign Mice Holes"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-sum-of-divisors5636/1",
- "solutionLink": "#",
- "problemName": "Find sum of divisors "
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/ordering-of-strings5527/1",
- "solutionLink": "#",
- "problemName": "Ordering of strings"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/lucky-number0707/1",
- "solutionLink": "#",
- "problemName": "Lucky Number"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/cross-character2630/1",
- "solutionLink": "#",
- "problemName": "Cross character"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/string-modification-1587115621/1",
- "solutionLink": "#",
- "problemName": "String Modification"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-if-actual-binary-representation-of-a-number-is-palindrome0624/1",
- "solutionLink": "#",
- "problemName": "Check if actual binary representation of a number is palindrome"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/largest-zigzag-sequence5416/1",
- "solutionLink": "#",
- "problemName": "Largest zigzag sequence"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimal-moves-to-form-a-string4331/1",
- "solutionLink": "#",
- "problemName": "Minimal moves to form a string"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/happy-number1408/1",
- "solutionLink": "#",
- "problemName": "Happy Number"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/subtraction-and-two-numbers0816/1",
- "solutionLink": "#",
- "problemName": "Subtraction and two numbers"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/structs-and-objects/1",
- "solutionLink": "#",
- "problemName": "Structs and Objects"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/even-subsets/1",
- "solutionLink": "#",
- "problemName": "Even Subsets"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/magic-number4431/1",
- "solutionLink": "#",
- "problemName": "Magic Number"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-stl-priority-queue/1",
- "solutionLink": "#",
- "problemName": "C++ STL Priority Queue"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-most-frequent-digit4432/1",
- "solutionLink": "#",
- "problemName": "Find the most frequent digit"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-maximum-value/1",
- "solutionLink": "#",
- "problemName": "Find Maximum value"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/swap-bits5726/1",
- "solutionLink": "#",
- "problemName": "Swap bits"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/product-of-prime-factors5121/1",
- "solutionLink": "#",
- "problemName": "Product of Prime Factors"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/kth-prime-factor-of-a-number0132/1",
- "solutionLink": "#",
- "problemName": "Kth Prime Factor"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/xor-linked-list/1",
- "solutionLink": "#",
- "problemName": "XOR Linked List"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/triangle-and-square--170637/1",
- "solutionLink": "#",
- "problemName": "Triangle and Square"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-number-of-characters-between-any-two-same-character4552/1",
- "solutionLink": "#",
- "problemName": "Maximum number of characters between any two same character"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-this-pattern0709/1",
- "solutionLink": "#",
- "problemName": "Print this pattern!"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/distinct-substrings2516/1",
- "solutionLink": "#",
- "problemName": "Distinct Substrings"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-multi-level-inheritance/1",
- "solutionLink": "#",
- "problemName": "C++ Multi-level inheritance"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/adding-one2529/1",
- "solutionLink": "#",
- "problemName": "Adding One"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/remove-minimum-elements4612/1",
- "solutionLink": "#",
- "problemName": "Remove minimum elements"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/partition-a-number-into-two-divisible-parts3605/1",
- "solutionLink": "#",
- "problemName": "Partition a number into two divisible parts"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/does-robot-moves-circular0414/1",
- "solutionLink": "#",
- "problemName": "Does robot moves circular"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-number-of-deletions-to-make-a-sorted-sequence3248/1",
- "solutionLink": "#",
- "problemName": "Minimum number of deletions to make a sorted sequence"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-sum-of-increasing-order-elements-from-n-arrays4848/1",
- "solutionLink": "#",
- "problemName": "Maximum sum of increasing order elements from n arrays"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/number-that-are-not-divisible4541/1",
- "solutionLink": "#",
- "problemName": "Number that are not divisible"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/deficient-number1612/1",
- "solutionLink": "#",
- "problemName": "Deficient Number"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-distinct-ids3251/1",
- "solutionLink": "#",
- "problemName": "Minimum Distinct Ids"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/k-ary-tree1235/1",
- "solutionLink": "#",
- "problemName": "K-Ary Tree"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-highest-occurring-digit-in-prime-numbers-in-a-range3634/1",
- "solutionLink": "#",
- "problemName": "Find the highest occurring digit in prime numbers in a range"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-stl-set-2-pair/1",
- "solutionLink": "#",
- "problemName": "C++ STL | Set 2 (pair)"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/largest-even-number3821/1",
- "solutionLink": "#",
- "problemName": "Largest Even Number"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/pair-with-greatest-product-in-array3342/1",
- "solutionLink": "#",
- "problemName": "Pair with greatest product in array"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/chocolate-station2951/1",
- "solutionLink": "#",
- "problemName": "Chocolate Station"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/regular-expressions-2-python/1",
- "solutionLink": "#",
- "problemName": "Regular Expressions 2 - Python"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-all-possible-paths-from-top-to-bottom/1",
- "solutionLink": "#",
- "problemName": "Find all possible paths from top to bottom"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-maximum-number2152/1",
- "solutionLink": "#",
- "problemName": "Find maximum number"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/binary-tree-representation/1",
- "solutionLink": "#",
- "problemName": "Binary Tree Representation"
- },
- {
- "difficulty": "Easy",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-digits-in-a-factorial3957/1",
- "solutionLink": "#",
- "problemName": "Count digits in a factorial"
- }
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/maximum-possible-sum-of-products3637/1",
+"solutionLink": "#",
+"problemName": "Maximum Possible Sum of Products"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/exchange-the-leaf-nodes/1",
+"solutionLink": "#",
+"problemName": "Exchange the Leaf Nodes"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/c-exception-handling3103/1",
+"solutionLink": "#",
+"problemName": "C++ Exception Handling"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/print-the-pattern1025/1",
+"solutionLink": "#",
+"problemName": "Print the pattern"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/twisted-prime-number0500/1",
+"solutionLink": "#",
+"problemName": "Twisted Prime Number"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/unique-binary-tree-requirements/1",
+"solutionLink": "#",
+"problemName": "Unique Binary Tree Requirements"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/student-of-the-year/1",
+"solutionLink": "#",
+"problemName": "Student of the Year"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/multiply-by-111820/1",
+"solutionLink": "#",
+"problemName": "Multiply by 11"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/check-if-a-integer-is-power-of-8-or-not2537/1",
+"solutionLink": "#",
+"problemName": "Check if a Integer is power of 8 or not"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/crack-the-series0304/1",
+"solutionLink": "#",
+"problemName": "Crack the series"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/prime-number-of-set-bits4632/1",
+"solutionLink": "#",
+"problemName": "Prime number of set bits"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/hungry-pizza-lovers3148/1",
+"solutionLink": "#",
+"problemName": "Hungry Pizza Lovers"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/rearrange-an-array-such-that-arri-i3618/1",
+"solutionLink": "#",
+"problemName": "Rearrange an array such that arr[i] = i"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/c-matrix-rotation-by-180-degree0745/1",
+"solutionLink": "#",
+"problemName": "C++ Matrix Rotation by 180 degree"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/c-template/1",
+"solutionLink": "#",
+"problemName": "C++ Template"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/minimum-swaps-required-to-group-all-1s-together2451/1",
+"solutionLink": "#",
+"problemName": "Minimum Swaps required to group all 1s together"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/xor-of-a-given-range/1",
+"solutionLink": "#",
+"problemName": "XOR of a given range"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/good-pairs4519/1",
+"solutionLink": "#",
+"problemName": "Good Pairs"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/numbers-with-same-first-and-last-digit4228/1",
+"solutionLink": "#",
+"problemName": "Numbers with same first and last digit"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/java-collection-set-1-arraylist/1",
+"solutionLink": "#",
+"problemName": "Java Collection | Set 1 (ArrayList) Part-2"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/left-out-candies5652/1",
+"solutionLink": "#",
+"problemName": "Left out candies"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/pair-sum-existence/1",
+"solutionLink": "#",
+"problemName": "Pair Sum Existence"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/min-manipulations-to-make-strings-anagram1421/1",
+"solutionLink": "#",
+"problemName": "Min Manipulations to make Strings Anagram"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/generate-grey-code-sequences/1",
+"solutionLink": "#",
+"problemName": "Generate Grey Code Sequences"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/increasing-sub-sequence1712/1",
+"solutionLink": "#",
+"problemName": "Increasing Sub Sequence"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/dictionary-in-python-ii/1",
+"solutionLink": "#",
+"problemName": "Dictionary in Python - II"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/carry-counter0937/1",
+"solutionLink": "#",
+"problemName": "Carry counter"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/rearrange-linked-list-in-place/1",
+"solutionLink": "#",
+"problemName": "Rearrange linked list in-place"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/c-function-overloading-1587115620/1",
+"solutionLink": "#",
+"problemName": "C++ Function overloading"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/geek-and-his-tricky-series2207/1",
+"solutionLink": "#",
+"problemName": "Geek and his Tricky Series"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/huffman-decoding-1/1",
+"solutionLink": "#",
+"problemName": "Huffman Decoding-1"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/inverted-triangle-of-stars0110/1",
+"solutionLink": "#",
+"problemName": "Inverted triangle of stars"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/gadgets-of-doraland--141631/1",
+"solutionLink": "#",
+"problemName": "Gadgets of Doraland"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/mean-of-range-in-array2123/1",
+"solutionLink": "#",
+"problemName": "Mean of range in array"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/multiset-operations/1",
+"solutionLink": "#",
+"problemName": "Multiset Operations"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/postorder-traversal-from-given-inorder-and-preorder-traversals/1",
+"solutionLink": "#",
+"problemName": "Postorder traversal from given Inorder and Preorder traversals"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/bitonic-generator-sort3343/1",
+"solutionLink": "#",
+"problemName": "Bitonic Generator Sort"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/depth-of-node/1",
+"solutionLink": "#",
+"problemName": "Depth of node"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/outermost-parentheses/1",
+"solutionLink": "#",
+"problemName": "Outermost Parentheses"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/boundary-elements-of-matrix1102/1",
+"solutionLink": "#",
+"problemName": "Boundary Elements of Matrix"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/c-corresponding-position-in-the-two-strings-that-hold-exactly-the-same-characters5013/1",
+"solutionLink": "#",
+"problemName": "Same characters in two strings"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/rope-cutting3334/1",
+"solutionLink": "#",
+"problemName": "Rope Cutting"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/geek-and-his-binary-strings1951/1",
+"solutionLink": "#",
+"problemName": "Geek and his Binary Strings"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/faithful-numbers0014/1",
+"solutionLink": "#",
+"problemName": "Faithful Numbers"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/dictionary-in-python-iii/1",
+"solutionLink": "#",
+"problemName": "Dictionary in Python - III"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/amicable-pair0804/1",
+"solutionLink": "#",
+"problemName": "Amicable Pair"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/count-odd-factors0844/1",
+"solutionLink": "#",
+"problemName": "Count Odd Factors"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/check-if-a-given-string-is-a-rotation-of-a-palindrome0317/1",
+"solutionLink": "#",
+"problemName": "Check if a given string is a rotation of a palindrome"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/rotate-matrix-elements-clockwise2336/1",
+"solutionLink": "#",
+"problemName": "Rotate matrix elements clockwise"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/kth-distance3757/1",
+"solutionLink": "#",
+"problemName": "Kth distance"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/multimap-operations/1",
+"solutionLink": "#",
+"problemName": "Multimap Operations"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/consecutive-array-elements2711/1",
+"solutionLink": "#",
+"problemName": "Consecutive Array Elements"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/next-greater-even-number0828/1",
+"solutionLink": "#",
+"problemName": "Next Greater Even Number"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/missing-ranges-of-numbers1019/1",
+"solutionLink": "#",
+"problemName": "Missing ranges of numbers"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/assign-mice-holes3053/1",
+"solutionLink": "#",
+"problemName": "Assign Mice Holes"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-sum-of-divisors5636/1",
+"solutionLink": "#",
+"problemName": "Find sum of divisors "
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/ordering-of-strings5527/1",
+"solutionLink": "#",
+"problemName": "Ordering of strings"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/lucky-number0707/1",
+"solutionLink": "#",
+"problemName": "Lucky Number"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/cross-character2630/1",
+"solutionLink": "#",
+"problemName": "Cross character"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/string-modification-1587115621/1",
+"solutionLink": "#",
+"problemName": "String Modification"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/check-if-actual-binary-representation-of-a-number-is-palindrome0624/1",
+"solutionLink": "#",
+"problemName": "Check if actual binary representation of a number is palindrome"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/largest-zigzag-sequence5416/1",
+"solutionLink": "#",
+"problemName": "Largest zigzag sequence"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/minimal-moves-to-form-a-string4331/1",
+"solutionLink": "#",
+"problemName": "Minimal moves to form a string"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/happy-number1408/1",
+"solutionLink": "#",
+"problemName": "Happy Number"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/subtraction-and-two-numbers0816/1",
+"solutionLink": "#",
+"problemName": "Subtraction and two numbers"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/structs-and-objects/1",
+"solutionLink": "#",
+"problemName": "Structs and Objects"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/even-subsets/1",
+"solutionLink": "#",
+"problemName": "Even Subsets"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/magic-number4431/1",
+"solutionLink": "#",
+"problemName": "Magic Number"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/c-stl-priority-queue/1",
+"solutionLink": "#",
+"problemName": "C++ STL Priority Queue"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-the-most-frequent-digit4432/1",
+"solutionLink": "#",
+"problemName": "Find the most frequent digit"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-maximum-value/1",
+"solutionLink": "#",
+"problemName": "Find Maximum value"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/swap-bits5726/1",
+"solutionLink": "#",
+"problemName": "Swap bits"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/product-of-prime-factors5121/1",
+"solutionLink": "#",
+"problemName": "Product of Prime Factors"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/kth-prime-factor-of-a-number0132/1",
+"solutionLink": "#",
+"problemName": "Kth Prime Factor"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/xor-linked-list/1",
+"solutionLink": "#",
+"problemName": "XOR Linked List"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/triangle-and-square--170637/1",
+"solutionLink": "#",
+"problemName": "Triangle and Square"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/maximum-number-of-characters-between-any-two-same-character4552/1",
+"solutionLink": "#",
+"problemName": "Maximum number of characters between any two same character"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/print-this-pattern0709/1",
+"solutionLink": "#",
+"problemName": "Print this pattern!"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/distinct-substrings2516/1",
+"solutionLink": "#",
+"problemName": "Distinct Substrings"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/c-multi-level-inheritance/1",
+"solutionLink": "#",
+"problemName": "C++ Multi-level inheritance"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/adding-one2529/1",
+"solutionLink": "#",
+"problemName": "Adding One"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/remove-minimum-elements4612/1",
+"solutionLink": "#",
+"problemName": "Remove minimum elements"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/partition-a-number-into-two-divisible-parts3605/1",
+"solutionLink": "#",
+"problemName": "Partition a number into two divisible parts"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/does-robot-moves-circular0414/1",
+"solutionLink": "#",
+"problemName": "Does robot moves circular"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/minimum-number-of-deletions-to-make-a-sorted-sequence3248/1",
+"solutionLink": "#",
+"problemName": "Minimum number of deletions to make a sorted sequence"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/maximum-sum-of-increasing-order-elements-from-n-arrays4848/1",
+"solutionLink": "#",
+"problemName": "Maximum sum of increasing order elements from n arrays"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/number-that-are-not-divisible4541/1",
+"solutionLink": "#",
+"problemName": "Number that are not divisible"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/deficient-number1612/1",
+"solutionLink": "#",
+"problemName": "Deficient Number"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/minimum-distinct-ids3251/1",
+"solutionLink": "#",
+"problemName": "Minimum Distinct Ids"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/k-ary-tree1235/1",
+"solutionLink": "#",
+"problemName": "K-Ary Tree"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-the-highest-occurring-digit-in-prime-numbers-in-a-range3634/1",
+"solutionLink": "#",
+"problemName": "Find the highest occurring digit in prime numbers in a range"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/c-stl-set-2-pair/1",
+"solutionLink": "#",
+"problemName": "C++ STL | Set 2 (pair)"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/largest-even-number3821/1",
+"solutionLink": "#",
+"problemName": "Largest Even Number"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/pair-with-greatest-product-in-array3342/1",
+"solutionLink": "#",
+"problemName": "Pair with greatest product in array"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/chocolate-station2951/1",
+"solutionLink": "#",
+"problemName": "Chocolate Station"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/regular-expressions-2-python/1",
+"solutionLink": "#",
+"problemName": "Regular Expressions 2 - Python"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-all-possible-paths-from-top-to-bottom/1",
+"solutionLink": "#",
+"problemName": "Find all possible paths from top to bottom"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-maximum-number2152/1",
+"solutionLink": "#",
+"problemName": "Find maximum number"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/binary-tree-representation/1",
+"solutionLink": "#",
+"problemName": "Binary Tree Representation"
+},
+{
+"difficulty": "Easy",
+"gfgLink": "https://www.geeksforgeeks.org/problems/count-digits-in-a-factorial3957/1",
+"solutionLink": "#",
+"problemName": "Count digits in a factorial"
+}
]
-
-
-Now, you can see the list of problems in a table format. You can click on the problem link to view the problem on the GeeksforGeeks website. You can also click on the solution link to view the solution of the problem.
\ No newline at end of file
+Now, you can see the list of problems in a table format. You can click on the problem link to view the problem on the GeeksforGeeks website. You can also click on the solution link to view the solution of the problem.
diff --git a/dsa-problems/gfg-problems/medium/0501-0600.md b/dsa-problems/gfg-problems/medium/0501-0600.md
index dd936207f..afb1b9c03 100644
--- a/dsa-problems/gfg-problems/medium/0501-0600.md
+++ b/dsa-problems/gfg-problems/medium/0501-0600.md
@@ -8,615 +8,614 @@ keywords:
- gfg problems problems
---
-
export const problems = [
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-possible-value--170647/1",
- "solutionLink": "#",
- "problemName": "Maximum Possible Value"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/geeks-and-the-string--170645/1",
- "solutionLink": "#",
- "problemName": "Geeks And The String"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/carpet-into-box--170645/1",
- "solutionLink": "#",
- "problemName": "Carpet into Box"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/max-sum-without-adjacents--170645/1",
- "solutionLink": "#",
- "problemName": "Max Sum without Adjacents"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-sum-leaf-to-root-path/1",
- "solutionLink": "#",
- "problemName": "Maximum sum leaf to root path"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimize-number-of-students-to-be-removed--170645/1",
- "solutionLink": "#",
- "problemName": "Minimize number of Students to be removed"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/tree-transformation--170648/1",
- "solutionLink": "#",
- "problemName": "Tree Transformation"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/divisibility-tree1902/1",
- "solutionLink": "#",
- "problemName": "Divisibility tree"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/shortest-xy-distance-in-grid--170647/1",
- "solutionLink": "#",
- "problemName": "Shortest XY distance in Grid"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/spiral-matrix--141631/1",
- "solutionLink": "#",
- "problemName": "Spiral Matrix"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/apple-sequences--170646/1",
- "solutionLink": "#",
- "problemName": "Apple Sequences"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/unequal-arrays--170647/1",
- "solutionLink": "#",
- "problemName": "Unequal Arrays"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/division-without-using-multiplication-division-and-mod-operator/1",
- "solutionLink": "#",
- "problemName": "Division without using multiplication, division and mod operator"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/even-swap/1",
- "solutionLink": "#",
- "problemName": "Even Swap"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/save-your-life4601/1",
- "solutionLink": "#",
- "problemName": "Save Your Life"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-number--170647/1",
- "solutionLink": "#",
- "problemName": "Find Number"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-number-of-deletions4610/1",
- "solutionLink": "#",
- "problemName": "Minimum number of deletions."
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/possible-paths3834/1",
- "solutionLink": "#",
- "problemName": "Possible paths"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/absolute-difference-divisible-by-k/1",
- "solutionLink": "#",
- "problemName": "Absolute difference divisible by K"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-cyclic-paths--170647/1",
- "solutionLink": "#",
- "problemName": "Count Cyclic Paths"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/geeks-village-and-wells--170647/1",
- "solutionLink": "#",
- "problemName": "Geek's Village and Wells"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/bst-downward-traversal--170646/1",
- "solutionLink": "#",
- "problemName": "BST Downward Traversal"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/champagne-overflow2636/1",
- "solutionLink": "#",
- "problemName": "Water Overflow"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/stepping-numberswrong-output1813/1",
- "solutionLink": "#",
- "problemName": "Stepping Numbers"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/police-and-thieves--141631/1",
- "solutionLink": "#",
- "problemName": "Police and Thieves"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/job-sequencing-problem--170647/1",
- "solutionLink": "#",
- "problemName": "Job Sequencing Problem"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-leaf-nodes-from-preorder-traversal-of-bst2657/1",
- "solutionLink": "#",
- "problemName": "Print leaf nodes from preorder traversal of BST"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-days--170646/1",
- "solutionLink": "#",
- "problemName": "Minimum Days"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/substrings-of-length-k-with-k-1-distinct-elements/1",
- "solutionLink": "#",
- "problemName": "Substrings of length k with k-1 distinct elements"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/modify-linked-list-1-0546/1",
- "solutionLink": "#",
- "problemName": "Modify Linked List-1"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-distinct-elements2054/1",
- "solutionLink": "#",
- "problemName": "Find distinct elements"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-patterns0606/1",
- "solutionLink": "#",
- "problemName": "Find patterns"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/update-queries--170647/1",
- "solutionLink": "#",
- "problemName": "Update Queries"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/fruit-into-baskets-1663137462/1",
- "solutionLink": "#",
- "problemName": "Fruit Into Baskets"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/palindrome-with-minimum-sum--170648/1",
- "solutionLink": "#",
- "problemName": "Palindrome with minimum sum"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/expression-contains-redundant-bracket-or-not/1",
- "solutionLink": "#",
- "problemName": "Expression contains redundant bracket or not"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximize-the-sum-of-selected-numbers-from-an-array-to-make-it-empty0836/1",
- "solutionLink": "#",
- "problemName": "Maximize the sum of selected numbers from a sorted array to make it empty"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimal-cost/1",
- "solutionLink": "#",
- "problemName": "Minimal Cost"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-prime4751/1",
- "solutionLink": "#",
- "problemName": "Sum Of Prime"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/coin-piles5152/1",
- "solutionLink": "#",
- "problemName": "Coin Piles"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-minimum-number-of-laptops-required--170645/1",
- "solutionLink": "#",
- "problemName": "Find minimum number of Laptops required"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/good-stones--170647/1",
- "solutionLink": "#",
- "problemName": "Good Stones"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/distinct-difference--170647/1",
- "solutionLink": "#",
- "problemName": "Distinct Difference"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/form-a-palindrome2544/1",
- "solutionLink": "#",
- "problemName": "Form a palindrome"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/transfiguration--141631/1",
- "solutionLink": "#",
- "problemName": "Transfiguration"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/a-difference-of-values-and-indexes0302/1",
- "solutionLink": "#",
- "problemName": "A difference of values and indexes"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-if-all-levels-of-two-trees-are-anagrams-or-not/1",
- "solutionLink": "#",
- "problemName": "Check if all levels of two trees are anagrams or not"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-intervals-overlap5708/1",
- "solutionLink": "#",
- "problemName": "Maximum Intervals Overlap"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/clone-a-binary-tree/1",
- "solutionLink": "#",
- "problemName": "Clone a Binary Tree"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/flattening-a-linked-list--170645/1",
- "solutionLink": "#",
- "problemName": "Flattening a Linked List"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/fibonacci-sum1423/1",
- "solutionLink": "#",
- "problemName": "Fibonacci Sum"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/max-sum-subarray-by-removing-at-most-one-element/1",
- "solutionLink": "#",
- "problemName": "Max sum subarray by removing at most one element"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/bheem-wants-ladoos--170647/1",
- "solutionLink": "#",
- "problemName": "Bheem Wants Ladoos"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/kth-smallest-factor2345/1",
- "solutionLink": "#",
- "problemName": "Kth Smallest Factor"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-all-distinct-subset-or-subsequence-sums4424/1",
- "solutionLink": "#",
- "problemName": "Find all distinct subset (or subsequence) sums"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-k-th-character-in-string3841/1",
- "solutionLink": "#",
- "problemName": "Find k-th character in string"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/length-of-longest-palindrome-in-linked-list/1",
- "solutionLink": "#",
- "problemName": "Length of longest palindrome in linked list"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/construct-tree-from-preorder-traversal/1",
- "solutionLink": "#",
- "problemName": "Construct Tree from Preorder Traversal"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/convert-level-order-traversal-to-bst/1",
- "solutionLink": "#",
- "problemName": "Convert Level Order Traversal to BST"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/construct-binary-tree-from-string-with-bracket-representation/1",
- "solutionLink": "#",
- "problemName": "Construct Binary Tree from String with bracket representation"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/super-primes2443/1",
- "solutionLink": "#",
- "problemName": "Super Primes"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/bst-to-max-heap/1",
- "solutionLink": "#",
- "problemName": "BST to max heap"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/geek-hates-too-many-1s--170647/1",
- "solutionLink": "#",
- "problemName": "Geek hates too many 1s"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/capacity-to-ship-packages-within-d-days/1",
- "solutionLink": "#",
- "problemName": "Capacity To Ship Packages Within D Days"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-subarrays2229/1",
- "solutionLink": "#",
- "problemName": "Sum of Subarrays"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-of-sum-of-consecutives3741/1",
- "solutionLink": "#",
- "problemName": "Count of sum of consecutives"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/walls-coloring--170646/1",
- "solutionLink": "#",
- "problemName": "Walls Coloring"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/valid-expression1025/1",
- "solutionLink": "#",
- "problemName": "Valid Expression"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/missing-number-in-matrix5316/1",
- "solutionLink": "#",
- "problemName": "Missing number in matrix"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/search-in-rotated-array-2/1",
- "solutionLink": "#",
- "problemName": "Search in Rotated Array 2"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/connect-nodes-at-same-level--170647/1",
- "solutionLink": "#",
- "problemName": "Connect Nodes at Same Level"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/fill-the-matrix--170647/1",
- "solutionLink": "#",
- "problemName": "Fill the Matrix"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-beauty-of-all-substrings-1662962118/1",
- "solutionLink": "#",
- "problemName": "Sum of Beauty of All Substrings"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/pots-of-gold-game/1",
- "solutionLink": "#",
- "problemName": "Pots of Gold Game"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/akku-and-binary-numbers0902/1",
- "solutionLink": "#",
- "problemName": "Akku and Binary Numbers"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/good-subtrees--170647/1",
- "solutionLink": "#",
- "problemName": "Good Subtrees"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/construct-a-full-binary-tree--170648/1",
- "solutionLink": "#",
- "problemName": "Construct a Full Binary Tree"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/close-to-perfection1525/1",
- "solutionLink": "#",
- "problemName": "Longest Perfect Piece"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/valid-pair-sum--141631/1",
- "solutionLink": "#",
- "problemName": "Valid Pair Sum"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/save-gotham1222/1",
- "solutionLink": "#",
- "problemName": "Save Gotham!"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-longest-string--170645/1",
- "solutionLink": "#",
- "problemName": "Find the longest string"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/lcm-triplet1501/1",
- "solutionLink": "#",
- "problemName": "LCM Triplet"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-largest-word-in-dictionary2430/1",
- "solutionLink": "#",
- "problemName": "Find largest word in dictionary"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/ways-to-write-n-as-sum-1587115621/1",
- "solutionLink": "#",
- "problemName": "Ways to write n as sum"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/tic-tac-toe2412/1",
- "solutionLink": "#",
- "problemName": "Tic Tac Toe"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/complement3911/1",
- "solutionLink": "#",
- "problemName": "Complement"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/handshakes1303/1",
- "solutionLink": "#",
- "problemName": "Handshakes"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/yet-another-query-problem--170647/1",
- "solutionLink": "#",
- "problemName": "Yet another query problem"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-x-xor-a--170645/1",
- "solutionLink": "#",
- "problemName": "Minimum X (xor) A"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/fill-up-buckets3500/1",
- "solutionLink": "#",
- "problemName": "Fill up buckets"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/special-palindrome-substrings--170647/1",
- "solutionLink": "#",
- "problemName": "Special Palindrome Substrings"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/quick-sort-on-linked-list/1",
- "solutionLink": "#",
- "problemName": "Quick Sort on Linked List"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/mila-and-strings0435/1",
- "solutionLink": "#",
- "problemName": "Lexicographically smallest string"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/build-the-smallest2841/1",
- "solutionLink": "#",
- "problemName": "Build the smallest"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/cat-and-hat-python/1",
- "solutionLink": "#",
- "problemName": "Cat and Hat"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/single-valued-subtree/1",
- "solutionLink": "#",
- "problemName": "Single valued subtree"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/knight-in-geekland--170647/1",
- "solutionLink": "#",
- "problemName": "Knight in Geekland"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/optimal-array--170647/1",
- "solutionLink": "#",
- "problemName": "Optimal Array"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-all-possible-palindromic-partitions-of-a-string/1",
- "solutionLink": "#",
- "problemName": "Find all possible palindromic partitions of a String"
- },
- {
- "difficulty": "Medium",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/merging-details/1",
- "solutionLink": "#",
- "problemName": "Merging Details"
- }
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/maximum-possible-value--170647/1",
+"solutionLink": "#",
+"problemName": "Maximum Possible Value"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/geeks-and-the-string--170645/1",
+"solutionLink": "#",
+"problemName": "Geeks And The String"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/carpet-into-box--170645/1",
+"solutionLink": "#",
+"problemName": "Carpet into Box"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/max-sum-without-adjacents--170645/1",
+"solutionLink": "#",
+"problemName": "Max Sum without Adjacents"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/maximum-sum-leaf-to-root-path/1",
+"solutionLink": "#",
+"problemName": "Maximum sum leaf to root path"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/minimize-number-of-students-to-be-removed--170645/1",
+"solutionLink": "#",
+"problemName": "Minimize number of Students to be removed"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/tree-transformation--170648/1",
+"solutionLink": "#",
+"problemName": "Tree Transformation"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/divisibility-tree1902/1",
+"solutionLink": "#",
+"problemName": "Divisibility tree"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/shortest-xy-distance-in-grid--170647/1",
+"solutionLink": "#",
+"problemName": "Shortest XY distance in Grid"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/spiral-matrix--141631/1",
+"solutionLink": "#",
+"problemName": "Spiral Matrix"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/apple-sequences--170646/1",
+"solutionLink": "#",
+"problemName": "Apple Sequences"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/unequal-arrays--170647/1",
+"solutionLink": "#",
+"problemName": "Unequal Arrays"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/division-without-using-multiplication-division-and-mod-operator/1",
+"solutionLink": "#",
+"problemName": "Division without using multiplication, division and mod operator"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/even-swap/1",
+"solutionLink": "#",
+"problemName": "Even Swap"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/save-your-life4601/1",
+"solutionLink": "#",
+"problemName": "Save Your Life"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-number--170647/1",
+"solutionLink": "#",
+"problemName": "Find Number"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/minimum-number-of-deletions4610/1",
+"solutionLink": "#",
+"problemName": "Minimum number of deletions."
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/possible-paths3834/1",
+"solutionLink": "#",
+"problemName": "Possible paths"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/absolute-difference-divisible-by-k/1",
+"solutionLink": "#",
+"problemName": "Absolute difference divisible by K"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/count-cyclic-paths--170647/1",
+"solutionLink": "#",
+"problemName": "Count Cyclic Paths"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/geeks-village-and-wells--170647/1",
+"solutionLink": "#",
+"problemName": "Geek's Village and Wells"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/bst-downward-traversal--170646/1",
+"solutionLink": "#",
+"problemName": "BST Downward Traversal"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/champagne-overflow2636/1",
+"solutionLink": "#",
+"problemName": "Water Overflow"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/stepping-numberswrong-output1813/1",
+"solutionLink": "#",
+"problemName": "Stepping Numbers"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/police-and-thieves--141631/1",
+"solutionLink": "#",
+"problemName": "Police and Thieves"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/job-sequencing-problem--170647/1",
+"solutionLink": "#",
+"problemName": "Job Sequencing Problem"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/print-leaf-nodes-from-preorder-traversal-of-bst2657/1",
+"solutionLink": "#",
+"problemName": "Print leaf nodes from preorder traversal of BST"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/minimum-days--170646/1",
+"solutionLink": "#",
+"problemName": "Minimum Days"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/substrings-of-length-k-with-k-1-distinct-elements/1",
+"solutionLink": "#",
+"problemName": "Substrings of length k with k-1 distinct elements"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/modify-linked-list-1-0546/1",
+"solutionLink": "#",
+"problemName": "Modify Linked List-1"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-distinct-elements2054/1",
+"solutionLink": "#",
+"problemName": "Find distinct elements"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-patterns0606/1",
+"solutionLink": "#",
+"problemName": "Find patterns"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/update-queries--170647/1",
+"solutionLink": "#",
+"problemName": "Update Queries"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/fruit-into-baskets-1663137462/1",
+"solutionLink": "#",
+"problemName": "Fruit Into Baskets"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/palindrome-with-minimum-sum--170648/1",
+"solutionLink": "#",
+"problemName": "Palindrome with minimum sum"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/expression-contains-redundant-bracket-or-not/1",
+"solutionLink": "#",
+"problemName": "Expression contains redundant bracket or not"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/maximize-the-sum-of-selected-numbers-from-an-array-to-make-it-empty0836/1",
+"solutionLink": "#",
+"problemName": "Maximize the sum of selected numbers from a sorted array to make it empty"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/minimal-cost/1",
+"solutionLink": "#",
+"problemName": "Minimal Cost"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/sum-of-prime4751/1",
+"solutionLink": "#",
+"problemName": "Sum Of Prime"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/coin-piles5152/1",
+"solutionLink": "#",
+"problemName": "Coin Piles"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-minimum-number-of-laptops-required--170645/1",
+"solutionLink": "#",
+"problemName": "Find minimum number of Laptops required"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/good-stones--170647/1",
+"solutionLink": "#",
+"problemName": "Good Stones"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/distinct-difference--170647/1",
+"solutionLink": "#",
+"problemName": "Distinct Difference"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/form-a-palindrome2544/1",
+"solutionLink": "#",
+"problemName": "Form a palindrome"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/transfiguration--141631/1",
+"solutionLink": "#",
+"problemName": "Transfiguration"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/a-difference-of-values-and-indexes0302/1",
+"solutionLink": "#",
+"problemName": "A difference of values and indexes"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/check-if-all-levels-of-two-trees-are-anagrams-or-not/1",
+"solutionLink": "#",
+"problemName": "Check if all levels of two trees are anagrams or not"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/maximum-intervals-overlap5708/1",
+"solutionLink": "#",
+"problemName": "Maximum Intervals Overlap"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/clone-a-binary-tree/1",
+"solutionLink": "#",
+"problemName": "Clone a Binary Tree"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/flattening-a-linked-list--170645/1",
+"solutionLink": "#",
+"problemName": "Flattening a Linked List"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/fibonacci-sum1423/1",
+"solutionLink": "#",
+"problemName": "Fibonacci Sum"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/max-sum-subarray-by-removing-at-most-one-element/1",
+"solutionLink": "#",
+"problemName": "Max sum subarray by removing at most one element"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/bheem-wants-ladoos--170647/1",
+"solutionLink": "#",
+"problemName": "Bheem Wants Ladoos"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/kth-smallest-factor2345/1",
+"solutionLink": "#",
+"problemName": "Kth Smallest Factor"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-all-distinct-subset-or-subsequence-sums4424/1",
+"solutionLink": "#",
+"problemName": "Find all distinct subset (or subsequence) sums"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-k-th-character-in-string3841/1",
+"solutionLink": "#",
+"problemName": "Find k-th character in string"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/length-of-longest-palindrome-in-linked-list/1",
+"solutionLink": "#",
+"problemName": "Length of longest palindrome in linked list"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/construct-tree-from-preorder-traversal/1",
+"solutionLink": "#",
+"problemName": "Construct Tree from Preorder Traversal"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/convert-level-order-traversal-to-bst/1",
+"solutionLink": "#",
+"problemName": "Convert Level Order Traversal to BST"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/construct-binary-tree-from-string-with-bracket-representation/1",
+"solutionLink": "#",
+"problemName": "Construct Binary Tree from String with bracket representation"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/super-primes2443/1",
+"solutionLink": "#",
+"problemName": "Super Primes"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/bst-to-max-heap/1",
+"solutionLink": "#",
+"problemName": "BST to max heap"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/geek-hates-too-many-1s--170647/1",
+"solutionLink": "#",
+"problemName": "Geek hates too many 1s"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/capacity-to-ship-packages-within-d-days/1",
+"solutionLink": "#",
+"problemName": "Capacity To Ship Packages Within D Days"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/sum-of-subarrays2229/1",
+"solutionLink": "#",
+"problemName": "Sum of Subarrays"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/count-of-sum-of-consecutives3741/1",
+"solutionLink": "#",
+"problemName": "Count of sum of consecutives"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/walls-coloring--170646/1",
+"solutionLink": "#",
+"problemName": "Walls Coloring"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/valid-expression1025/1",
+"solutionLink": "#",
+"problemName": "Valid Expression"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/missing-number-in-matrix5316/1",
+"solutionLink": "#",
+"problemName": "Missing number in matrix"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/search-in-rotated-array-2/1",
+"solutionLink": "#",
+"problemName": "Search in Rotated Array 2"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/connect-nodes-at-same-level--170647/1",
+"solutionLink": "#",
+"problemName": "Connect Nodes at Same Level"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/fill-the-matrix--170647/1",
+"solutionLink": "#",
+"problemName": "Fill the Matrix"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/sum-of-beauty-of-all-substrings-1662962118/1",
+"solutionLink": "#",
+"problemName": "Sum of Beauty of All Substrings"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/pots-of-gold-game/1",
+"solutionLink": "#",
+"problemName": "Pots of Gold Game"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/akku-and-binary-numbers0902/1",
+"solutionLink": "#",
+"problemName": "Akku and Binary Numbers"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/good-subtrees--170647/1",
+"solutionLink": "#",
+"problemName": "Good Subtrees"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/construct-a-full-binary-tree--170648/1",
+"solutionLink": "#",
+"problemName": "Construct a Full Binary Tree"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/close-to-perfection1525/1",
+"solutionLink": "#",
+"problemName": "Longest Perfect Piece"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/valid-pair-sum--141631/1",
+"solutionLink": "#",
+"problemName": "Valid Pair Sum"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/save-gotham1222/1",
+"solutionLink": "#",
+"problemName": "Save Gotham!"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-the-longest-string--170645/1",
+"solutionLink": "#",
+"problemName": "Find the longest string"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/lcm-triplet1501/1",
+"solutionLink": "#",
+"problemName": "LCM Triplet"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-largest-word-in-dictionary2430/1",
+"solutionLink": "#",
+"problemName": "Find largest word in dictionary"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/ways-to-write-n-as-sum-1587115621/1",
+"solutionLink": "#",
+"problemName": "Ways to write n as sum"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/tic-tac-toe2412/1",
+"solutionLink": "#",
+"problemName": "Tic Tac Toe"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/complement3911/1",
+"solutionLink": "#",
+"problemName": "Complement"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/handshakes1303/1",
+"solutionLink": "#",
+"problemName": "Handshakes"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/yet-another-query-problem--170647/1",
+"solutionLink": "#",
+"problemName": "Yet another query problem"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/minimum-x-xor-a--170645/1",
+"solutionLink": "#",
+"problemName": "Minimum X (xor) A"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/fill-up-buckets3500/1",
+"solutionLink": "#",
+"problemName": "Fill up buckets"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/special-palindrome-substrings--170647/1",
+"solutionLink": "#",
+"problemName": "Special Palindrome Substrings"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/quick-sort-on-linked-list/1",
+"solutionLink": "#",
+"problemName": "Quick Sort on Linked List"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/mila-and-strings0435/1",
+"solutionLink": "#",
+"problemName": "Lexicographically smallest string"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/build-the-smallest2841/1",
+"solutionLink": "#",
+"problemName": "Build the smallest"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/cat-and-hat-python/1",
+"solutionLink": "#",
+"problemName": "Cat and Hat"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/single-valued-subtree/1",
+"solutionLink": "#",
+"problemName": "Single valued subtree"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/knight-in-geekland--170647/1",
+"solutionLink": "#",
+"problemName": "Knight in Geekland"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/optimal-array--170647/1",
+"solutionLink": "#",
+"problemName": "Optimal Array"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-all-possible-palindromic-partitions-of-a-string/1",
+"solutionLink": "#",
+"problemName": "Find all possible palindromic partitions of a String"
+},
+{
+"difficulty": "Medium",
+"gfgLink": "https://www.geeksforgeeks.org/problems/merging-details/1",
+"solutionLink": "#",
+"problemName": "Merging Details"
+}
]
-
-Now, you can see the list of problems in a table format. You can click on the problem link to view the problem on the GeeksforGeeks website. You can also click on the solution link to view the solution of the problem.
\ No newline at end of file
+Now, you can see the list of problems in a table format. You can click on the problem link to view the problem on the GeeksforGeeks website. You can also click on the solution link to view the solution of the problem.
diff --git a/dsa-problems/gfg-problems/school/0001-0100.md b/dsa-problems/gfg-problems/school/0001-0100.md
index 053b0bd30..16e483ac3 100644
--- a/dsa-problems/gfg-problems/school/0001-0100.md
+++ b/dsa-problems/gfg-problems/school/0001-0100.md
@@ -8,615 +8,614 @@ keywords:
- gfg problems problems
---
-
export const problems = [
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-series2811/1",
- "solutionLink": "#",
- "problemName": "Sum of Series"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/value-equal-to-index-value1330/1",
- "solutionLink": "#",
- "problemName": "Value equal to index value"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-1-to-n-without-using-loops-1587115620/1",
- "solutionLink": "#",
- "problemName": "Print 1 To N Without Loop"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-alternate-elements-of-an-array/1",
- "solutionLink": "#",
- "problemName": "Print alternate elements of an array"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/palindromic-array-1587115620/1",
- "solutionLink": "#",
- "problemName": "Palindromic Array"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-the-pattern-set-1/1",
- "solutionLink": "#",
- "problemName": "Print the pattern | Set-1"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-median0527/1",
- "solutionLink": "#",
- "problemName": "Find the median"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-for-binary/1",
- "solutionLink": "#",
- "problemName": "Check for Binary"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-hello-world4004/1",
- "solutionLink": "#",
- "problemName": "Java Hello World"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-of-smaller-elements5947/1",
- "solutionLink": "#",
- "problemName": "Count of smaller elements"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-array2326/1",
- "solutionLink": "#",
- "problemName": "Sum of Array"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-elements-of-array4910/1",
- "solutionLink": "#",
- "problemName": "Print Elements of Array"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-index4752/1",
- "solutionLink": "#",
- "problemName": "Find Index"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/palindrome0746/1",
- "solutionLink": "#",
- "problemName": "Palindrome"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/reverse-digit0316/1",
- "solutionLink": "#",
- "problemName": "Reverse digits"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-if-else-decision-making0924/1",
- "solutionLink": "#",
- "problemName": "if-else (Decision Making)"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/gcd-of-two-numbers3459/1",
- "solutionLink": "#",
- "problemName": "GCD of two numbers"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/swap-kth-elements5500/1",
- "solutionLink": "#",
- "problemName": "Swap kth elements"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/display-longest-name0853/1",
- "solutionLink": "#",
- "problemName": "Display longest name"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/odd-or-even3618/1",
- "solutionLink": "#",
- "problemName": "Odd or Even"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-convert-string-to-lowercase2313/1",
- "solutionLink": "#",
- "problemName": "Convert String to LowerCase"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-array-print-an-element-set-25933/1",
- "solutionLink": "#",
- "problemName": "C++ Array (print an element) | Set 2"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/remove-spaces0128/1",
- "solutionLink": "#",
- "problemName": "Remove Spaces"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/perfect-arrays4645/1",
- "solutionLink": "#",
- "problemName": "Perfect Arrays"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/smaller-and-larger4005/1",
- "solutionLink": "#",
- "problemName": "Smaller and Larger"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-if-else-decision-making4138/1",
- "solutionLink": "#",
- "problemName": "C++ if-else (Decision Making)"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/addition-of-two-numbers0812/1",
- "solutionLink": "#",
- "problemName": "Addition of Two Numbers"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-digit-is-pallindrome-or-not2751/1",
- "solutionLink": "#",
- "problemName": "Sum of Digit is Pallindrome or not"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/series-ap5310/1",
- "solutionLink": "#",
- "problemName": "Series AP"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-reverse-a-string0416/1",
- "solutionLink": "#",
- "problemName": "Reverse a String"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-1-to-n-without-using-loops3621/1",
- "solutionLink": "#",
- "problemName": "Print 1 to n without using loops"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/at-least-two-greater-elements4625/1",
- "solutionLink": "#",
- "problemName": "At least two greater elements"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-input-output2432/1",
- "solutionLink": "#",
- "problemName": "C++ Input / Output"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/swap-two-numbers3844/1",
- "solutionLink": "#",
- "problemName": "Swap two numbers"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-table0303/1",
- "solutionLink": "#",
- "problemName": "Multiplication Table"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/reversing-the-vowels5304/1",
- "solutionLink": "#",
- "problemName": "Reversing the vowels"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-arrays-set-11354/1",
- "solutionLink": "#",
- "problemName": "Java Arrays | Set 1"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/upper-case-conversion5419/1",
- "solutionLink": "#",
- "problemName": "Upper case conversion"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-the-left-element2009/1",
- "solutionLink": "#",
- "problemName": "Print the left element"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-digits1742/1",
- "solutionLink": "#",
- "problemName": "Sum Of Digits"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/remove-vowels-from-string1446/1",
- "solutionLink": "#",
- "problemName": "Remove vowels from string"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/npr4253/1",
- "solutionLink": "#",
- "problemName": "nPr"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/average4856/1",
- "solutionLink": "#",
- "problemName": "Average in a stream"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-string1818/1",
- "solutionLink": "#",
- "problemName": "Check String"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/the-dice-problem2316/1",
- "solutionLink": "#",
- "problemName": "The dice problem"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-palindrome3857/1",
- "solutionLink": "#",
- "problemName": "Sum Palindrome"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/vowel-or-not0831/1",
- "solutionLink": "#",
- "problemName": "Vowel or Not"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-switch-case-statement3529/1",
- "solutionLink": "#",
- "problemName": "Java Switch Case statement"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-strings-set-15112/1",
- "solutionLink": "#",
- "problemName": "Java Strings | Set 1"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-delete-alternate-characters4036/1",
- "solutionLink": "#",
- "problemName": "Delete alternate characters"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/compete-the-skills5807/1",
- "solutionLink": "#",
- "problemName": "Compete the skills"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-strings4609/1",
- "solutionLink": "#",
- "problemName": "C++ Strings"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-elements-in-a-matrix2000/1",
- "solutionLink": "#",
- "problemName": "Sum of elements in a matrix"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-camel3348/1",
- "solutionLink": "#",
- "problemName": "Count of camel case characters"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-functions-set-1introduction/1",
- "solutionLink": "#",
- "problemName": "C++ Functions (Sum of numbers) | Set 1"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/greatest-of-three-numbers2520/1",
- "solutionLink": "#",
- "problemName": "Greatest of three numbers"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-inputoutput0118/1",
- "solutionLink": "#",
- "problemName": "Java Input/Output"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-switch-case-statement5900/1",
- "solutionLink": "#",
- "problemName": "C++ Switch Case Statement"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/remainder-evaluation3755/1",
- "solutionLink": "#",
- "problemName": "Remainder Evaluation"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/convert-a-list-of-characters-into-a-string5142/1",
- "solutionLink": "#",
- "problemName": "Convert a list of characters into a String"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/lower-case-to-upper-case3410/1",
- "solutionLink": "#",
- "problemName": "Lower case to upper case"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/number-of-divisors1631/1",
- "solutionLink": "#",
- "problemName": "Number of divisors"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-2-d-arrays0708/1",
- "solutionLink": "#",
- "problemName": "C++ 2-D Arrays | Set-1"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-operators4602/1",
- "solutionLink": "#",
- "problemName": "C++ Operators | Set 1 (Arithmetic)"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-type-of-characters3635/1",
- "solutionLink": "#",
- "problemName": "Count type of Characters"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/simple-interest3457/1",
- "solutionLink": "#",
- "problemName": "Simple Interest"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-pointers-set-1introduction/1",
- "solutionLink": "#",
- "problemName": "C++ Pointers ( Incrementing a variable) | Set 1"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-n-th-term-of-series-1-3-6-10-15-215506/1",
- "solutionLink": "#",
- "problemName": "Find n-th term of series 1, 3, 6, 10, 15, 21"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/multiply-matrices/1",
- "solutionLink": "#",
- "problemName": "Multiply Matrices"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/binary-representation5003/1",
- "solutionLink": "#",
- "problemName": "Binary representation"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/mean0021/1",
- "solutionLink": "#",
- "problemName": "Mean"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/power-of-pow-even-number5440/1",
- "solutionLink": "#",
- "problemName": "Power of Pow | Even Number"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-inheritance/1",
- "solutionLink": "#",
- "problemName": "Java Inheritance"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-substring5058/1",
- "solutionLink": "#",
- "problemName": "Java Substring"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/remove-characters-from-alphanumeric-string0648/1",
- "solutionLink": "#",
- "problemName": "Remove characters from alphanumeric string"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/pattern-printing1347/1",
- "solutionLink": "#",
- "problemName": "Pattern Printing"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-ap-series4512/1",
- "solutionLink": "#",
- "problemName": "Sum of AP series"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/multiply-array-1658312632/1",
- "solutionLink": "#",
- "problemName": "Multiply Array"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-data-types1523/1",
- "solutionLink": "#",
- "problemName": "C++ Data Types"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/pattern-of-strings3829/1",
- "solutionLink": "#",
- "problemName": "Pattern of Strings"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-basic-data-types0041/1",
- "solutionLink": "#",
- "problemName": "Java Basic Data Types"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/full-prime2659/1",
- "solutionLink": "#",
- "problemName": "Full Prime"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/small-factorial0854/1",
- "solutionLink": "#",
- "problemName": "Small Factorial"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/perfect-number3759/1",
- "solutionLink": "#",
- "problemName": "Perfect Number"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-operators-relational-set-21407/1",
- "solutionLink": "#",
- "problemName": "C++ Operators (Relational) | Set 2"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/cube-root-of-a-number0915/1",
- "solutionLink": "#",
- "problemName": "Cube root of a number"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/split-strings5211/1",
- "solutionLink": "#",
- "problemName": "Split Strings"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/power-of-pow-odd-numbers1103/1",
- "solutionLink": "#",
- "problemName": "Power of Pow | Odd Numbers"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-loops-set-11726/1",
- "solutionLink": "#",
- "problemName": "Java loops | Set 1"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-odd-and-even-elements3033/1",
- "solutionLink": "#",
- "problemName": "Sum of odd and even elements"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/distance-between-2-points3200/1",
- "solutionLink": "#",
- "problemName": "Distance between 2 points"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/1s-complement2819/1",
- "solutionLink": "#",
- "problemName": "1s Complement"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/surface-area-and-volume-of-cuboid0522/1",
- "solutionLink": "#",
- "problemName": "Surface Area and Volume of Cuboid"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-gp2120/1",
- "solutionLink": "#",
- "problemName": "Sum of GP"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-operatorsrelational-set-22338/1",
- "solutionLink": "#",
- "problemName": "Java Operators(Relational) | Set - 2"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/extract-the-integers4428/1",
- "solutionLink": "#",
- "problemName": "Extract the integers"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-override/1",
- "solutionLink": "#",
- "problemName": "Java Override"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/floyds-triangle1222/1",
- "solutionLink": "#",
- "problemName": "Floyd's triangle"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/even-odd-sum5450/1",
- "solutionLink": "#",
- "problemName": "Even Odd Sum"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/identical-matrices1042/1",
- "solutionLink": "#",
- "problemName": "Identical Matrices"
- }
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/sum-of-series2811/1",
+"solutionLink": "#",
+"problemName": "Sum of Series"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/value-equal-to-index-value1330/1",
+"solutionLink": "#",
+"problemName": "Value equal to index value"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/print-1-to-n-without-using-loops-1587115620/1",
+"solutionLink": "#",
+"problemName": "Print 1 To N Without Loop"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/print-alternate-elements-of-an-array/1",
+"solutionLink": "#",
+"problemName": "Print alternate elements of an array"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/palindromic-array-1587115620/1",
+"solutionLink": "#",
+"problemName": "Palindromic Array"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/print-the-pattern-set-1/1",
+"solutionLink": "#",
+"problemName": "Print the pattern | Set-1"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-the-median0527/1",
+"solutionLink": "#",
+"problemName": "Find the median"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/check-for-binary/1",
+"solutionLink": "#",
+"problemName": "Check for Binary"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/java-hello-world4004/1",
+"solutionLink": "#",
+"problemName": "Java Hello World"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/count-of-smaller-elements5947/1",
+"solutionLink": "#",
+"problemName": "Count of smaller elements"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/sum-of-array2326/1",
+"solutionLink": "#",
+"problemName": "Sum of Array"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/print-elements-of-array4910/1",
+"solutionLink": "#",
+"problemName": "Print Elements of Array"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-index4752/1",
+"solutionLink": "#",
+"problemName": "Find Index"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/palindrome0746/1",
+"solutionLink": "#",
+"problemName": "Palindrome"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/reverse-digit0316/1",
+"solutionLink": "#",
+"problemName": "Reverse digits"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/java-if-else-decision-making0924/1",
+"solutionLink": "#",
+"problemName": "if-else (Decision Making)"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/gcd-of-two-numbers3459/1",
+"solutionLink": "#",
+"problemName": "GCD of two numbers"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/swap-kth-elements5500/1",
+"solutionLink": "#",
+"problemName": "Swap kth elements"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/display-longest-name0853/1",
+"solutionLink": "#",
+"problemName": "Display longest name"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/odd-or-even3618/1",
+"solutionLink": "#",
+"problemName": "Odd or Even"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/java-convert-string-to-lowercase2313/1",
+"solutionLink": "#",
+"problemName": "Convert String to LowerCase"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/c-array-print-an-element-set-25933/1",
+"solutionLink": "#",
+"problemName": "C++ Array (print an element) | Set 2"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/remove-spaces0128/1",
+"solutionLink": "#",
+"problemName": "Remove Spaces"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/perfect-arrays4645/1",
+"solutionLink": "#",
+"problemName": "Perfect Arrays"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/smaller-and-larger4005/1",
+"solutionLink": "#",
+"problemName": "Smaller and Larger"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/c-if-else-decision-making4138/1",
+"solutionLink": "#",
+"problemName": "C++ if-else (Decision Making)"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/addition-of-two-numbers0812/1",
+"solutionLink": "#",
+"problemName": "Addition of Two Numbers"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/sum-of-digit-is-pallindrome-or-not2751/1",
+"solutionLink": "#",
+"problemName": "Sum of Digit is Pallindrome or not"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/series-ap5310/1",
+"solutionLink": "#",
+"problemName": "Series AP"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/java-reverse-a-string0416/1",
+"solutionLink": "#",
+"problemName": "Reverse a String"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/print-1-to-n-without-using-loops3621/1",
+"solutionLink": "#",
+"problemName": "Print 1 to n without using loops"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/at-least-two-greater-elements4625/1",
+"solutionLink": "#",
+"problemName": "At least two greater elements"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/c-input-output2432/1",
+"solutionLink": "#",
+"problemName": "C++ Input / Output"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/swap-two-numbers3844/1",
+"solutionLink": "#",
+"problemName": "Swap two numbers"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/print-table0303/1",
+"solutionLink": "#",
+"problemName": "Multiplication Table"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/reversing-the-vowels5304/1",
+"solutionLink": "#",
+"problemName": "Reversing the vowels"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/java-arrays-set-11354/1",
+"solutionLink": "#",
+"problemName": "Java Arrays | Set 1"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/upper-case-conversion5419/1",
+"solutionLink": "#",
+"problemName": "Upper case conversion"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/print-the-left-element2009/1",
+"solutionLink": "#",
+"problemName": "Print the left element"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/sum-of-digits1742/1",
+"solutionLink": "#",
+"problemName": "Sum Of Digits"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/remove-vowels-from-string1446/1",
+"solutionLink": "#",
+"problemName": "Remove vowels from string"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/npr4253/1",
+"solutionLink": "#",
+"problemName": "nPr"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/average4856/1",
+"solutionLink": "#",
+"problemName": "Average in a stream"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/check-string1818/1",
+"solutionLink": "#",
+"problemName": "Check String"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/the-dice-problem2316/1",
+"solutionLink": "#",
+"problemName": "The dice problem"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/sum-palindrome3857/1",
+"solutionLink": "#",
+"problemName": "Sum Palindrome"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/vowel-or-not0831/1",
+"solutionLink": "#",
+"problemName": "Vowel or Not"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/java-switch-case-statement3529/1",
+"solutionLink": "#",
+"problemName": "Java Switch Case statement"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/java-strings-set-15112/1",
+"solutionLink": "#",
+"problemName": "Java Strings | Set 1"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/java-delete-alternate-characters4036/1",
+"solutionLink": "#",
+"problemName": "Delete alternate characters"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/compete-the-skills5807/1",
+"solutionLink": "#",
+"problemName": "Compete the skills"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/c-strings4609/1",
+"solutionLink": "#",
+"problemName": "C++ Strings"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/sum-of-elements-in-a-matrix2000/1",
+"solutionLink": "#",
+"problemName": "Sum of elements in a matrix"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-the-camel3348/1",
+"solutionLink": "#",
+"problemName": "Count of camel case characters"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/c-functions-set-1introduction/1",
+"solutionLink": "#",
+"problemName": "C++ Functions (Sum of numbers) | Set 1"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/greatest-of-three-numbers2520/1",
+"solutionLink": "#",
+"problemName": "Greatest of three numbers"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/java-inputoutput0118/1",
+"solutionLink": "#",
+"problemName": "Java Input/Output"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/c-switch-case-statement5900/1",
+"solutionLink": "#",
+"problemName": "C++ Switch Case Statement"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/remainder-evaluation3755/1",
+"solutionLink": "#",
+"problemName": "Remainder Evaluation"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/convert-a-list-of-characters-into-a-string5142/1",
+"solutionLink": "#",
+"problemName": "Convert a list of characters into a String"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/lower-case-to-upper-case3410/1",
+"solutionLink": "#",
+"problemName": "Lower case to upper case"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/number-of-divisors1631/1",
+"solutionLink": "#",
+"problemName": "Number of divisors"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/c-2-d-arrays0708/1",
+"solutionLink": "#",
+"problemName": "C++ 2-D Arrays | Set-1"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/c-operators4602/1",
+"solutionLink": "#",
+"problemName": "C++ Operators | Set 1 (Arithmetic)"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/count-type-of-characters3635/1",
+"solutionLink": "#",
+"problemName": "Count type of Characters"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/simple-interest3457/1",
+"solutionLink": "#",
+"problemName": "Simple Interest"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/c-pointers-set-1introduction/1",
+"solutionLink": "#",
+"problemName": "C++ Pointers ( Incrementing a variable) | Set 1"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-n-th-term-of-series-1-3-6-10-15-215506/1",
+"solutionLink": "#",
+"problemName": "Find n-th term of series 1, 3, 6, 10, 15, 21"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/multiply-matrices/1",
+"solutionLink": "#",
+"problemName": "Multiply Matrices"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/binary-representation5003/1",
+"solutionLink": "#",
+"problemName": "Binary representation"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/mean0021/1",
+"solutionLink": "#",
+"problemName": "Mean"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/power-of-pow-even-number5440/1",
+"solutionLink": "#",
+"problemName": "Power of Pow | Even Number"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/java-inheritance/1",
+"solutionLink": "#",
+"problemName": "Java Inheritance"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/java-substring5058/1",
+"solutionLink": "#",
+"problemName": "Java Substring"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/remove-characters-from-alphanumeric-string0648/1",
+"solutionLink": "#",
+"problemName": "Remove characters from alphanumeric string"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/pattern-printing1347/1",
+"solutionLink": "#",
+"problemName": "Pattern Printing"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/sum-of-ap-series4512/1",
+"solutionLink": "#",
+"problemName": "Sum of AP series"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/multiply-array-1658312632/1",
+"solutionLink": "#",
+"problemName": "Multiply Array"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/c-data-types1523/1",
+"solutionLink": "#",
+"problemName": "C++ Data Types"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/pattern-of-strings3829/1",
+"solutionLink": "#",
+"problemName": "Pattern of Strings"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/java-basic-data-types0041/1",
+"solutionLink": "#",
+"problemName": "Java Basic Data Types"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/full-prime2659/1",
+"solutionLink": "#",
+"problemName": "Full Prime"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/small-factorial0854/1",
+"solutionLink": "#",
+"problemName": "Small Factorial"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/perfect-number3759/1",
+"solutionLink": "#",
+"problemName": "Perfect Number"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/c-operators-relational-set-21407/1",
+"solutionLink": "#",
+"problemName": "C++ Operators (Relational) | Set 2"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/cube-root-of-a-number0915/1",
+"solutionLink": "#",
+"problemName": "Cube root of a number"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/split-strings5211/1",
+"solutionLink": "#",
+"problemName": "Split Strings"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/power-of-pow-odd-numbers1103/1",
+"solutionLink": "#",
+"problemName": "Power of Pow | Odd Numbers"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/java-loops-set-11726/1",
+"solutionLink": "#",
+"problemName": "Java loops | Set 1"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/sum-of-odd-and-even-elements3033/1",
+"solutionLink": "#",
+"problemName": "Sum of odd and even elements"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/distance-between-2-points3200/1",
+"solutionLink": "#",
+"problemName": "Distance between 2 points"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/1s-complement2819/1",
+"solutionLink": "#",
+"problemName": "1s Complement"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/surface-area-and-volume-of-cuboid0522/1",
+"solutionLink": "#",
+"problemName": "Surface Area and Volume of Cuboid"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/sum-of-gp2120/1",
+"solutionLink": "#",
+"problemName": "Sum of GP"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/java-operatorsrelational-set-22338/1",
+"solutionLink": "#",
+"problemName": "Java Operators(Relational) | Set - 2"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/extract-the-integers4428/1",
+"solutionLink": "#",
+"problemName": "Extract the integers"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/java-override/1",
+"solutionLink": "#",
+"problemName": "Java Override"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/floyds-triangle1222/1",
+"solutionLink": "#",
+"problemName": "Floyd's triangle"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/even-odd-sum5450/1",
+"solutionLink": "#",
+"problemName": "Even Odd Sum"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/identical-matrices1042/1",
+"solutionLink": "#",
+"problemName": "Identical Matrices"
+}
]
-
-Now, you can see the list of problems in a table format. You can click on the problem link to view the problem on the GeeksforGeeks website. You can also click on the solution link to view the solution of the problem.
\ No newline at end of file
+Now, you can see the list of problems in a table format. You can click on the problem link to view the problem on the GeeksforGeeks website. You can also click on the solution link to view the solution of the problem.
diff --git a/dsa-problems/gfg-problems/school/0101-0123.md b/dsa-problems/gfg-problems/school/0101-0123.md
index 379c26f79..9e52aeb3d 100644
--- a/dsa-problems/gfg-problems/school/0101-0123.md
+++ b/dsa-problems/gfg-problems/school/0101-0123.md
@@ -8,153 +8,152 @@ keywords:
- gfg problems problems
---
-
export const problems = [
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/automorphic-number4721/1",
- "solutionLink": "#",
- "problemName": "Automorphic Number"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/triangle-shrinking-downwards0459/1",
- "solutionLink": "#",
- "problemName": "Triangle shrinking downwards"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/diagonal-sum0158/1",
- "solutionLink": "#",
- "problemName": "Diagonal sum"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-an-ap1025/1",
- "solutionLink": "#",
- "problemName": "Sum of an AP"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/area-of-rectange-right-angled-triangle-and-circle2600/1",
- "solutionLink": "#",
- "problemName": "Area of Rectangle, Right Angled Triangle and Circle"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-difference-between-sum-of-diagonals1554/1",
- "solutionLink": "#",
- "problemName": "Find difference between sum of diagonals"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/front-back-transformation1659/1",
- "solutionLink": "#",
- "problemName": "Front-Back Transformation - copy"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/addition-of-two-square-matrices4916/1",
- "solutionLink": "#",
- "problemName": "Addition of two square matrices"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/12-hour-clock-subtraction1708/1",
- "solutionLink": "#",
- "problemName": "12 hour clock subtraction"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-classes-introduction/1",
- "solutionLink": "#",
- "problemName": "Java Classes Introduction"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/number-of-diagonals1020/1",
- "solutionLink": "#",
- "problemName": "Number of Diagonals"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/12-hour-clock-addition1206/1",
- "solutionLink": "#",
- "problemName": "12 hour clock addition"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/checcheck-if-two-given-circles-touch-each-other5038/1",
- "solutionLink": "#",
- "problemName": "Check if two given circles touch each other"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/combinational-logic1908/1",
- "solutionLink": "#",
- "problemName": "Combinational Logic"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-abstract-keyword/1",
- "solutionLink": "#",
- "problemName": "Java Abstract keyword"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/compound-interest0235/1",
- "solutionLink": "#",
- "problemName": "Compound Interest"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/program-to-print-reciprocal-of-letters36233623/1",
- "solutionLink": "#",
- "problemName": "Program to print reciprocal of letters"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/determine-focal-length-of-a-spherical-mirror5415/1",
- "solutionLink": "#",
- "problemName": "Determine focal length of a spherical mirror"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/12-hour-clock-multiplication4709/1",
- "solutionLink": "#",
- "problemName": "12 hour clock Multiplication "
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/number-pattern0517/1",
- "solutionLink": "#",
- "problemName": "Number Pattern"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/parallel-or-perpendicular4257/1",
- "solutionLink": "#",
- "problemName": "Parallel or Perpendicular?"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/decimal-to-any-base-conversion2440/1",
- "solutionLink": "#",
- "problemName": "Decimal to any base conversion"
- },
- {
- "difficulty": "School",
- "leetCodeLink": "https://www.geeksforgeeks.org/problems/time-to-words3728/1",
- "solutionLink": "#",
- "problemName": "Time to Words"
- }
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/automorphic-number4721/1",
+"solutionLink": "#",
+"problemName": "Automorphic Number"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/triangle-shrinking-downwards0459/1",
+"solutionLink": "#",
+"problemName": "Triangle shrinking downwards"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/diagonal-sum0158/1",
+"solutionLink": "#",
+"problemName": "Diagonal sum"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/sum-of-an-ap1025/1",
+"solutionLink": "#",
+"problemName": "Sum of an AP"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/area-of-rectange-right-angled-triangle-and-circle2600/1",
+"solutionLink": "#",
+"problemName": "Area of Rectangle, Right Angled Triangle and Circle"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/find-difference-between-sum-of-diagonals1554/1",
+"solutionLink": "#",
+"problemName": "Find difference between sum of diagonals"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/front-back-transformation1659/1",
+"solutionLink": "#",
+"problemName": "Front-Back Transformation - copy"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/addition-of-two-square-matrices4916/1",
+"solutionLink": "#",
+"problemName": "Addition of two square matrices"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/12-hour-clock-subtraction1708/1",
+"solutionLink": "#",
+"problemName": "12 hour clock subtraction"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/java-classes-introduction/1",
+"solutionLink": "#",
+"problemName": "Java Classes Introduction"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/number-of-diagonals1020/1",
+"solutionLink": "#",
+"problemName": "Number of Diagonals"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/12-hour-clock-addition1206/1",
+"solutionLink": "#",
+"problemName": "12 hour clock addition"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/checcheck-if-two-given-circles-touch-each-other5038/1",
+"solutionLink": "#",
+"problemName": "Check if two given circles touch each other"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/combinational-logic1908/1",
+"solutionLink": "#",
+"problemName": "Combinational Logic"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/java-abstract-keyword/1",
+"solutionLink": "#",
+"problemName": "Java Abstract keyword"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/compound-interest0235/1",
+"solutionLink": "#",
+"problemName": "Compound Interest"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/program-to-print-reciprocal-of-letters36233623/1",
+"solutionLink": "#",
+"problemName": "Program to print reciprocal of letters"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/determine-focal-length-of-a-spherical-mirror5415/1",
+"solutionLink": "#",
+"problemName": "Determine focal length of a spherical mirror"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/12-hour-clock-multiplication4709/1",
+"solutionLink": "#",
+"problemName": "12 hour clock Multiplication "
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/number-pattern0517/1",
+"solutionLink": "#",
+"problemName": "Number Pattern"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/parallel-or-perpendicular4257/1",
+"solutionLink": "#",
+"problemName": "Parallel or Perpendicular?"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/decimal-to-any-base-conversion2440/1",
+"solutionLink": "#",
+"problemName": "Decimal to any base conversion"
+},
+{
+"difficulty": "School",
+"gfgLink": "https://www.geeksforgeeks.org/problems/time-to-words3728/1",
+"solutionLink": "#",
+"problemName": "Time to Words"
+}
]
-
-Now, you can see the list of problems in a table format. You can click on the problem link to view the problem on the GeeksforGeeks website. You can also click on the solution link to view the solution of the problem.
\ No newline at end of file
+Now, you can see the list of problems in a table format. You can click on the problem link to view the problem on the GeeksforGeeks website. You can also click on the solution link to view the solution of the problem.
diff --git a/dsa-problems/index.md b/dsa-problems/index.md
index cffd297ed..a5e21c032 100644
--- a/dsa-problems/index.md
+++ b/dsa-problems/index.md
@@ -2,7 +2,49 @@
title: Data Structures and Algorithms Problems
sidebar_label: DSA Problems
sidebar_position: 1
-
---
-In this section, you will learn about the problems of Data Structures and Algorithms.
\ No newline at end of file
+DSA Problems are a collection of problems that are frequently asked in coding interviews. These problems are categorized based on the data structures and algorithms they use. The problems are available in multiple programming languages like C++, Java, Python, and JavaScript. The problems are also available in the form of video tutorials and solutions.
+
+## What is Data Structures and Algorithms?
+
+Data Structures and Algorithms are the building blocks of computer science. Data structures are a way of organizing and storing data in a computer so that it can be accessed and modified efficiently. Algorithms are a set of instructions that are used to perform a specific task. Data structures and algorithms are used to solve complex problems in computer science and software development.
+
+## Why Data Structures and Algorithms are important?
+
+Data Structures and Algorithms are important because they help in writing efficient code. By using the right data structure and algorithm, you can reduce the time and space complexity of your code. This can help in improving the performance of your code and making it more scalable. Data Structures and Algorithms are also important for coding interviews as they are frequently asked in coding interviews.
+
+## How to prepare for Data Structures and Algorithms?
+
+To prepare for Data Structures and Algorithms, you can start by learning the basic data structures like arrays, linked lists, stacks, queues, trees, graphs, etc. You can then move on to learning the basic algorithms like sorting, searching, recursion, dynamic programming, etc. You can practice solving problems on these data structures and algorithms on platforms like LeetCode, HackerRank, Codeforces, etc. You can also refer to books like "Introduction to Algorithms" by Cormen, Leiserson, Rivest, and Stein, "Cracking the Coding Interview" by Gayle Laakmann McDowell, etc.
+
+## List of Data Structures and Algorithms Problems
+
+Here is a list of Data Structures and Algorithms Problems that are available on this website:
+
+- [Array Problems](#)
+- [Linked List Problems](#)
+- [Stack Problems](#)
+- [Queue Problems](#)
+- [Tree Problems](#)
+- [Graph Problems](#)
+- [Sorting Problems](#)
+- [Searching Problems](#)
+- [Recursion Problems](#)
+- [Dynamic Programming Problems](#)
+- [Greedy Problems](#)
+- [Backtracking Problems](#)
+- [Bit Manipulation Problems](#)
+- [Math Problems](#)
+- [String Problems](#)
+- [Matrix Problems](#)
+- [Miscellaneous Problems](#)
+- [LeetCode Problems](#)
+- [HackerRank Problems](#)
+- [Codeforces Problems](#)
+
+You can click on the links above to view the problems in each category. You can also use the search bar at the top of the page to search for specific problems.
+
+## Conclusion
+
+Data Structures and Algorithms are an important part of computer science and software development. By learning and practicing data structures and algorithms, you can improve your problem-solving skills and become a better programmer. The problems available on this website are a great resource for practicing data structures and algorithms and preparing for coding interviews. I hope you find these problems helpful in your journey of learning data structures and algorithms.
diff --git a/dsa-solutions/lc-solutions/0100-0199/0171-excel-sheet-column-number.md b/dsa-solutions/lc-solutions/0100-0199/0171-excel-sheet-column-number.md
new file mode 100644
index 000000000..d23e380a1
--- /dev/null
+++ b/dsa-solutions/lc-solutions/0100-0199/0171-excel-sheet-column-number.md
@@ -0,0 +1,85 @@
+---
+id: excel-sheet-column-number
+title: Excel Sheet Column Number
+---
+
+## Problem Description
+
+Given a string **columnTitle** that represents the column title as appears in an Excel sheet, return its corresponding column number.
+For example:
+
+```
+A -> 1
+B -> 2
+C -> 3
+...
+Z -> 26
+AA -> 27
+AB -> 28
+...
+```
+
+### Examples
+
+**Example 1:**
+
+**Example 2:**
+
+**Example 3:**
+
+## Solution for Best Time to Buy and Sell Stock Problem
+
+### Intuition
+
+The intuition behind the solution is to treat each letter as a digit in a base-26 number system, where 'A' represents 1, 'B' represents 2, ..., 'Z' represents 26. The solution then iterates through each character in the column title, calculates the numeric value of the corresponding letter, and accumulates the result by considering the positional weight of each letter.
+
+- Initialize variables x and ans to keep track of the positional weight and the accumulated result, respectively.
+- Iterate through each character s in the columnTitle.
+- Convert the character s to its numeric representation by using the ord function (ASCII value) and subtracting 64 (since 'A' corresponds to 65 in ASCII).
+- Update the result (ans) by adding the product of the numeric representation, positional weight (26\*\*x), and decrease the positional weight x by 1.
+- Repeat this process for each character in the column title.
+- Return the final accumulated result.
+
+### Code in Different languages
+
+#### Code in C++ language
+
+```cpp
+class Solution {
+public:
+ int titleToNumber(std::string columnTitle) {
+ int x = columnTitle.length() - 1;
+ int ans = 0;
+
+ for (char s : columnTitle) {
+ int letter = s - 'A' + 1;
+ ans += letter * pow(26, x);
+ x--;
+ }
+
+ return ans;
+ }
+};
+
+
+```
+
+```python
+class Solution:
+ def titleToNumber(self, columnTitle: str) -> int:
+ x = len(columnTitle)-1
+ ans = 0
+
+ for s in columnTitle:
+ letter = ord(s)-64
+ ans += letter*(26**x)
+ x -= 1
+
+ return ans
+
+```
+
+### Complexity Analysis
+
+- Time complexity: $O(n)$
+- Space complexity: $O(1)$
diff --git a/sidebarsDSAProblems.js b/sidebarsDSAProblems.js
deleted file mode 100644
index dcabefa92..000000000
--- a/sidebarsDSAProblems.js
+++ /dev/null
@@ -1,8 +0,0 @@
-module.exports = {
- codeharborhub: [
- {
- type: "autogenerated",
- dirName: ".",
- },
- ],
- };
\ No newline at end of file
diff --git a/sidebarsDSASolutions.js b/sidebarsDSASolutions.js
deleted file mode 100644
index dcabefa92..000000000
--- a/sidebarsDSASolutions.js
+++ /dev/null
@@ -1,8 +0,0 @@
-module.exports = {
- codeharborhub: [
- {
- type: "autogenerated",
- dirName: ".",
- },
- ],
- };
\ No newline at end of file
diff --git a/sidebarsProduct.js b/sidebarsProduct.js
deleted file mode 100644
index dcabefa92..000000000
--- a/sidebarsProduct.js
+++ /dev/null
@@ -1,8 +0,0 @@
-module.exports = {
- codeharborhub: [
- {
- type: "autogenerated",
- dirName: ".",
- },
- ],
- };
\ No newline at end of file
diff --git a/sidebarsSupport.js b/sidebarsSupport.js
deleted file mode 100644
index dd6e29d36..000000000
--- a/sidebarsSupport.js
+++ /dev/null
@@ -1,137 +0,0 @@
-module.exports = {
- Courses: [
- // {
- // type: 'link',
- // label: 'Projects',
- // href: '/cardHolder',
- // },
- // {
- // type: 'link',
- // label: 'Collections',
- // href: '/collections',
- // },
- // {
- // type: 'link',
- // label: 'myComponents',
- // href: '/myComponents',
- // },
- {
- type: 'link',
- label: 'Live Playground',
- href: '/LiveCodeEditor',
- },
- {
- type: 'category',
- label: 'Courses',
- link: {
- type: 'doc',
- id: 'all-courses',
- },
- collapsible: true,
- collapsed: true,
- items: [
-
- {
- type: 'category',
- label: '🔮 JavaScript',
- link: {
- type: 'doc',
- id: 'javascript/welcome-js',
- },
- collapsible: true,
- collapsed: true,
- items: [
- {
- type: 'autogenerated',
- dirName: 'javascript',
- },
- ],
- },
-
- {
- type: 'category',
- label: '⚛️ React',
- link: {
- type: 'doc',
- id: 'react/welcome-react',
- },
- collapsible: true,
- collapsed: true,
- items: [
- {
- type: 'autogenerated',
- dirName: 'react',
- },
- ],
- },
-
- {
- type: 'category',
- label: '🌠 Node Js',
- link: {
- type: 'doc',
- id: 'node/welcome-node',
- },
- collapsible: true,
- collapsed: true,
- items: [
- {
- type: 'autogenerated',
- dirName: 'node',
- },
- ],
- },
- {
- type: 'category',
- label: '🌠 Artificial Intelligence',
- link: {
- type: 'doc',
- id: 'ai/welcome-ai',
- },
- collapsible: true,
- collapsed: true,
- items: [
- {
- type: 'autogenerated',
- dirName: 'ai',
- },
- ],
- },
-
- {
- type: 'category',
- label: '🕵️♂️ Ethical Hacking',
- link: {
- type: 'doc',
- id: 'ethical-hacking/eh-wel',
- },
- collapsible: true,
- collapsed: true,
- items: [
- {
- type: 'autogenerated',
- dirName: 'ethical-hacking',
- },
- ],
- },
-
- {
- type: 'category',
- label: '🧠 DSA Course',
- link: {
- type: 'doc',
- id: 'dsa/welcome-dsa',
- },
- collapsible: true,
- collapsed: true,
- items: [
- {
- type: 'autogenerated',
- dirName: 'dsa',
- },
- ],
- },
- ],
- },
- ],
- };
\ No newline at end of file
diff --git a/sidebarsWebDev.js b/sidebarsWebDev.js
deleted file mode 100644
index 4a0a10366..000000000
--- a/sidebarsWebDev.js
+++ /dev/null
@@ -1,8 +0,0 @@
-module.exports = {
- codeharborhub: [
- {
- type: "autogenerated",
- dirName: ".",
- },
- ],
-};
diff --git a/src/context/CommunityStats/index.tsx b/src/context/CommunityStats/index.tsx
index 45e22e073..582c1dfbb 100644
--- a/src/context/CommunityStats/index.tsx
+++ b/src/context/CommunityStats/index.tsx
@@ -46,7 +46,7 @@ export const CommunityStatsProvider: FC = ({ children }) => {
const json = await response.json();
setGithubStarCount(json.stargazers_count || 0);
- setGithubContributorsCount(json.open_issues || 0); // Assuming this property exists
+ setGithubContributorsCount(140 || 0); // Assuming this property exists
setGithubForksCount(json.forks_count || 0);
} catch (error) {
console.error("Error fetching GitHub data:", error);
diff --git a/src/data/showcase/ajay-portfolio.jpg b/src/data/showcase/ajay-portfolio.jpg
index 9828899ad..c92448a2a 100644
Binary files a/src/data/showcase/ajay-portfolio.jpg and b/src/data/showcase/ajay-portfolio.jpg differ
diff --git a/src/data/userData.tsx b/src/data/userData.tsx
index 28aad777b..9b38dea48 100644
--- a/src/data/userData.tsx
+++ b/src/data/userData.tsx
@@ -46,7 +46,7 @@ export const Users: User[] = [
preview: require("./showcase/TailwindBlog.jpg"),
website: null,
source: "https://github.com/Ajay-Dhangar/starter",
- tags: ["opensource", "clone", "templates", "documentation"],
+ tags: ["opensource", "clone", "templates", "documentation", "nextjs", "tailwind"],
},
// Restaurant Clone
@@ -145,7 +145,7 @@ export const Users: User[] = [
"https://github.com/dhairyagothi/50_days_50_web_project/tree/Main/public/TO_DO_LIST",
tags: ["html", "css", "javascript"],
},
-
+
// Dictonary app
{
@@ -157,7 +157,7 @@ export const Users: User[] = [
source: "https://github.com/kartikmehta18/Dictonary-app",
tags: ["opensource", "portfolio", "css", "javascript", "html"],
},
-
+
// Portfolio
{
title: "Portfolio",
@@ -168,7 +168,7 @@ export const Users: User[] = [
source: "hhttps://github.com/kartikmehta18/myportfolio",
tags: ["opensource", "portfolio", "css", "javascript", "html"],
},
-
+
// Currency Converter Clone
{
@@ -230,7 +230,6 @@ export const Users: User[] = [
"opensource",
"react",
"typescript",
- "templates",
"favorite",
"documentation",
"mdx",
@@ -258,7 +257,7 @@ export const Users: User[] = [
preview: require("./showcase/ajay-portfolio.jpg"),
website: "https://ajay-dhangar.github.io/",
source: "https://github.com/Ajay-Dhangar/ajay-dhangar.github.io",
- tags: ["opensource", "portfolio", "react", "typescript", "mdx"],
+ tags: ["opensource", "portfolio", "react", "typescript", "mdx", "tailwind"],
},
// BMI Calculator
@@ -414,23 +413,5 @@ export const Users: User[] = [
website: "https://github.com/Ridhima10/complete-web-dev.-boot-camp/tree/master/Buttons/Styling%20of%20buttons",
source: "https://github.com/Ridhima10/complete-web-dev.-boot-camp/tree/master/Buttons/Styling%20of%20buttons",
tags: ["html", "css", "javascript"],
- },
- // Portfolio Website
- {
- title: "Portfolio website",
- description: "It is a personal portfolio website consists of my skills, projects and experience",
- preview: require("./showcase/ridhi-portfolio.png"),
- website: "https://ridhima10.github.io/RidhiPortfolio/",
- source: "https://github.com/Ridhima10/RidhiPortfolio",
- tags: ["html", "css", "javascript", "react"],
- },
- // landing page
- {
- title: "Smart TV Clone",
- description: "A landing page made up of HTML, CSS and Javascript which is a clone of netflix in which we can watch movies, tv shows etc",
- preview: require("./showcase/Smart-tv.png"),
- website: "https://ridhima10.github.io/Smart_Tv_Clone/",
- source: "https://github.com/Ridhima10/Smart_Tv_Clone",
- tags: ["html", "css", "javascript", "opensource"],
}
];
diff --git a/src/data/users.tsx b/src/data/users.tsx
index 213005e05..f4dbdf600 100644
--- a/src/data/users.tsx
+++ b/src/data/users.tsx
@@ -37,6 +37,7 @@ export type TagType =
| "gym"
| "motion"
| "redux"
+ | "tailwind"
| "clone";
export type User = {
@@ -78,7 +79,7 @@ export const Tags: { [type in TagType]: Tag } = {
label: "Next.js",
description: "",
color: "#000000",
- },
+ },
typescript: {
label: "TypeScript",
description: "",
@@ -216,6 +217,11 @@ export const Tags: { [type in TagType]: Tag } = {
description: "",
color: "#007acc",
},
+ tailwind: {
+ label: "Tailwind",
+ description: "",
+ color: "#007acc",
+ },
scss: {
label: "SCSS",
description: "",