diff --git a/submissions/Dhriti/Arrays Question 1/Screenshot 2025-07-05 091623.png b/submissions/Dhriti/Arrays Question 1/Screenshot 2025-07-05 091623.png new file mode 100644 index 0000000..94693dd Binary files /dev/null and b/submissions/Dhriti/Arrays Question 1/Screenshot 2025-07-05 091623.png differ diff --git a/submissions/Dhriti/Arrays Question 1/solution1.cpp b/submissions/Dhriti/Arrays Question 1/solution1.cpp new file mode 100644 index 0000000..8ba078b --- /dev/null +++ b/submissions/Dhriti/Arrays Question 1/solution1.cpp @@ -0,0 +1,14 @@ +class Solution { +public: + vector twoSum(vector& nums, int target) { + unordered_map m; + for (int i = 0;; ++i) { + int x = nums[i]; + int y = target - x; + if (m.count(y)) { + return {m[y], i}; + } + m[x] = i; + } + } +}; \ No newline at end of file diff --git a/submissions/Dhriti/Arrays Question 2/Screenshot 2025-07-05 091955.png b/submissions/Dhriti/Arrays Question 2/Screenshot 2025-07-05 091955.png new file mode 100644 index 0000000..795cea7 Binary files /dev/null and b/submissions/Dhriti/Arrays Question 2/Screenshot 2025-07-05 091955.png differ diff --git a/submissions/Dhriti/Arrays Question 2/solution2.cpp b/submissions/Dhriti/Arrays Question 2/solution2.cpp new file mode 100644 index 0000000..fc38e94 --- /dev/null +++ b/submissions/Dhriti/Arrays Question 2/solution2.cpp @@ -0,0 +1,20 @@ +class Solution { +public: + int maxProfit(vector& prices) { + int minPrice = INT_MAX; + int maxProfit = 0; + + for (int price : prices) { + + if (price < minPrice) { + minPrice = price; + } + + else if (price - minPrice > maxProfit) { + maxProfit = price - minPrice; + } + } + + return maxProfit; + } +}; diff --git a/~$Leetcode DSA sheet by Fraz 1.xlsx b/~$Leetcode DSA sheet by Fraz 1.xlsx new file mode 100644 index 0000000..f6a2e22 Binary files /dev/null and b/~$Leetcode DSA sheet by Fraz 1.xlsx differ