Eagleview is hiring Platform Engineer Intern

For 2023, 2024, 2025 grads

https://careers-apac-eagleview.icims.com/jobs/2119/job


Surface Moto is hiring Fullstack Intern

For 2024, 2025, 2026 grads

https://surfacemoto.zohorecruit.in/jobs/Careers/57611000002015088/Full-Stack-Developer


Le Boat is hiring SDE

For 2024, 2023, 2022 grads

https://globalcareers.travelopia.com/job/545682

https://krb-sjobs.brassring.com/TGnewUI/Search/home/HomeWithPreLoad?PageType=JobDetails&partnerid=26059&siteid=5016&jobid=745123&codes=Appcast_Indeed_O#jobDetails=745123_5016


WFH

https://www.instahyre.com/job-309989-analyst-trainee-at-deloitte-work-from-home/


Mass Hiring

https://amazon.jobs/en/jobs/2661757/data-engineer?cmpid=SPLICX0248M&ss=paid


Amazon music Hiring

Minimum index-accenture✅

CGI | Associate Engineer Fresher


https://cgi.njoyn.com/corp/xweb/xweb.asp?NTKN=c&clid=21001&Page=JobDetails&Jobid=J0624-1317&BRID=1138128&lang=1

LimeChat is hiring for multiple roles !

Backend , frontend, senior SDE , ML Engineer

https://www.linkedin.com/posts/nikhilgupta1997_hiring-engineering-ai-activity-7212310740114817024-lrDc?utm_source=share&utm_medium=member_android

Innovacer | 2023/2022 passouts | Data Analyst

https://boards.greenhouse.io/innovaccer/jobs/7269176002

Deeporion | Software Developer Trainee | 2022 / 2023 / 2024
| Bachelor's degree in Computer Science, Engineering, or a related field | Jaipur, Pune, Banglore, Indore

https://deeporion.com/career?jobId=2&title=Software+developer+trainee

Those who need to clear 💯

Revature
Fractal
wiley edge
Swiggy
De shaw
Uber
Redbus
Cognizant

ANY ONLINE EXAM HELP AVAILABLE WITH REMOTE ACCESS 💯💻

DM for help
@Mrtrueliving_ix

💯 Test clearance 👍

import os
from collections import defaultdict

def countVerticalPaths(cost, edge_nodes, edge_from, edge_to, k):
# Write your code here

children = defaultdict(list)
for i in range(edge_nodes - 1):
u, v = edge_from[i] - 1, edge_to[i] - 1
children[u].append(v)
children[v].append(u)

prefixes = defaultdict(int)
prefixes[0] = 1
stack = [(0, 0, False)]
visited = [False] * edge_nodes
visited[0] = True
count = 0

while stack:
node, current_sum, is_backtrack = stack.pop()
if is_backtrack:
prefixes[(current_sum + cost[node]) % k] -= 1
continue

current_mod = (current_sum + cost[node]) % k
count += prefixes[current_mod]
prefixes[current_mod] += 1
stack.append((node, current_sum, True))

for child in children[node]:
if not visited[child]:
visited[child] = True
stack.append((child, current_mod, False))

return count


DTCC -hack tree-python3✅