𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅ #HackerEarth Minimum addition - Python HackerEarth Solution - Amazon Exam Code

https://stupidtechy.me/threads/minimum-addition-python-hackerearth-solution-amazon-exam-code.184/

StupidTechy.Me

HackerEarth - Minimum addition - Python HackerEarth Solution -...

Minimum addition - Python HackerEarth Solution - Amazon Exam Code
Solutions -

Minimum addition - Python HackerEarth Solution - Amazon Exam Code

1.18K views🧐, 14:29

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerEarth Minimum Operations - Python HackerEarth Solution - Amazon SDE Exam Code

https://stupidtechy.me/threads/minimum-operations-python-hackerearth-solution-amazon-sde-exam-code.186/

✅✅✅#HackerEarth Minimum addition - Python HackerEarth Solution - Amazon SDE Exam Code

https://stupidtechy.me/threads/minimum-addition-python-hackerearth-solution-amazon-sde-exam-code.184/

✳️Both Questions were solved and working 100% fine...Enjoy and Share with others🦋

1.2K views🧐, 20:36

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerEarth Help Michael Scott - Python HackerEarth Solution - SIEMENS Exam Code

https://stupidtechy.me/threads/help-michael-scott-python-hackerearth-solution-siemens-exam-code.187/

StupidTechy.Me

HackerEarth - Help Michael Scott - Python HackerEarth Solution -...

Help Michael Scott - Python HackerEarth Solution - SIEMENS Exam Code
Solutions (Python 3)-

Help Michael Scott - Python HackerEarth Solution - SIEMENS Exam Code

1.21K views🧐, 20:50

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Forwarded from Coding Interview ⛥

✅✅✅#HackerEarth - Summation Program - Python HackerEarth Solution

https://stupidtechy.me/threads/summation-program-python-hackerearth-solution.221/

Telegram - t.me/StupidTechyOfficial

588 views10:17

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerEarth The Big Game - Python HackerEarth Solutions

https://stupidtechy.me/threads/the-big-game-python-hackerearth-solutions.242/

StupidTechy.Me

HackerEarth - The Big Game - Python HackerEarth Solutions

The Big Game - Python HackerEarth Solutions

The big game There are two teams T1 and T2 playing a game. Both the teams have players. The power of each player of TI is represented in an array...

850 views12:09

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅#HackerEarth Breaking a String - HackerEarth Python Solutions

https://stupidtechy.me/threads/breaking-a-string-hackerearth-python-solutions.258/

StupidTechy.Me

HackerEarth - Breaking a String - HackerEarth Python Solutions

Breaking a String - HackerEarth Python Solutions
Python 3 - Solution
(Hidden text: Visit the forum thread!)

816 viewsサンケットクマール, 20:19

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerEarth Maximum Similarity - C++ HackerEarth Solutions

https://stupidtechy.me/threads/maximum-similarity-c-hackerearth-solutions.263/

StupidTechy.Me

HackerEarth - Maximum Similarity - C++ HackerEarth Solutions

606 viewsサンケットクマール, 08:43

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerEarth Candidate details - SQL HackerEarth Solution (SQL Questions)

https://stupidtechy.me/threads/candidate-details-sql-hackerearth-solution-sql-questions.264/

610 viewsサンケットクマール, 08:49

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerEarth Greater Orders - SQL HackerEarth Solution (SQL Questions)

https://stupidtechy.me/threads/greater-orders-sql-hackerearth-solution-sql-questions.265/

StupidTechy.Me

HackerEarth - Greater Orders - SQL HackerEarth Solution (SQL...

Greater Orders - SQL HackerEarth Solution (SQL Questions)
Problem Name - Greater Orders
Problem Statement
A company maintains information about its orders in a table called ORDERS.
(Hidden text...

578 viewsサンケットクマール, 08:55

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerEarth Record of students - SQL HackerEarth Solution

https://stupidtechy.me/threads/record-of-students-sql-hackerearth-solution.266/

StupidTechy.Me

HackerEarth - Record of students - SQL HackerEarth Solution

Record of students - SQL HackerEarth Solution
Problem Name - Record of students
Problem Statement
Write an SQL query to select the names of the students who have attended all the lectures of...

648 viewsサンケットクマール, 09:00

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerEarth Retail stores - SQL HackerEarth Solution (SQL Questions)

https://stupidtechy.me/threads/retail-stores-sql-hackerearth-solution-sql-questions.267/

StupidTechy.Me

HackerEarth - Retail stores - SQL HackerEarth Solution (SQL Questions)

Retail stores - SQL HackerEarth Solution (SQL Questions)
Problem Name - Retail stores
Problem Statement
You are given the details of a retail outlet. Your task is to analyze the data from the...

729 viewsサンケットクマール, 09:11

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerEarth Bank Transactions - HackerEarth Solution (SQL Questions)

https://stupidtechy.me/threads/bank-transactions-hackerearth-solution-sql-questions.268/

StupidTechy.Me

HackerEarth - Bank Transactions - HackerEarth Solution (SQL Questions)

Bank Transactions - HackerEarth Solution (SQL Questions)
Problem Name - Bank Transactions
Problem Statement
You are a bank employee and you have been given two tables. One table contains the...

918 viewsサンケットクマール, 09:18

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerEarth Call duration - SQL Questions - HackEarth Solutions

715 viewsサンケットクマール, 14:47

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerEarth The Abandoned City - C++ Solution

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

    #define ll long long

    int main(){
        ll n;
        cin>>n;
        ll arr[100005];
        for(ll i=1;i<=n;i++){
            cin>>arr[i];
        }
        ll k;
        cin>>k;
        ll pre[100005];
        pre[0]=0;
        
        for(ll i=1;i<=n;i++){
            pre[i] = pre[i-1]+arr[i];
        }
        if(pre[n]<k){
            cout<<-1<<"\n";
        }
        else{
        ll ans = INT_MAX;
        for(ll i=1;i<=n;i++){
            ll l=i;
            ll r=n;
            ll mid;
            while(l<=r){
                //cout<<l<<" "<<r<<"\n";
                mid = (l+r)/2;
                if(pre[mid]-pre[i-1]>=k){
                    //cout<<mid<<"\n";
                    ans = min(ans,mid-i+1);
                    r=mid-1;
                }
                else
                    l=mid+1;
            }
                    
        }
        cout<<ans<<"\n";
        }
        return 0;
    }

802 viewsサンケットクマール, 14:48

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerEarth Closest to Zero - Java Solutions

import java.util.*;
import java.lang.*;
import java.io.*;
class Main
{
    public static void main (String[] args) throws java.lang.Exception
    {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for(int i=0;i<n;i++)
        a[i]=sc.nextInt();
        int curr = 0;
        int ans = a[0];
        Arrays.sort(a);
        for (int i=0; i < a.length; i++){
            curr = a[i] * a[i];
            if ( curr <= (ans*ans) )  {
                ans = a[i];
            }
        }
        System.out.println(ans);
    }
}

682 viewsサンケットクマール, 14:58

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerEarth Maximum Similarity - C++ HackerEarth Solutions

#include <bits/stdc++.h>

using namespace std;
int main()
{
    int t;
    cin>>t;

    while(t--)
    {
        string str1, str2;
        cin>>str1>>str2;

        map<char,int> mp2;

        for(int i=0;i<str2.size();i++)
        mp2[str2[i]]++;

        int result=0;

        for(int i=0;i<str1.size();i++)
        {
            if(mp2[str1[i]]>0)
            {
                result++;
                mp2[str1[i]]--;
            }

            else
            break;
        }
        cout<<result<<endl;
    }
    return 0;
}

❤1

642 viewsサンケットクマール, 15:02

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerEarth Coin collector - C++ HackerEarth Solutions

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

long long solve (int N, vector<long long> A, int X) {
    vector<long long>dp(N);     
    long long best_odd_score, best_even_score;
    if (A[0] % 2 == 0)
        best_even_score = A[0], best_odd_score = -X;
    else
        best_odd_score = A[0], best_even_score = -X;
    for (int i = 1; i < N; i++)
    {
        if (A[i] % 2)
        {
            dp[i] = max(best_odd_score + A[i], best_even_score - X + A[i]);
            best_odd_score = max(best_odd_score, dp[i]);
        }
        else
        {
            dp[i] = max(best_even_score + A[i], best_odd_score - X + A[i]);
            best_even_score = max(best_even_score, dp[i]);
        }
    }
    return dp[N - 1];
}

int main() {

    ios::sync_with_stdio(0);
    cin.tie(0);
    int T;
    cin >> T;
    for (int t_i = 0; t_i < T; t_i++)
    {
        int N;
        cin >> N;
        vector<long long> A(N);
        for (int i_A = 0; i_A < N; i_A++)
        {
            cin >> A[i_A];
        }
        int X;
        cin >> X;

        long long out_;
        out_ = solve(N, A, X);
        cout << out_;
        cout << "\n";
    }
}