๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
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
๐Ÿ“ข AccioJob Offline Hiring Drive with *StatusNeo*๐Ÿš€

๐Ÿ”นPosition: *React Native Developer*

๐Ÿ”นRequired Skills: *JavaScript, React Native, Redux, Typescript*

*Eligibility:*
- Degree:  B.Tech/MCA/M.Sc/M.Tech
- Branch: CS/IT
- Graduation Year: 2023 & 2024


*๐Ÿ”นDetails:*
- Work Location: Gurugram
- Salary: โ‚น4 - โ‚น4.5 LPA
- Bond Duration: 2 Years
- Work Mode: Work From Office
- Joining Date: Immediate Joiners preferred

*Evaluation Process:*
1๏ธโƒฃ Offline Assessment at:
๐Ÿ“*AccioJob Noida Skill Centre:* 2nd Floor, D69, Block-D, Sector 2, Noida.


2๏ธโƒฃ *Company Process:*
- 1 round of Technical Interview, 1 round of Technical & Managerial Interview

๐Ÿ’ผ *Important Note:* Bring your laptop for the test.

*๐ŸšจSlots cannot be changed once booked ๐Ÿšจ*

*๐Ÿ‘‰ Register here:* https://links.acciojob.com/42ivJmM ๐Ÿš€

If you have any questions, please contact the official support number only: https://wa.me/+918810316582 (DMs will not be replied to.)
#include<bits/stdc++.h>
using namespace std;

long min_moves(long l, long r, long k, long a, long b) {
    if (abs(b - a) % k != 0) return -1;
    return abs(b - a) / k;
}

int main() {
    long l, r, k, a, b;
    cin >> l >> r >> k >> a >> b;
    cout << min_moves(l, r, k, a, b) << endl;
    return 0;
}


Infosys โœ…
from collections import deque

def get_max_beauty(n, a):
    d = [(1, 0), (0, 1), (-1, 0)]
    q = deque([(0, 0, set([(0, 0)]), a[0][0])])
    mx = -float('inf')
    while q:
        x, y, v, b = q.popleft()
        if (x, y) == (n-1, n-1):
            mx = max(mx, b)
            continue
        for dx, dy in d:
            nx, ny = x + dx, y + dy
            if 0 <= nx < n and 0 <= ny < n and (nx, ny) not in v:
                nv = v.copy()
                nv.add((nx, ny))
                q.append((nx, ny, nv, b + a[nx][ny]))
    return mx


Infosys โœ