Add Leetcode 75 tag

absognety · Jul 7, 2024 · 465e8ad · 465e8ad
1 parent 3c58cf9
commit 465e8ad
Show file tree

Hide file tree

Showing 2 changed files with 8 additions and 2 deletions.
diff --git a/LeetCode/ProgrammingInGo/KidsWithGreatestCandies/maximumcandies.go b/LeetCode/ProgrammingInGo/KidsWithGreatestCandies/maximumcandies.go
@@ -1,4 +1,7 @@
-/*There are n kids with candies. You are given an integer array candies, where each candies[i] represents the number of candies 
+/*
+Leetcode 75
+
+There are n kids with candies. You are given an integer array candies, where each candies[i] represents the number of candies 
 the ith kid has, and an integer extraCandies, denoting the number of extra candies that you have.
 
 Return a boolean array result of length n, where result[i] is true if, after giving the ith kid all the extraCandies, 

diff --git a/LeetCode/ProgrammingInGo/ReverseWords/reverse.go b/LeetCode/ProgrammingInGo/ReverseWords/reverse.go
@@ -1,4 +1,7 @@
-/*Given an input string s, reverse the order of the words.
+/*
+Leetcode 75
+
+Given an input string s, reverse the order of the words.
 
 A word is defined as a sequence of non-space characters. The words in s will be separated by at 
 least one space.