#include<bits/stdc++.h>
using namespace std;

bool solve(vector<vector<char>>& grid, int maxTime) {
    int n = grid.size(), m = grid[0].size();
    vector<vector<int>> dist(n, vector<int>(m, INT_MAX));
    queue<pair<int, int>> q;
    q.push({0, 0});
    dist[0][0] = 0;
    vector<int> dx = {-1, 0, 1, 0};
    vector<int> dy = {0, 1, 0, -1};
    while (!q.empty()) {
        auto [x, y] = q.front();
        q.pop();
        for (int i = 0; i < 4; ++i) {
            int nx = x + dx[i], ny = y + dy[i];
            if (nx >= 0 && nx < n && ny >= 0 && ny < m && grid[nx][ny] == '.' && dist[nx][ny] > dist[x][y] + 1) {
                dist[nx][ny] = dist[x][y] + 1;
                q.push({nx, ny});
            }
        }
    }
    return dist[n - 1][m - 1] <= maxTime;
}

int main() {
    int n, m, maxTime;
    cin >> n >> m >> maxTime;
    vector<vector<char>> grid(n, vector<char>(m));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> grid[i][j];
        }
    }
    cout << (solve(grid, maxTime) ? "Yes" : "No") << endl;
    return 0;
}

Reach the end in time ✅

#include <iostream>
#include <vector>
#include <map>
#include <algorithm>

using namespace std;

int solve(int n, vector<int>& c, vector<int>& price) {
    map<int, vector<int>> mp;
    for (int i = 0; i < n; i++) {
        mp[c[i]].push_back(price[i]);
    }
   
    for (auto& x : mp) {
        sort(x.second.rbegin(), x.second.rend());
    }

    int sz = mp.size();
    long long ans = 0;
    vector<int> v;

    for (auto& x : mp) {
        v.push_back(x.second.back());
        x.second.pop_back();
    }
   
    sort(v.begin(), v.end());

    for (int i = 0; i < sz; i++) {
        ans += (i + 1) * 1LL * v[i];
    }

    for (auto& x : mp) {
        for (int num : x.second) {
            ans += sz * num;
        }
    }

    return ans;
}

Maximum Profit ✅

public static long findMissingInteger(ArrayList<Integer> arr, long k) {
        Collections.sort(arr);
        ArrayList<Integer> tmp = new ArrayList<>();
        tmp.add(arr.get(0));
        for (int i = 1; i < arr.size(); i++) {
            if (arr.get(i) != tmp.get(tmp.size() - 1)) {
                tmp.add(arr.get(i));
            }
        }
        int l = 0, r = tmp.size(), m;
        while (l < r) {
            m = (l + r) / 2;
            if (tmp.get(m) - 1 - m < k) {
                l = m + 1;
            } else {
                r = m;
            }
        }

        return l + k;
    }

Missing Positive Integers ✅

def solution(matrix):
    n = len(matrix)
    v = [[0, matrix[i][0]] for i in range(n)]

    for i in range(n):
        v[i][1] = matrix[i][0]
        row, col = i, 0
        while row >= 0 and col < n:
            v[i][0] += matrix[row][col]
            row -= 1
            col += 1
       
        row = i + 1
        col = n - 1
        while row < n and col >= 0:
            v[i][0] += matrix[row][col]
            row += 1
            col -= 1

    v.sort()

    return [v[i][1] for i in range(n)]

Ksolves hiring Freshers ( with 6 months of  traning in SAP-ABAP) .
Must be good in communication and Programming

Location :- Indore or Noida

Pls. Share your resume at Mohit.Kumar@Ksolves.com

Hello Everyone...!!!

Great opportunity for freshers #freshers

We are conducting Mass Hiring Off-campus drive for Freshers !!!
This is your opportunity to kickstart your career!

Eligibility criteria: B.E., B. Tech, MCA - 2023 and 2024 passed out batches. Only CSE & IT, First class with no backlogs.

Candidates with knowledge of Java, Spring Boot, and Java Microservices will be an added advantage. Certified candidates are preferred.

Zeal to learn new technologies, Good Attitude, Excellent communication (oral & verbal).

Experience: Fresher
Location: Hyderabad
Work Mode: WFO

Roles and Responsibilities:
* Design, build, and maintain efficient, reusable, and reliable Java code.
* Establish & Manage Software Configuration Management System.
* Analyze the system logs and initiate necessary measures to ensure high availability for the system.
* Carryout simulation and test for real jobs on test environment
Support troubleshooting of application software remotely on customer locations, as & when required
* Provide technical assistance against any software bugs encountered while installation, testing and commissioning at site.

Desired Candidate Profile:
* Having B.E/B.Tech/MCA from recognized University in 2023 & 2024.
* Freshers are invited to apply
* Excellent communication skills.
* High proficiency level in the English language (written and spoken)
* Good interpersonal, verbal, and written communication skills
* Demonstrated proficiency in product lines that you have worked
* Strong problem-solving skills ability to deliver quality code first time right
* Should have basic knowledge of OOPS concepts, multi-threading, core JAVA concepts and coding.

#freshers #freshershiring #hiringfresher

Interested candidates can share me their resume on duresh.p@federalsoftsystems.com

Thanks & Regards,
Duresh Patnaik,
7008935694,
Executive - Talent Acquisition

vector<vector<int>> solution(vector<vector<int>> image, int radius) {
    int rows = image.size();
    int cols = image[0].size();
    vector<vector<int>> blurred_image(rows, vector<int>(cols, 0));

    for (int i = 0; i < rows; ++i) {
        for (int j = 0; j < cols; ++j) {
            vector<int> neighbors;

            for (int r = max(0, i - radius); r < min(rows, i + radius + 1); ++r) {
                for (int c = max(0, j - radius); c < min(cols, j + radius + 1); ++c) {
                    if (r != i || c != j) {
                        neighbors.push_back(image[r][c]);
                    }
                }
            }

            if (!neighbors.empty()) {
                int mean_neighbors = accumulate(neighbors.begin(), neighbors.end(), 0) / neighbors.size();
                blurred_image[i][j] = (image[i][j] + mean_neighbors) / 2;
            } else {
                blurred_image[i][j] = image[i][j];
            }
        }
    }

    return blurred_image;
}

Autodesk ✅

def solution(board):
    board = list(map(list, zip(*board)))
    obstacles_to_remove = 0
    lowest_figure = len(board[0]) - 1
    for col in range(len(board)):
        if '*' in board[col]:
            lowest_part = board[col].index('*')
            lowest_figure = min(lowest_figure, lowest_part)
            obstacles_to_remove += board[col][:lowest_part].count('#')
    return obstacles_to_remove

Autodesk ✅