Netcore Second Round Coding Question and Answers | Treasure Room Solution See in Comment Box |Python

Netcore Backend Developer Hiring Challenge November 2024: Round 1

Backend Developer
Experience: 0-8 years
Compensation: As per company benchmark
Job Location: Mumbai
The Coder we are looking for:

0-8 years of experience in backend development with expertise on any of the following programming languages: Java and Go.
Ability to write clean code
Strong knowledge of data structures and knack for solving complex problems at scale.
Good understanding of the concept of concurrency and ability to write fault tolerant code.

Eligibility Criteria:

Years of experience: 0 - 5 years
Skills: DS & Algo
Batch:- All Batches Available

Challenge Format:

Round 1:
2 Basic Programming questions
Duration: 2 Hours 30 minutes (Champs will finish in an hour)
Programming language restricted to Python, Java and Go
The test starts from 8th November, 6 PM and is open until 17th November, 11:59 PM.

Round 2:
2 Programming Questions
Duration: 2 Hours 30 minutes (Could be much lesser if you’re a Champ)
Programming language restricted to Python, Java and Go
Participants clearing round one will be invited to attempt round 2

Do you want any courses, internships, placement trainings and many more..

Do you want like these more resources. Join Our Telegram Channel

Subscribe our Youtube Channel and Telegram Channel.

#itjobs #coding #python #softwaredeveloper #backend #softwarejobs

[ytsmart]

Treasure Room 2 full test cases passed code (Updated)
def solve(n, k, a):
m = {x: v for x, v in a} # Treasure map
s = sorted(m.keys()) # Sorted item IDs
max_v = 0 # Maximum treasure value
b_s = None # Best start ID
b_e = None # Best end ID
c_v = 0 # Current value
w_s = 0 # Window start

for e in range(len(s)):
id = s[e]
c_v += m[id]

while id - s[w_s] + 1 > k:
c_v -= m[s[w_s]]
w_s += 1

t = e - w_s + 1 # Items in window
t_v = c_v + (k - t) # Total value

if t_v > max_v:
max_v = t_v
b_s = s[w_s]
b_e = s[e]
elif t_v == max_v:
if s[w_s] < b_s:
b_s = min(b_s, s[w_s])
b_e = s[e]

return [max_v, (b_e - k) + 1]

n = int(input())
k = int(input())
nums = [list(map(int, input().split())) for _ in range(n)]

out = solve(n, k, nums)
print(' '.join(map(str, out)))

[geotechsmart]

Thank you so much❤❤❤❤ both coding questions 🙋executed

[Porus-uxdz]

Plz sir send the pdf of answer or screenshot of that plz it will be very helpful

[Joshi]

Can you help for ibm first round coding role associate system engineer on 25 January ?

[sandeepsadhu]

The treasure room coding question is extremely challenging. No one seems to be able to solve it, not even our faculty. At least in this video, the time limit has been reached. I paid 100₹ to other persons. But they were also not executed😢😢😢.

[chingari]

Thank you❤.. Anybody executed the treasure room question?

[Porus-uxdz]

I want to know that 2 answer is correct or not

[mdshahnawazalam]

max spices my test case not complete can any one give suggestions

[kishorereddy]

bro need round 2 ..ANSWERS ..PLEASE MAKE A VIDEO

[Porus-uxdz]

Did any get the interview mail or any mail after second round plz tell me its urgent

[mohitanand]

Bro can you please upload Braclaya technical developer solutions

[adityaraj-zmzk]

Why you are not sure in treasure division 2

[Hey_music]

@admin not working treasure room 2 code please give right code

[kushalgupta]

If we clear round-2 then would the interview be conducted online or offline?? Does anybody have any idea?

[maruthichowdary]

Can anyone post the detail question and it's testcases

[lqotlrf]

Treasure division 2 code is giving time limit exceeded error