๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.63K subscribers
5.59K photos
3 videos
95 files
10.2K 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
Hiring !!!!!!!!!!

Job.2
Job Title :  Conduent Off Campus Drive 2023 Hiring Freshers As IT Test Engineer For BE/BTech/ME/MTech
Apply Link :  https://professional-enjobs-conduent.icims.com/jobs/80126/job


Job.3
Job Title :  KPMG International Off Campus Drive 2023 Hiring Freshers As Associate Consultant For BE/BTech/MCA/ME/MTech
Apply Link :  https://ejgk.fa.em2.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1/requisitions/preview/INTG1006926


Job.4
Job Title :  Barclays Freshers Recruitment As ETL Developer For BE/BTech/BCA/MCA/ME/MTech
Apply Link :  https://search.jobs.barclays/job/-/-/22545/47662215888





Job.6
Job Title :  GEA Group Off Campus Drive 2023 Hiring Freshers As Graduate Engineer Trainee For BE/BTech/ME/MTech
Apply Link :  https://www.gea.com/en/company/careers/apply-now/item.jsp?job=JR-0023918


Job.7
Job Title :  HSBC Off Campus Freshers Hiring As Management Trainee For All Graduates
Apply Link :  https://mycareer.hsbc.com/en_GB/external/PipelineDetail/Management-Trainee/186684


Job.8
Job Title :  Apple Looking To Hire For QA Engineer Role- Apply Now
Apply Link :  https://jobs.apple.com/en-us/details/200404146/qa-engineer?team=SFTWR


Job.9
Job Title :  Schwing Stetter Off Campus Freshers Hiring For Trainee Role- Apply Now
Apply Link :  https://schwingstetterindia.cluster2.openings.co/#!/job-view/get-self-loading-mixer-sales-bangalore-karnataka-india-communication-presentation-skills-lead-generation-sales-marketing-willing-to-travel-2023042411140211





Job.11
Job Title :  Tech Mahindra Freshers Recruitment | Customer Care Representative | Noida
Apply Link :  https://www.naukri.com/job-listings-customer-care-representative-tech-mahindra-noida-delhi-ncr-0-to-3-years-190423009118?


Job.12
Job Title :  Emerson Recruitment | Graduate Engineer Trainee / Trainee | 2023 Batch | Chennai
Apply Link :  https://www.naukri.com/job-listings-graduate-engineer-trainee-trainee-emerson-chengalpattu-chennai-0-to-1-years-060423005394?


Job.13
Job Title :  Datavail Recruitment | Trainee Database Administrator (0-3 years) | Hyderabad, Mumbai
Apply Link :  https://eifn.fa.us6.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_2001/job/468?


Job.14
Job Title :  Anion Healthcare Recruitment | AR Caller (0-4 years) | Hyderabad
Apply Link :  https://www.naukri.com/job-listings-opening-for-the-position-ar-caller-anion-healthcare-services-hyderabad-secunderabad-0-to-5-years-190123910442?


Job.15
Job Title :  Dover Recruitment | Technical Support Engineer | 2023 Batch | Bangalore
Apply Link :  https://www.naukri.com/job-listings-technical-support-engineer-dover-bangalore-bengaluru-0-to-1-years-070323006967?


Job.16
Job Title :  TEKsystems Recruitment | L1 Server / Storage Support Engineer | Bangalore
Apply Link :  https://jobs.en-in.teksystems.com/88Dnmh/l1-serverstorage-support-engineer-helpdesk-support-bangalore-1646599?
๐Ÿ‘2
class Node:
    def init(self, val):
        self.val = val
        self.left = None
        self.right = None

class BST:
    def init(self, val):
        self.root = Node(val)

    def insert(self, val):
        curr = self.root
        while True:
            if val < curr.val:
                if curr.left is None:
                    curr.left = Node(val)
                    break
                else:
                    curr = curr.left
            else:
                if curr.right is None:
                    curr.right = Node(val)
                    break
                else:
                    curr = curr.right

    def max_path_sum(self, node):
        if node is None:
            return 0
        left_sum = self.max_path_sum(node.left)
        right_sum = self.max_path_sum(node.right)
        return node.val + max(left_sum, right_sum)

def max_path_sum_after_inserting(A):
    bst = BST(A[0])
    max_sum = bst.max_path_sum(bst.root)
    for i in range(1, len(A)):
        bst.insert(A[i])
        max_sum = max(max_sum, bst.max_path_sum(bst.root))
    return max_sum

Maximum Path Sumโœ…
Airbus Exam
๐Ÿ”ฅ2