๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
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
Google hiring SWE

Many are reaching out to me for #referrals.

Due to the high volume, manually checking messages and downloading resumes is challenging.

Please use the link below to fill out the referral

https://docs.google.com/forms/d/e/1FAIpQLScM2vFlxe3DtxOZlUB82wMSRJi6gn0xXlD2JZcdpHXw1IlExg/viewform

This will allow me to view everything in a dashboard and refer you efficiently!
๐Ÿ‘2โค1
๐Ÿš€ Hiring Alert at TDPVista! ๐Ÿš€
We are excited to announce that TDPVista is hiring for the following roles:
- VueJS Developer
- MERN Stack Developer
- Flutter Developer

Job Details:

Internship Duration: 3 months
Post Placement Offer (PPO): Up to 6 LPA
Location: Indore & Bhopal
๐Ÿ“ง Email your resume to: ea@tdpvista.com
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll minimum_digit(ll n,ll sum)
{
    if(sum==0) return -1;
    if(n==1) return -1;
    if(sum>9*n) return -1;
    string ans;
    sum--;
    n--;
    for(ll i=n-1;i>0;i--)
    {
        if(sum>9) sum-=9,ans+=('9');
        else ans+=('0'+sum),sum=0;
    }
    ans+=('0'+sum+1);
    reverse(ans.begin(),ans.end());
    //cout<<ans<<endl;
    char c=ans[0];
    string tt="";
    tt+=c;
    tt+='0';
    tt+=ans.substr(1);
     return stoll(tt);  
}
signed main()
{
    ll n,sum; cin>>n>>sum;
    cout<<minimum_digit(n,sum);
}



Digit sum zero โœ…
๐Ÿ‘1
๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
#include<bits/stdc++.h> using namespace std; #define ll long long ll minimum_digit(ll n,ll sum) {     if(sum==0) return -1;     if(n==1) return -1;     if(sum>9*n) return -1;     string ans;     sum--;     n--;     for(ll i=n-1;i>0;i--)     {         if(sum>9)โ€ฆ
def minimum_digit(numDigits, sumDigits):
    # Write your code here
    if numDigits == 1 and sumDigits == 0:
        return -1
   
    # Start generating numbers from the smallest numDigits number
    for num in range(10(numDigits - 1), 10numDigits):
        digits = list(map(int, str(num)))
        digit_sum = sum(digits)
        digit_product = 1
       
        for digit in digits:
            digit_product *= digit
       
        if digit_sum == sumDigits and digit_product == 0:
            return num
   
    # If no number satisfies the conditions
    return -1

Digit sum zero โœ