24:06 sir in this why we take string length 5 ... The string starts with 0 so the total character is 4 and than we so the xor operation than the answer become 5
for the coding question, to do it in O(n) complexity we could create an array of size m and set true for all the indices which are there in earthStones[ ]. Then find the count of stones which can be taken in O(n) time by only adding those stones whose corresponding index is false. This way we can avoid sorting the array.
To solve the coding question in O(n) complexity, we could create an array of size M and mark all those indices whose weight is given in comonStones[ ] array as false. then we just need to find the count of stones which could be taken and whose corresponding index is true. This avoids sorting the array.
"Absolutely invaluable content! 😄🚀 This video truly helped me fine-tune my Accenture interview preparation at the last minute. The coding questions and answers shared here were spot on and boosted my confidence. Kudos for sharing such relevant and practical insights. A big thank you for aiding me in acing my interview! 🙌👍"
Join our TA Support Group on Discord, where we will help you out with all your queries: 📍prepinsta.com/discord/ If you are new to Discord, please watch our tutorial here❤️: bit.ly/how-to-use-prepinsta-discord-server Also, to get CODING guidance give us an instant call on 8448440710.
m=int(input('enter the size of bag')) n=int(input('enter the no of stone as same as earth')) arr=eval(input('weight of common stones')) l=[] for i in range(1,m+1): l.append(i) a=set(l)-set(arr) b=list(a) x=b[0] y=b[1] z=b[2] for i in range(len(b)): for j in range(i+2,len(b)): for k in range(i+3,len(b)): if b[i]+b[j]+b[k]
Hey, You can refer the link: prepinsta.com/top-100-codes/ Follow our social media handles listed below to get instant updates 👇 Telegram- prepinsta.com/telegram/ Instagram- prepinsta.com/instagram/ WhatsApp- prepinsta.com/whatsapp/
Hey, You can check our Discord channel for all queries related to java . 👀❤ Join our TA Support Group on Discord, where we will help you out with all your technical queries: 📍prepinsta.com/discord/ If you are new to Discord, please watch our tutorial here❤️: bit.ly/how-to-use-prepinsta-discord-server We have dedicated material for Java, kindly reach out to us on 8448440710
Code in Java :
int weight = 14;
int n = 4;
int weights[] = {1,3,10,14};
ArrayList mars = new ArrayList();
//weights present in mars
for(int i = 1; i
24:06 sir in this why we take string length 5 ... The string starts with 0 so the total character is 4 and than we so the xor operation than the answer become 5
No , string length is always the no of characters present not the index of the last element.
Hey, we got pretty late with the response 🥺 How was your test?
for the coding question, to do it in O(n) complexity we could create an array of size m and set true for all the indices which are there in earthStones[ ]. Then find the count of stones which can be taken in O(n) time by only adding those stones whose corresponding index is false. This way we can avoid sorting the array.
To solve the coding question in O(n) complexity, we could create an array of size M and mark all those indices whose weight is given in comonStones[ ] array as false. then we just need to find the count of stones which could be taken and whose corresponding index is true. This avoids sorting the array.
"Absolutely invaluable content! 😄🚀 This video truly helped me fine-tune my Accenture interview preparation at the last minute. The coding questions and answers shared here were spot on and boosted my confidence. Kudos for sharing such relevant and practical insights. A big thank you for aiding me in acing my interview! 🙌👍"
Yayyy! Thank you for the feedback.
coding was difficult here.. took 30 mins to solve using recursion.. god no pls! esa matt dena
Join our TA Support Group on Discord, where we will help you out with all your queries:
📍prepinsta.com/discord/
If you are new to Discord, please watch our tutorial here❤️: bit.ly/how-to-use-prepinsta-discord-server
Also, to get CODING guidance give us an instant call on 8448440710.
u got same like this or a different pattern
I am watching this video on the last minute at 12 AM, tomorrow is my Accenture coding test lol :(
We are glad to help you at the last minute! We wish you all the best 💚
How did you wrote ur exam
Hii...how did uh wrote?
please reply back..i have exam tmrw getting too scared
Mine's at 9 and it's 8 now
I have it today 🌝
Thanks for your valuable support and teaching ❤
Yayyy! Thank you!
Done✅✅
m=int(input('enter the size of bag'))
n=int(input('enter the no of stone as same as earth'))
arr=eval(input('weight of common stones'))
l=[]
for i in range(1,m+1):
l.append(i)
a=set(l)-set(arr)
b=list(a)
x=b[0]
y=b[1]
z=b[2]
for i in range(len(b)):
for j in range(i+2,len(b)):
for k in range(i+3,len(b)):
if b[i]+b[j]+b[k]
We, the social media team is quite not confirmed about the answers but for sure our mentors will let you know soooon
How will we solve coding question in Cpp ?
Hey,
You can refer the link: prepinsta.com/top-100-codes/
Follow our social media handles listed below to get instant updates 👇
Telegram- prepinsta.com/telegram/
Instagram- prepinsta.com/instagram/
WhatsApp- prepinsta.com/whatsapp/
How to solve this question in java
Hey,
You can check our Discord channel for all queries related to java . 👀❤
Join our TA Support Group on Discord, where we will help you out with all your technical queries:
📍prepinsta.com/discord/
If you are new to Discord, please watch our tutorial here❤️:
bit.ly/how-to-use-prepinsta-discord-server
We have dedicated material for Java, kindly reach out to us on 8448440710
pseudocode questions too easy, unrealistic that accenture will give this
Questions similar to this will be asked.
Refer to this link- prepinsta.com/accenture/pseudo-code/
😁i got selected
did u get selected in accenture ?
Too much time consuming 🫠
Hey, we got pretty late with the response 🥺 How was your test?
PLEASE PROVIDE CODING QUESTIONS
Hey,
Please refer to this link: prepinsta.com/accenture/coding/
Question is too blur hard to understand
Hey, thanks for informing us! We will forward your message to concern team👍