๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
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
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
vector<int> getNumStrings(int k, vector<vector<int>>& queries) {
    int max_length = 0;
    for (const auto& query : queries) {
        max_length = max(max_length, query[1]);
    }
   
    vector<int> dp(max_length + 1, 0);
    dp[0] = 1;
   
    for (int i = 1; i <= max_length; ++i) {
        dp[i] = dp[i - 1];
        if (i >= k) {
            dp[i] = (dp[i] + dp[i - k]) % MOD;
        }
    }
   
    vector<int> prefix_sum(max_length + 1, 0);
    for (int i = 1; i <= max_length; ++i) {
        prefix_sum[i] = (prefix_sum[i - 1] + dp[i]) % MOD;
    }
   
    vector<int> results;
    for (const auto& query : queries) {
        int L = query[0];
        int R = query[1];
        int result = (prefix_sum[R] - prefix_sum[L - 1] + MOD) % MOD;
        results.push_back(result);
    }
   
    return results;
}

DE Shaw โœ…
๐Ÿ‘1
long getMaxScore(int n, vector<vector<int>> score) {
  
   vector<vector<long long>> maxs(n+1,vector<long long>(11,0LL)) , d(n+1,vector<long long>(11,0LL));
   for(int i=0;i<=9;i++) maxs[0][i]=score[i][0];
   vector<long long> v1(11,0) ,v2(11,0);
   for(int i=1;i<n;++i){
       vector<long long> v3(11,0LL);
       v2=v3;
       for(int j=0;j<=9;j++){
           long long cur=-1,val=-1e12;
           for(int k=0;k<=9;k++){
               if(maxs[i-1][k]+score[k][j]>val){
                   val=maxs[i-1][k]+score[k][j];
                   cur=k;
               }
               v2[k]=max(v2[k],v1[j]+score[j][k]);
           }
           d[i][j]=cur;
           maxs[i][j]=val;
       }
       v1=v2;
   }
   long long res=0;
   for(int i=0;i<=9;i++) res=max(res,v1[i]);
   return res;
  
}

DE Shaw โœ…
vector<int> assignTasks(int n, vector<int>& s, vector<int>& e, int k, vector<int>& t) {
    vector<int> wt(k, -1);
    vector<pair<int, int>> srv;

    for (int i = 0; i < n; ++i) {
        srv.push_back({s[i], e[i]});
    }

    sort(srv.begin(), srv.end());

    auto findSrv = [&](int tt) -> int {
        int lo = 0, hi = n - 1;
        while (lo <= hi) {
            int mid = lo + (hi - lo) / 2;
            if (srv[mid].first <= tt && tt < srv[mid].second) {
                return 0;
            } else if (tt < srv[mid].first) {
                if (mid == 0 || tt >= srv[mid - 1].second) {
                    return srv[mid].first - tt;
                }
                hi = mid - 1;
            } else {
                lo = mid + 1;
            }
        }
        return -1;
    };

    for (int i = 0; i < k; ++i) {
        wt[i] = findSrv(t[i]);
    }

    return wt;
}


// getwaitingtime

DE Shaw โœ…
Transaction.java

package src.main.java;

public class Transaction implements Comparable<Transaction> {
    private int transactionId;
    private double amount;

    public Transaction(int transactionId, double amount) {
        this.transactionId = transactionId;
        this.amount = amount;
    }

    public int getTransactionId() {
        return transactionId;
    }

    public double getAmount() {
        return amount;
    }

    @Override
    public int compareTo(Transaction other) {
        return Integer.compare(this.transactionId, other.transactionId);
    }

    @Override
    public String toString() {
        return "Transaction{" +
                "transactionId=" + transactionId +
                ", amount=" + amount +
                '}';
    }
}

TransactionManager.java

package src.main.java;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Iterator;
import java.util.List;

public class TransactionManager {
    private List<Transaction> transactions;

    public TransactionManager() {
        this.transactions = new ArrayList<>();
    }

    public void addTransaction(Transaction transaction) {
        transactions.add(transaction);
    }

    public void removeTransactionById(int transactionId) {
        Iterator<Transaction> iterator = transactions.iterator();
        while (iterator.hasNext()) {
            Transaction transaction = iterator.next();
            if (transaction.getTransactionId() == transactionId) {
                iterator.remove();
                break;
            }
        }
    }

    public void sortTransactionsById() {
        Collections.sort(transactions);
    }

    public void sortTransactionsByAmount() {
        transactions.sort((t1, t2) -> Double.compare(t1.getAmount(), t2.getAmount()));
    }

    @Override
    public String toString() {
        StringBuilder sb = new StringBuilder();
        for (Transaction transaction : transactions) {
            sb.append(transaction.toString()).append("\n");
        }
        return sb.toString();
    }

    public static void main(String[] args) {
        TransactionManager manager = new TransactionManager();
        manager.addTransaction(new Transaction(1, 100.50));
        manager.addTransaction(new Transaction(2, 200.75));
        manager.addTransaction(new Transaction(3, 50.25));

        System.out.println("Transactions:");
        System.out.println(manager);

        manager.removeTransactionById(2);
        System.out.println("After removing transaction with ID 2:");
        System.out.println(manager);

        manager.sortTransactionsById();
        System.out.println("After sorting by transaction ID:");
        System.out.println(manager);

        manager.sortTransactionsByAmount();
        System.out.println("After sorting by amount:");
        System.out.println(manager);
    }
}
Company โ€“ Dreamwave AI
Role โ€“ Data Scientist
Exp. โ€“ Fresher
Apply Here โ€“ https://www.linkedin.com/jobs/view/3842532479

Company โ€“ Haptik
Role โ€“ Data Analyst / Data Scientist
Exp. โ€“ Fresher
Apply Here โ€“ https://www.linkedin.com/jobs/view/3964358871

Company โ€“ Altimetrik India Private Limited
Role โ€“ ER - Data Engineer
Exp. โ€“ 0-2 yrs
Apply Here โ€“ https://www.foundit.in/job/er-data-engineer-altimetrik-india-private-limited-chennai-india-31048181?searchId=b14d6bbc-34ba-406a-ae88-9d2f26f3171e

Company โ€“ TransUnion
Role โ€“ Sr. Analyst, Data Science and Analytics
Exp. โ€“ 0-2 yrs
Apply Here โ€“ https://www.foundit.in/job/sr-analyst-data-science-and-analytics-transunion-bengaluru-bangalore-india-31041168?searchId=13ace0f8-9787-4b14-9bbe-0b52bf02b52a

Company โ€“ Capgemini
Role โ€“ Data Analyst
Exp. โ€“ 0-2 yrs
Apply Here โ€“ https://www.foundit.in/job/data-analyst-capgemini-pune-india-31034812?searchId=54130929-c886-4cf4-98a1-5785c68d5022

Company โ€“ Walmart Global Tech India
Role โ€“ Data Scientist III
Exp. โ€“ 0-2 yrs
Apply Here โ€“ https://www.foundit.in/job/ind-data-scientist-iii-walmart-global-tech-india-bengaluru-bangalore-india-31027088?searchId=bc7d9c9f-b6bc-4749-a6ef-329e5828fed6

Company โ€“ American Express
Role โ€“ Analyst-Data Science
Exp. โ€“ 0-3 yrs
Apply Here โ€“ https://www.linkedin.com/jobs/view/3962967350
๐Ÿ‘1๐Ÿ˜ฑ1
๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
Photo
public static void main (String[] args) throws java.lang.Exception
  {
        int tes=1;
        StringBuilder sb=new StringBuilder();
      lable:for(int fuck=1;fuck<=tes;fuck++)
      {
            int n=sc.nextInt(),m=sc.nextInt(),k=sc.nextInt(),i,j,l,ans=-1;
            int a[][]=new int[n][m];
            for(i=0;i<n;i++)
            for(j=0;j<m;j++)
            a[i][j]=sc.nextInt();
            for(i=0;i<n;i++){
                int b[][]=new int[n][m];
                for(j=0;j<i;j++)
                for(l=0;l<m;l++) b[j][l]=a[j][l];
                for(j=i;j<Math.min(n,i+k);j++){
                    for(l=0;l<m;l++){
                    if(a[j][l]==2) b[j][l]=0;
                    else b[j][l]=a[j][l];
                    }
                }
                for(j=i+k;j<n;j++)
                for(l=0;l<m;l++) b[j][l]=a[j][l];
                for(j=0;j<m;j++){
                    int tmp=bfs(b,j,n,m);
                    ans=Math.max(ans,tmp);
                }
            }
            System.out.println(ans);
        }
        System.out.println(sb);
    }
    public static int bfs(int b[][],int j,int n,int m){
        int dis[][]=new int[3][2];
        dis[0][0]=1; dis[0][1]=-1;
        dis[1][0]=1; dis[1][1]=0;
        dis[2][0]=1; dis[2][1]=1;
        Queue<Pair> que=new LinkedList<>();
        int dp[][]=new int[n][m];
        for(int it[]:dp) Arrays.fill(it,-1);
        if(b[0][j]==2) return -1;
        dp[0][j]=b[0][j];
        que.add(new Pair(0,j));
        while(que.size()>0){
            int size=que.size();
            for(int i=0;i<size;i++){
                Pair top=que.poll();
                for(int it[]:dis){
                    int x=top.f+it[0];
                    int y=top.s+it[1];
                    if(x>=0 && x<n && y>=0 && y<m && dp[top.f][top.s]+((b[x][y]==2)?-1:b[x][y])>=0){
                        dp[x][y]=Math.max(dp[x][y],dp[top.f][top.s]+((b[x][y]==2)?-1:b[x][y]));
                        que.add(new Pair(x,y));
                    }
                }
            }
        }
        int max=-1;
        for(int i=0;i<m;i++) max=Math.max(max,dp[n-1][i]);
        return max;
    }

Pseudorandom Number generatorโœ…
#include <iostream>
#include <string>
#include <algorithm>
#include <climits>
using namespace std;
int getMinMoves(string s) {
    int n = s.length();
    int moves = 0;
    for (int i = 1; i < n; ++i) {
        if (s[i] != s[i - 1]) {
            int costPrev = abs(s[i] - s[i - 1]);
            int costNext = (i < n - 1) ? abs(s[i] - s[i + 1]) : INT_MAX;
            if (costPrev <= costNext) {
                s[i] = s[i - 1];
                moves += costPrev;
            } else {
                s[i + 1] = s[i];
                moves += costNext;
            }
        }
    }

    return moves;
}

String modification โœ…
๐Ÿ‘1