Thank you so much ma'am. I request you. Please continue this placement series interview most important questions of leetcode . Please make atleast 150 questions of leetcode.
Nice video! It would be much better for the eyes if you could use a darker marker because that yellow one is hard to see with the contrast of the digital blackboard
Ma'am,This leetcode question constraints was less than O(n^2) the time complexity. Ma'am could you please explain it how solve this questions time complexity O(nlogn). Ma'am ,I request you.Please explain each questions with constraints.🙏
Mam if you possible pleaseeee start the series on ece branch language's like embedded c because your explanation is very simple and understanding If you can't still no problem.....😊
Very well mam please make the whole playlist on the whole leetcode. Becuase I am not having enough practice on the oneline practice platforms, I am not able to crack the second round of an interview in the Accenture Company today because of my coding problem. Please help me mam
My O(n) solution using C++ class Solution { public: vector twoSum(vector& nums, int target) { unordered_map lookup; for (int i = 0; i < nums.size(); i++) { int curr = nums[i]; int diff = target - curr; if (!lookup.empty() && lookup.find(diff) != lookup.end()) { return {lookup[diff], i}; } lookup.emplace(curr, i); } return {}; } };
Thank you so much ma'am.
I request you. Please continue this placement series interview most important questions of leetcode . Please make atleast 150 questions of leetcode.
Plz Do These JAVA + DSA videos mam Daily Leets code Questions so it is Easier to learn some tings from you
Yes, I want more questions from leetcode.
Great video! Would love to see more Java solutions for LeetCode problems. Your explanations are really helpful! Keep up the good work!
Thanks ma'am you made our study easier ❤
May god bless you,you are saving many lives
eng. hai ,doctor nhi
Thankyou ma'am, upload these types of coding problems some more, I think make series is on this is too good for learning.
My best programming teacher
Holy moly, please continue this series
Nice video! It would be much better for the eyes if you could use a darker marker because that yellow one is hard to see with the contrast of the digital blackboard
Thanks for the suggestion! I'll try to use a darker marker in future videos.
yes, I want more hard type leetcode question...
Upload more than one problem in daily mam
Please do more technical questions
Time complexity of this algorithm is O(n^2) but I need the time complexity O(n)
WILL discuss that in next video
@@pritammohanty7155 try two pointers approach
I commented my 0(n) C++ solution if you want to check it out.
@@JennyslecturesCSITok mam😊
just two pointer staff is is make it linear complexity
Ma'am,This leetcode question constraints was less than O(n^2) the time complexity.
Ma'am could you please explain it how solve this questions time complexity O(nlogn).
Ma'am ,I request you.Please explain each questions with constraints.🙏
I love the leetcode questions
Continue with the java(easy) leetcode problems....
Mam if you possible pleaseeee start the series on ece branch language's like embedded c because your explanation is very simple and understanding
If you can't still no problem.....😊
Mam please make a solution video on LeetCode problem 2484 and 730. Please mam
These two problem I am not understanding from any other youTuber.🙏🙏🙏🙏
keep uploading leetcode problem solutions and you will have 2M subs in no time
Yes mam this video is very helpful please keep it up mam
continue this series on leetcode problems
Very well mam please make the whole playlist on the whole leetcode. Becuase I am not having enough practice on the oneline practice platforms, I am not able to crack the second round of an interview in the Accenture Company today because of my coding problem. Please help me mam
Ma'am please make a video on Increasing Triplet Subsequence of Leetcode
Do it in python as well mam
I want more questions from leetcode
Miss Jenny madam,What about web development.can web development be the good career.
thanks
big support
Continue ma'am
Thank you so much
Kadavule Ajitheyy 💯
Ajitheyy kadavule 😂
mam please solve in python also
mam can you do leetcode series
Mam it is java then why u didn't used psvm (string []args)?
My O(n) solution using C++
class Solution {
public:
vector twoSum(vector& nums, int target) {
unordered_map lookup;
for (int i = 0; i < nums.size(); i++) {
int curr = nums[i];
int diff = target - curr;
if (!lookup.empty() && lookup.find(diff) != lookup.end()) {
return {lookup[diff], i};
}
lookup.emplace(curr, i);
}
return {};
}
};
Done (09/10/24) 🔥
Maam they ask me to use vector function in it
yes there are multiple ways to solve it.. I have discussed just the basic one ..brute force technique
Mam Mai toa CS branch le liya hu lekin laptop khridne ke paise nahi hi mere pass kya karu
I want best course cracking product based company
Solve leetcode problem s
Everyone knows O(n2) solution
👍🏻💫
Jenny
Mine is the first comment
Hii
HTML AND CSS PAR VIDEO....
PLS MA'ME....
When will you gain liberty from this teaching stress ?
its not stress for me....
310 like