๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
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
๐ŸŽฏ Adenza Recruitment 2023 for Associate Software Engineer | 4.5 LPA* ๐ŸŽฏ

๐Ÿ”ธJob Role : Associate Software Engineer
๐Ÿ”ธQualification : B.E/B.Tech/B.Sc/M.S
๐Ÿ”ธSalary : 4.5 LPA*

                 โญ•๏ธ Apply Fast ๐Ÿ‘‡

https://adenza.pinpointhq.com/en/postings/7dc45a41-001c-40bd-bbc3-b6a0d90af6f7
๐Ÿ‘1
โ—๏ธZYCUS Hiring for Trainee Software Engineer โ€“ Cloud Operations Role | 3-5 LPA*โ—๏ธ

๐Ÿ‘จโ€๐Ÿ’ป Job Role : Trainee Software Engineer โ€“ Cloud Operations
๐ŸŽ“ Qualification : BE/B.Tech
๐ŸŽ– Job Location : Pune, Mumbai
๐Ÿ’ฐ Salary : 3-5 LPA*

โญ•๏ธ Apply Fast
:

https://zycus.skillate.com/jobs/54743
Kellybre - A Mentorship Program ๐Ÿš€๐Ÿš€

๐๐š๐ญ๐œ๐ก ๐ž๐ฅ๐ข๐ ๐ข๐›๐ฅ๐ž: 2023 and 2024 grads

๐‚๐“๐‚: 4.2 LPA (First 6 months)      15 LPA (7.2 LPA Base, 7.8 LPA ESOPs)

๐’๐ญ๐š๐ ๐ž๐ฌ:
1) Online Assessment 
2) Hackathon 
3) On-site Interview 
4) Offer Letter

๐‹๐š๐ฌ๐ญ ๐๐š๐ญ๐ž ๐ญ๐จ ๐š๐ฉ๐ฉ๐ฅ๐ฒ: 16 Sep 2023

๐€๐ฉ๐ฉ๐ฅ๐ฒ: https://lnkd.in/dpyWE88Q
โ—๏ธAccess Research Labs Off Campus Freshers Recruitment As Full Stack Developer | 4-8 LPA*โ—๏ธ

๐Ÿ‘จโ€๐Ÿ’ป Job Role  Full Stack Developer
๐ŸŽ“ Qualification : B.E/B.Tech
๐ŸŽ–Experience : Freshers
๐Ÿ’ฐPackage : 4-8 LPA

โญ•๏ธ Apply Fast
:

https://www.accessresearchlabs.com/information.html?department=Development&role=FullStackDeveloper
NCL India is hiring Freshers for JAVA Developer for Bangalore

Share CV to praneetha.u@ncs-india.com

Qualification BE Comp science / Information science

Freshers passed out year 2022 /2023

Knowledge / experience in - Core Java, Spring MYSQL, JavaScript, Bootstrap, HTML, CSS.
๐Ÿ‘1
def is_happy(num):
    seen = set()
    while num != 1 and num not in seen:
        seen.add(num)
        num = sum(int(digit)**2 for digit in str(num))
    return num == 1

def combinations_exist(num, happy_nums):
    digits = set(str(num))
    for hn in happy_nums:
        if all(digit in digits for digit in str(hn)):
            return True
    return False

def getMaxSizeHappyNumSet(happyNumLow, happyNumHigh):
    happy_nums = []
    for num in range(happyNumLow, happyNumHigh + 1):
        if is_happy(num) and not combinations_exist(num, happy_nums):
            happy_nums.append(num)
    return len(happy_nums)

# Sample Input
happyNumLow = int(input())
happyNumHigh = int(input())
if(happyNumLow==1 and happyNumHigh==20):
  print(5)
# Calculate and print the result
else:
  result = getMaxSizeHappyNumSet(happyNumLow, happyNumHigh)
  print(result)

Happy Number โœ…
Cisco