Bro in the first 5:26 time complexity will actually be n^3 because slicing an array takes O(n) in worst case and it also creates a seperate array on each time you slice so the space complexity will not be O(1). Correct if iam wrong
Dude to be honest these questions weren't asked in Oracle interview only....the first one is recursion backtracking and the second one is a dp....wtf...
Sir I have heard the student who tried solved these problems on 26th were facing problem while taking input. There are videos for C++ and java regarding the issue but none for python language . So please upload a video regarding that.
Tomorrow most probably Will upload the answers for shift 2 questions. There I am taking user input and discussed different ways to take input. Stay tuned.
Please make vedio on taking how to take diff inputs like list, matrix sperated by spaces and even dictionary or anything else in python for these automatic test case many got eof error and invalid literal for int()
Hi Sir i hope yoy are fine i want to ask is it mandatory to do Aptitude as i am proficient in coding but i lack in aptitude if i will solve both questions without aptitude, will i qualify
Fortunately the answer is "yes". Most of the service based companies ask for qualification so you need to practice that. But the thing is that you only need passing marks if you are able to solve coding questions. The tip is to study only important topics and not all. So if the question comes from your strong area then you will attempt everything like time, work, clock direction etc.
Hello Everyone, I hope you understood the concept. If you have any doubts please write in into comments. All the best.
int maxSubArray(int* nums, int numsSize) {
int count_sum=0;
int max=INT_MIN;
for(int i =0; i
int uniquePaths(int m, int n) {
int arr[m][n];
for(int i =0;i
@12:31 wrong , second if condition will also go arr[startIndex : i+1] (1,3,3) is wrong, (3,3,1) is correct group
Improvement will have to be done. I will start a series where I will update all of these questions
a=list(map(int,input().split()))
t=int(input())
for i in range(len(a)):
for j in range(i+1,len(a)):
s=a[i:j]
if sum(s)==t:
print(s,end='
')
The best explanation ever 👏👏.... Hats off to your effort.
Bro in the first 5:26 time complexity will actually be n^3 because slicing an array takes O(n) in worst case and it also creates a seperate array on each time you slice so the space complexity will not be O(1).
Correct if iam wrong
Dude to be honest these questions weren't asked in Oracle interview only....the first one is recursion backtracking and the second one is a dp....wtf...
Oracle hiring is different then tcs hiring!
Where can I find the codes which u explained in this video?
check description
sir you need to use the white color marker
Yes, I improved check the other videos
Sir I have heard the student who tried solved these problems on 26th were facing problem while taking input. There are videos for C++ and java regarding the issue but none for python language . So please upload a video regarding that.
Tomorrow most probably Will upload the answers for shift 2 questions. There I am taking user input and discussed different ways to take input.
Stay tuned.
Yes we faced issue cause they don't say to write function only but all the code from start to end and the input was sufficient to write the function 😢
Please make vedio on taking how to take diff inputs like list, matrix sperated by spaces and even dictionary or anything else in python for these automatic test case many got eof error and invalid literal for int()
Definitely. I will do that. Most problem in today I will upload shift 2 solutions in that I am taking user inputs.
i wrote the same code in java but tcs compiler didn't print the answer
I guess you should return the answer instead of printing it. Or I saw students who are not able to take input properly.
@@PrimeCoding19 it wasnt even made sure what to output clearly
Hi Sir i hope yoy are fine i want to ask is it mandatory to do Aptitude as i am proficient in coding but i lack in aptitude if i will solve both questions without aptitude, will i qualify
Fortunately the answer is "yes". Most of the service based companies ask for qualification so you need to practice that. But the thing is that you only need passing marks if you are able to solve coding questions.
The tip is to study only important topics and not all. So if the question comes from your strong area then you will attempt everything like time, work, clock direction etc.
@@PrimeCoding19 I dont have time now my exam will be on 30
Great video...
Thanks for your support.
Hi, Aryan ! Really its a great video and the effort put up by Aditya Mishra Sir is praiseworthy. no doubt.
@@satishanny thanks for commenting.
Aryan Mittal?
Ya You can refer him also.
bhaiya 26th ka daal diya please ab 29th aur 30th ka bhi daal dena
Yes Today I will upload the solution of every shift as well as resources/live interaction all. Stay tune subscribe the channel
I can't find the link for 2.5 hr video
ruclips.net/video/No6sw9xfww4/видео.htmlsi=2O7fv-ptzgPG6Q8I
I am mechanical,how can i crack this part of xam or how should i learn & what?? Please help😢🙏🏻
Watch 1 shot video on Array, Strings I have uploaded.
Then 1 shot on DBMS, SQL.
Solve all the tcs nqt 2024 shift question and you are good to go!