Search posts, tags, users, and pages
Atharva
Grind & Hustle
// Brute force everyone knows class Solution { public: vector<int> twoSum(vector<int> &nums, int target) //O(n ^ 2) TC O(1) SC { vector<int> num; int n = nums.size(); for (int i = 0; i < n - 1; i++) { ...
Mohsin Khan
A Mechanical Graduate learning to Code
Thanks bro , like in the day 8 you have provided the leetcode question number , so I was able to go and try that question.
My title contains the question name If you basically search that on Google you will get the question
Nice Work bro, But try to provide the link for the questions as well.
Ok I will put that in comment section
Mohsin Khan
A Mechanical Graduate learning to Code
Thanks bro , like in the day 8 you have provided the leetcode question number , so I was able to go and try that question.