๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.6K subscribers
5.59K photos
3 videos
95 files
10.1K 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
public static int selectStock(int saving, int[] currentValue, int[] futureValue) {
        int n = currentValue.length;
        int[][] dp = new int[n + 1][saving + 1];

        for (int i = 1; i <= n; i++) {
            for (int j = 0; j <= saving; j++) {
                dp[i][j] = dp[i - 1][j];

                if (j >= currentValue[i - 1]) {
                    dp[i][j] = Math.max(dp[i][j], dp[i - 1][j - currentValue[i - 1]] + futureValue[i - 1] - currentValue[i - 1]);
                }
            }
        }

        return dp[n][saving];
    }

Selecting stocks โœ…
Swiggy
#include <bits/stdc++.h>
using namespace std;

int jumps(int flagHeight, int bigJump) {
    if (flagHeight <= bigJump)
        return 1;
   
    int remainingHeight = flagHeight - bigJump;
    int minJumps = remainingHeight / bigJump;
   
 
    if (remainingHeight % bigJump != 0)
        minJumps++;
   
    return minJumps + 1;
}

Jump to the flag โœ…
Swiggy
๐Ÿ‘1
int findMaxMinutes(int api_size, vector<int>& apiTimes) {
    sort(apiTimes.begin(), apiTimes.end());
    int maxMinutes = 0;
    int totalRunningTime = 0;
    for (int time : apiTimes) {
        totalRunningTime += time;
    }
    for (int time : apiTimes) {
        int simultaneousApps = totalRunningTime / time;
        maxMinutes = max(maxMinutes, simultaneousApps);
    }

    return maxMinutes;
}



Flipkart API
๐Ÿ‘Ž4๐Ÿ‘1
#define pll pair<long long,long long>
#define vll vector<long long>
#define ll long long
#define vvll vector<vector<long long>>
#define vpll vector<pair<long long,long long>>
class Solution {
public:
    bool isRobotBounded(string s) {
       
    ll x=0,y=0;
    ll d=0;
    vvll dir={{0,1},{1,0},{0,-1},{-1,0}};
    for(auto it:s)
    {
        if(it=='R') d=(d+1)%4;
        else if(it=='L') d=(d+3)%4;
        else x+=dir[d][0],y+=dir[d][1];
    }
    if(x==0 and y==0 or d>0) return 1;
    return 0;
    }
};

Encircular โœ…
๐Ÿ‘2
โ—๏ธAmazon Off Campus Drive 2024 Hiring AS ML Data Associate I | INR 2.6 to 3.6 LPAโ—๏ธ

๐Ÿ‘จโ€๐Ÿ’ปJob Role : ML Data Associate I
๐ŸŽ“Qualification : Any degree
๐ŸŽ–Location : Chennai
๐Ÿ’ฐSalary : INR 2.6 to 3.6 LPA

โญ•๏ธ Apply Fast :
https://fresherearth.blogspot.com/2024/03/amazon-off-campus-drive-2024-hiring-as.html

โœ… Direct Jobs :
https://t.me/addlist/wcoDjKedDTBhNzFl
๐Ÿ‘3
Looking for an SDET(QA) Intern for HSR Layout

Technical Requirements:

Sound understanding of the Phases of SDLC,
Hands on with any of the one coding language(Python /Java etc )
API validation & automation
Good to have but not mandatory: Selenium, Appium

2. Non-technical Requirements:
Mode: Work from Office (5days/week)
Base Location: Bangalore based / willing to relocate to Bangalore
Qualification: Freshers or final year students 2024 B Tech / BE / MCA / Equivalent

SDET Interview process:
1- Offline assessment test: 40 mins (aptitude & coding basics)
2- F-2-F Interview: 1 Hr - (Logical thinking & Coding)

Interested candidates please share your resume to Sreekanth.nair@mfine.co
int maxDepth(TreeNode* root) {
        if(!root)   return 0;
        int l=1+maxDepth(root->left);
        int r=1+maxDepth(root->right);
       return max(l,r);
    }

Infibeam height of tree โœ