๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.63K subscribers
5.61K photos
3 videos
95 files
10.6K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
Exciting Data Analyst Internship at GoMechanic.in

Are you ready to dive into the world of data analysis? GoMechanic is seeking Data Analyst Interns in Gurugram for a 3 Months full-time internship with a stipend of up to 15k. If you have a knack for Tableau, Python, and a passion for analytics, this is your chance to shine!

What You'll Get:
1. Hands-on experience with real projects
2. Flexible working hours
3. Internship certificate
4. Potential for a full-time role based on performance

Requirements:
1. Proficiency in Tableau and Python
2. Strong analytical and problem-solving skills
3. Excellent communication skills

Apply Now: Share your CV

https://www.linkedin.com/posts/lalitdabas228_exciting-data-analyst-internship-atgomechanicin-activity-7210495419452125185-aJfS?utm_source=share&utm_medium=member_ios
import sys
sys.setrecursionlimit(10**6)
def countVerticalPaths(costs, edge_nodes, from_lst, to_lst, k):
    children = [[] for _ in range(edge_nodes)]

    for u, v in zip(from_lst, to_lst):
        u -= 1
        v -= 1
        children[u].append(v)
        children[v].append(u)

    prefixes = [0] * k
    prefixes[0] = 1

    def g(n, s, p, result):
        curr = (s + costs[n]) % k
        result[0] += prefixes[curr]
        prefixes[curr] += 1

        for c in children[n]:
            if c != p:
                g(c, curr, n, result)

        prefixes[curr] -= 1

    result = [0]
    g(0, 0, -1, result)

    return result[0]


DTCC HackTree โœ…
๐Ÿ‘1