From 78368de63c5e5bde815fabd9d78461898507d6fe Mon Sep 17 00:00:00 2001 From: Agastya Kumar Yadav <124435030+agastya3636@users.noreply.github.com> Date: Tue, 4 Jun 2024 10:25:46 +0530 Subject: [PATCH 1/2] Create 0201-0300.md Added 100 gfg basic questions --- dsa-problems/gfg-problems/basic/0201-0300.md | 623 +++++++++++++++++++ 1 file changed, 623 insertions(+) create mode 100644 dsa-problems/gfg-problems/basic/0201-0300.md diff --git a/dsa-problems/gfg-problems/basic/0201-0300.md b/dsa-problems/gfg-problems/basic/0201-0300.md new file mode 100644 index 000000000..8db1045eb --- /dev/null +++ b/dsa-problems/gfg-problems/basic/0201-0300.md @@ -0,0 +1,623 @@ +--- +id: 0201-0300 +title: GFG basic problems 0201-0300 +sidebar_label: 0201-0300 +keywords: + - gfg problems + - gfg problems basic + - gfg problems problems +--- + + +export const problems = [ + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimize-string-value1010/1", + "solutionLink": "#", + "problemName": "Minimize string value" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-product-of-x-and-y-with-floornx-y3711/1", + "solutionLink": "#", + "problemName": "Sum of product of x and y with floor(n/x) = y" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/form-largest-number-from-digits5430/1", + "solutionLink": "#", + "problemName": "Form largest number from digits" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/pairs-of-prime-number2612/1", + "solutionLink": "#", + "problemName": "Pairs of prime number" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-n-th-term-in-the-series3926/1", + "solutionLink": "#", + "problemName": "Find N-th term in the series" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/pattern-jumping4855/1", + "solutionLink": "#", + "problemName": "Pattern Jumping" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-operatorsarithmetic-set-12417/1", + "solutionLink": "#", + "problemName": "Java Operators(Arithmetic) | Set 1" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/length-of-last-word5721/1", + "solutionLink": "#", + "problemName": "Length of Last word" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-array-puzzle/1", + "solutionLink": "#", + "problemName": "Sum Array Puzzle" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-number-which-contain-the-digit-d4144/1", + "solutionLink": "#", + "problemName": "Find the Number which contain the digit d" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/the-problem-of-identical-arrays3229/1", + "solutionLink": "#", + "problemName": "The problem of identical arrays" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-increasing-subarray3811/1", + "solutionLink": "#", + "problemName": "Longest increasing subarray" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-arithmetic-progression1842/1", + "solutionLink": "#", + "problemName": "Check Arithmetic Progression" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/three-distinct-factors5613/1", + "solutionLink": "#", + "problemName": "Three distinct factors" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/difference-series4345/1", + "solutionLink": "#", + "problemName": "Difference series" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/mega-sale1431/1", + "solutionLink": "#", + "problemName": "Mega Sale" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/substrings-with-similar-first-and-last-characters3644/1", + "solutionLink": "#", + "problemName": "Substrings with same first and last characters" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/doctors-clinic0431/1", + "solutionLink": "#", + "problemName": "Doctors Clinic" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-number-of-elements-between-two-given-elements-in-array4044/1", + "solutionLink": "#", + "problemName": "Count number of elements between two given elements in array" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-call-by-reference/1", + "solutionLink": "#", + "problemName": "C++ Call by reference" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/fibonacci-to-n0811/1", + "solutionLink": "#", + "problemName": "Fibonacci to N" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-triplet-sum-in-array0129/1", + "solutionLink": "#", + "problemName": "Maximum triplet sum in array" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-stl-set-5-queue/1", + "solutionLink": "#", + "problemName": "C++ STL | Set 5 (queue)" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-perfect-square5253/1", + "solutionLink": "#", + "problemName": "Check perfect square" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/sorting-employees5907/1", + "solutionLink": "#", + "problemName": "Sorting Employees" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-if-divisible-by-114724/1", + "solutionLink": "#", + "problemName": "Check if divisible by 11" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/triplet-family/1", + "solutionLink": "#", + "problemName": "Triplet Family" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-if-a-number-can-be-expressed-as-xy1606/1", + "solutionLink": "#", + "problemName": "Check if a number can be expressed as x^y" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/string-reversalunpublished-for-now5324/1", + "solutionLink": "#", + "problemName": "String Reversal" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-if-given-four-points-form-a-square3026/1", + "solutionLink": "#", + "problemName": "Check if given four points form a square" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-stl-set-3-map/1", + "solutionLink": "#", + "problemName": "C++ STL | Set 3 (map)" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/the-lazy-caterers-problem2527/1", + "solutionLink": "#", + "problemName": "The Lazy Caterer's Problem" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/perfect-squares-in-a-range2253/1", + "solutionLink": "#", + "problemName": "Perfect Squares in a Range" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/snake-case0219/1", + "solutionLink": "#", + "problemName": "Snake Case" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-the-numbers2359/1", + "solutionLink": "#", + "problemName": "Digits in a set" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/map-operations/1", + "solutionLink": "#", + "problemName": "Map Operations" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-product-pair3608/1", + "solutionLink": "#", + "problemName": "Minimum product pair" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/jays-apples2724/1", + "solutionLink": "#", + "problemName": "Jay's Apples" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/difference-between-highest-and-lowest-occurrence4613/1", + "solutionLink": "#", + "problemName": "Difference between highest and lowest occurrence" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/rock-paper-scissors2830/1", + "solutionLink": "#", + "problemName": "Rock Paper Scissors!" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/replace-the-bit3212/1", + "solutionLink": "#", + "problemName": "Replace the Bit" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/change-all-even-bits-in-a-number-to-03253/1", + "solutionLink": "#", + "problemName": "Change all even bits in a number to 0" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/message-spreading4258/1", + "solutionLink": "#", + "problemName": "Message Spreading" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/make-a-distinct-digit-array2007/1", + "solutionLink": "#", + "problemName": "Make a Distinct Digit Array" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/mind-game3637/1", + "solutionLink": "#", + "problemName": "Mind Game" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/smallest-number-repeating-k-times3239/1", + "solutionLink": "#", + "problemName": "Smallest number repeating K times" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/last-duplicate-element-in-a-sorted-array5539/1", + "solutionLink": "#", + "problemName": "Last duplicate element in a sorted array" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-arraylist5312/1", + "solutionLink": "#", + "problemName": "Java Collection | Set 1 (ArrayList) Part-1" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-out-the-team0025/1", + "solutionLink": "#", + "problemName": "Binary Shift to Divide" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-perfect-square2503/1", + "solutionLink": "#", + "problemName": "Check perfect square" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/set-operations/1", + "solutionLink": "#", + "problemName": "Set Operations" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-a-speed-breaker5249/1", + "solutionLink": "#", + "problemName": "C++ | A Speed Breaker" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/strong-numbers4336/1", + "solutionLink": "#", + "problemName": "Strong Numbers" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/the-amazing-number0459/1", + "solutionLink": "#", + "problemName": "The amazing number" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-distinct-elements-15115/1", + "solutionLink": "#", + "problemName": "Sum of distinct elements for a limited range" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/strong-numbers3315/1", + "solutionLink": "#", + "problemName": "Strong Numbers" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/sort-the-half-sorted2157/1", + "solutionLink": "#", + "problemName": "Sort the Half Sorted" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-k-smallest-elements-in-their-original-order5407/1", + "solutionLink": "#", + "problemName": "Print K smallest elements in their original order" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/average-count-array2215/1", + "solutionLink": "#", + "problemName": "Average Count Array" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/merge-and-sort5821/1", + "solutionLink": "#", + "problemName": "Merge and Sort" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/rearranging-array1648/1", + "solutionLink": "#", + "problemName": "Rearranging array" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/confused-pappu5749/1", + "solutionLink": "#", + "problemName": "Confused pappu" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/zero-number2158/1", + "solutionLink": "#", + "problemName": "Duck Number" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-anagram-strings3549/1", + "solutionLink": "#", + "problemName": "Anagram Strings" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/compare-two-large-numbers3413/1", + "solutionLink": "#", + "problemName": "Compare two Large Numbers" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/regex-python/1", + "solutionLink": "#", + "problemName": "Regex - Python" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/reverse-a-string-with-spaces-intact5213/1", + "solutionLink": "#", + "problemName": "Reverse a string with spaces intact" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-digits-divisibility5311/1", + "solutionLink": "#", + "problemName": "Sum of Digits Divisibility" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/smallest-power-of-2-greater-than-or-equal-to-n2630/1", + "solutionLink": "#", + "problemName": "Smallest power of 2 greater than or equal to n" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-area2642/1", + "solutionLink": "#", + "problemName": "Maximum Area" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/shortest-un-ordered-subarray3634/1", + "solutionLink": "#", + "problemName": "Shortest un-ordered subarray" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/parties-and-seats/1", + "solutionLink": "#", + "problemName": "Parties and seats" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/reducing-walls4443/1", + "solutionLink": "#", + "problemName": "Reducing Walls" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-sorted-rows2702/1", + "solutionLink": "#", + "problemName": "Count Sorted Rows" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/missing-number-in-shuffled-array0938/1", + "solutionLink": "#", + "problemName": "Missing number in shuffled array" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/krishnamurthy-number1323/1", + "solutionLink": "#", + "problemName": "Krishnamurthy number" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/area-of-a-triangle5739/1", + "solutionLink": "#", + "problemName": "Area of a triangle" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/celsius-to-fahrenheit-conversion5212/1", + "solutionLink": "#", + "problemName": "Celsius to Fahrenheit Conversion" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/largest-product/1", + "solutionLink": "#", + "problemName": "Largest product" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/good-string5712/1", + "solutionLink": "#", + "problemName": "Good String" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-inheritance-introduction/1", + "solutionLink": "#", + "problemName": "C++ Inheritance introduction" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/riyas-test1450/1", + "solutionLink": "#", + "problemName": "Same frequency in two halves" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/shortest-direction4201/1", + "solutionLink": "#", + "problemName": "Shortest direction" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-numbers-divisible-by-m1524/1", + "solutionLink": "#", + "problemName": "Count numbers divisible by M" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-a-integer-is-power-of-3-or-not3850/1", + "solutionLink": "#", + "problemName": "Check an Integer is power of 3 or not" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/series-x14741/1", + "solutionLink": "#", + "problemName": "Series X1" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/the-spider-steps3600/1", + "solutionLink": "#", + "problemName": "The Spider Steps" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimize-sum-of-alternate-product2033/1", + "solutionLink": "#", + "problemName": "Minimize sum of alternate product" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/factors-sum2016/1", + "solutionLink": "#", + "problemName": "Factors Sum" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/finger-game1755/1", + "solutionLink": "#", + "problemName": "Finger Game" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-fifth-powers-of-the-first-n-natural-numbers3415/1", + "solutionLink": "#", + "problemName": "Sum of fifth powers of the first n natural numbers" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-classes-introduction/1", + "solutionLink": "#", + "problemName": "C++ Classes Introduction" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/fake-profile3906/1", + "solutionLink": "#", + "problemName": "Fake Profile" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/xor-of-all-elements0736/1", + "solutionLink": "#", + "problemName": "XOR of all elements" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/product-sum3012/1", + "solutionLink": "#", + "problemName": "Product Sum" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/magical-string3653/1", + "solutionLink": "#", + "problemName": "Magical String[Duplicate Problem]" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-collection-set-3-hashmap/1", + "solutionLink": "#", + "problemName": "HashMap Operations" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/student-record1752/1", + "solutionLink": "#", + "problemName": "Student record" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/making-elements-distinct3139/1", + "solutionLink": "#", + "problemName": "Making elements distinct" + }, + { + "difficulty": "Basic", + "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-integer-value1434/1", + "solutionLink": "#", + "problemName": "Maximum Integer Value " + } +] + + +