๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.61K 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
We are looking for FRESHERS. 
If you are someone who is looking to be part of a growing team, please share your updated profile on Pratham.Chilhate@lancesoft.in
Role: Trainee Recruiter
Experience: looking for MBA/B.E./BTech Fresher
Work location: Bangalore
Work Nature: Work from office only
Shifts: Day Shift
If you are looking for an amazing work culture and professional growth as a fresher. 
TEKsystems is hiring for one of our product-based company.
Kindly share your cvs to agopi@teksystems.com
Role : Remote Associate
Fresher with excellent written and Verbal communication skills
Location : Bangalore
NP: Immediate
TCS HackQuest

The Contest is open to students (enrolled in any recognized college /university / academic institute) in India who will be graduating in the academic year 2024 with any of the following degrees in any specialization:
Bachelor of Technology (B. Tech)
Bachelor of Engineering (B.E)
Master of Technology (M. Tech)
Master of Engineering (M.E.)
Bachelor of Computer Applications (B.C.A.)
Master of Computer Applications (M.C.A.)
Bachelor of Science (B.Sc. - B.S.)
Master of Science (M.Sc. - M.S.)

https://hackquest.tcsapps.com/
long solvee(vector<int>& nums) {
    long mini = 0, run = 0;

    for (int n : nums) {
        run += n;
        mini = min(mini, run);
    }

    return 1 - mini;
}

Stay positive โœ…
int fun(int a, int b){
    return (int)((int)pow(a, b) % (int)(pow(10, 9) + 7));
}

int raisingPower(vector<int> arr){
    if(arr.size()<3) return 1;
    int result = INT_MAX;
    int n = arr.size();
    for(int i = 1; i <= n - 2; i++){
        if(fun(arr[i], arr[i + 1]) >= fun(arr[i + 1], arr[i + 2])){
            result = min(result, i);
        }
    }
    return result + 1;
}


Analyzing arrays โœ…
๐Ÿ‘1