13:12 Q10) I got a simpler solution: arr = [3,4,6,8,10,11] insert = 7 for i in range(len(arr)): if arr[i]>insert: res= arr[:i] + [insert] + arr[i:] break else: res = arr + [insert] print(res)
Sir nice video Can u make a video Ex: for one GB csv file how to decide number of worker nodes executors cores memory allocation for each executor etc etc
Bhai vo jo insert 7 at correct location vala question hai, jo aapne solution btaya usme how were they satisfied. O(N) solution diya aapne. We can do it using binary search in O(log N) because array is sorted. Ye poocha nhi unhone ki koi better approach hai ki nhi ?
Hi Manish, I have one question. I am technically sound in Java programming language but not having enough knowledge in python. Is it okay if we write the coding questions for Data Engineering interviews in our preferred language or do we need to write exclusively in Python?
It depends on data. So please ask the interviewer how you data looks like. There can be a case that he is partitioning the data based on Id column and one Id has way to much data than the other id's. So in that case salting will help. General thumb of rule for number of shuffle partition is to keep upto 4x time number of cores you have.
bhai i have 6 months exp in djnago and ruby on rails development domain. I want to work as a data engineer. I know ruby, java, python,numpy,pandas and POSTGRESQL. Now what should I do so that I can apply for jobs ? I never worked as a data engineer.How much time it will take and what more I have to learn to get data engineering job ?
I tried that 10th Q like below ################# a = [2,3,4,7,9,10] n = 1 pos = "" for i in range(len(a)): if a[i]>n: pos = i break if(pos!=""): a.insert(pos,n) else: a.append(n) print(a)
there is no fact table mentioned in this video .. generally in sql we follow normalisation ...fact table concept is more applicable in snowflake schema which is dw concept .
import math as m a=['[','{','(',')'] count=0 print(len(a)) l_n1=reversed(range(m.ceil(len(a)/2))) #to iter from the middle to start l_n2=range(m.floor(len(a)/2),len(a)) #to iter from middle to end print(l_n1,l_n2) for i,j in zip(l_n1,l_n2): print(a[i],a[j]) if a[i]=='(': if a[i]==chr(ord(a[j])-1): count+=1 if a[i]=='{': if a[i]==chr(ord(a[j])-2): count+=1 if a[i]=='[': if a[i]==chr(ord(a[j])-2): count+=1
if count==(len(a)/2): print(True) else: print(False) this my code for parenthesis checking !!!
@@herman4975 sorting will take minimum o(n logn) time complexity. And in interview I had to do with o(n) time complexity. What you said is correct but not an optimal solution. Hope I have answered your query
Solution for Q10 seems to be not working, here is the working solution: A = [2,3,7,9] B = 1 index =len(A) for x in range(len(A)): if A[x] > B: index = x A = A[:index] + [B] + A[index:] break if index == len(A): A = A + [B] print(A)
Hello Manish Bhai , Could you please check my solution for Question-10 (Solved using pointer) ?? arr = [3,6,8,12,15] #insert 7 at its correct location i = 7 l = 0 r= len(arr)-1 while l
13:12 Q10) I got a simpler solution:
arr = [3,4,6,8,10,11]
insert = 7
for i in range(len(arr)):
if arr[i]>insert:
res= arr[:i] + [insert] + arr[i:]
break
else:
res = arr + [insert]
print(res)
Wo sab to badhiya tha Bhai stack sunke bukhar choot gya mera , bro dhire thoda mujhe thoda time lag gya par samjh gya
Thank you, Bina paise liye aise content daalne ke liye bohot bohot shukriya
Really helpful ! I faced same questions in Walmart Interview
Hi , did you join Walmart?
@manishkumar we are loving your work , it's very helpful ❤
Much helpful for folks preparing for data engineering role. Thanks Manish Bhaiya
Great info ! Thank you for shairng.
Q.10
for ind in range(1,len(l)):
if l[ind-1] < a and l[ind] > 7:
l.insert(ind,a)
break
print(l)
Really gud information.. please kindly make a mini project for making data pipeline with Apache Kafka confluent
Thanks man , really helpful 👍
Sir pls make separate video on movie theatre booking system, explain broadly if possible then make on MySQL server pls...
Interesting and very helpful!!
Sir nice video
Can u make a video
Ex: for one GB csv file how to decide number of worker nodes executors cores memory allocation for each executor etc etc
Sure
Do u have to Answer in python only @manish kumar bhaiyya
Hey Manish
Were there any screening round for you before the technical round
Hello can please share SQL question as we’ll
Bhai vo jo insert 7 at correct location vala question hai, jo aapne solution btaya usme how were they satisfied. O(N) solution diya aapne. We can do it using binary search in O(log N) because array is sorted. Ye poocha nhi unhone ki koi better approach hai ki nhi ?
They did not. But yes we can do it using binary search
Hi Manish, I have one question. I am technically sound in Java programming language but not having enough knowledge in python. Is it okay if we write the coding questions for Data Engineering interviews in our preferred language or do we need to write exclusively in Python?
Hi Manish, what other questions were asked to you in HM last round ? anything related to tech or only behavioral ?
Bhai aap sql padhao na, acha se alag aproach se jese python padaba rahaho
how to decide shuffle partition, could you please explain how do you ans this question in interview
It depends on data. So please ask the interviewer how you data looks like. There can be a case that he is partitioning the data based on Id column and one Id has way to much data than the other id's. So in that case salting will help.
General thumb of rule for number of shuffle partition is to keep upto 4x time number of cores you have.
Bro if possible do these videos more and that too in english
If he makes in English I can’t understand
Can I make it curated for you, I want to improve my leading skills
Is it possible to switch from business analyst to data engineer while having skill in SQL and python
Baaki sikhna parega before switch
Hello manish, wanted to know where to practice and learn these python related program question like stack pop
Geeks for geeks, hacker rank and leetcode
15:08 instead of complicating code can we do this ??
a=[3,6,8,12,15]
b=7
a.append(b)
print(a)
a.sort()
print(a)
Interview me aisa nhi Hota hai. You can't use any inbuilt function or library. They are testing you logical skill not just programming knowledge
this was for fresher or for experienced person? Of how many year of experience was this for?
bhai i have 6 months exp in djnago and ruby on rails development domain. I want to work as a data engineer. I know ruby, java, python,numpy,pandas and POSTGRESQL. Now what should I do so that I can apply for jobs ? I never worked as a data engineer.How much time it will take and what more I have to learn to get data engineering job ?
What my video titled "how I bagged 12 offers" you will get to know what you are looking for
@@manish_kumar_1 But you have work experience in data engineering
finished watching
Bhai data analyst k baare m padna kaha s atart s kre aur 0 hai sbme aur 7 month exp h signalling domain m
Video Bana diya hai already
@@manish_kumar_1 can u provide m tha link
Hi Manish
Is it possible to switch from manual product QA to data engineer, after 5 years experience in QA
Yes you can do that. You will need to do a lot of practice on DE related tech stack
I tried that 10th Q like below
#################
a = [2,3,4,7,9,10]
n = 1
pos = ""
for i in range(len(a)):
if a[i]>n:
pos = i
break
if(pos!=""):
a.insert(pos,n)
else:
a.append(n)
print(a)
Hi Manish, did HR give feedback regarding final result ? what improvement areas they told to focus on ?
Need to improve on coding skill. That was the feedback
Directly connect with me on:- topmate.io/manish_kumar25
Sir, in data modeling question which one is the fact table
I will suggest you to search this on Google. You will get indepth answer there.
there is no fact table mentioned in this video .. generally in sql we follow normalisation ...fact table concept is more applicable in snowflake schema which is dw concept .
import math as m
a=['[','{','(',')']
count=0
print(len(a))
l_n1=reversed(range(m.ceil(len(a)/2))) #to iter from the middle to start
l_n2=range(m.floor(len(a)/2),len(a)) #to iter from middle to end
print(l_n1,l_n2)
for i,j in zip(l_n1,l_n2):
print(a[i],a[j])
if a[i]=='(':
if a[i]==chr(ord(a[j])-1):
count+=1
if a[i]=='{':
if a[i]==chr(ord(a[j])-2):
count+=1
if a[i]=='[':
if a[i]==chr(ord(a[j])-2):
count+=1
if count==(len(a)/2):
print(True)
else:
print(False)
this my code for parenthesis checking !!!
Bhai slow course karo mere jaisa logo ke lie batao na
Hi
Is Hadoop really needed for data engineering?
Are you asking Hadoop map reduce?
Yes he is asking Hadoop map reduce
I believe he is a perfect developer. Hope he pings me 😊
Hello sir, I am a 3rd student and want to get into data engineering what to do ?
1 programming language- python (preferred one)
2 Sql
3 Spark and Hadoop basics ( The definitive guide spark)
Q10, wont it be easier just append and then sort?
@@herman4975 sorting will take minimum o(n logn) time complexity. And in interview I had to do with o(n) time complexity. What you said is correct but not an optimal solution. Hope I have answered your query
why not u posting videos in English
Sorry bro. This series will be in hindi only. May be in future I will upload in English too
Can we write same code in java?
Yes you can.
Solution for Q10 seems to be not working, here is the working solution:
A = [2,3,7,9]
B = 1
index =len(A)
for x in range(len(A)):
if A[x] > B:
index = x
A = A[:index] + [B] + A[index:]
break
if index == len(A):
A = A + [B]
print(A)
Connect with me i can also provide you questions
What do they ask for 1 year experienced data engineer roles? Does data structure come into picture?
Easy questions aayenge coding ke. Baaki aapse expectation Kam hoga. May be easy to medium sql and easy coding
@@manish_kumar_1 thank you.
Slow neta ji
Hello Manish Bhai , Could you please check my solution for Question-10 (Solved using pointer) ??
arr = [3,6,8,12,15]
#insert 7 at its correct location
i = 7
l = 0
r= len(arr)-1
while l
bro can you please explain the solution