InfyTQ Coding Questions 2023

#include<bits/stdc++.h>
using namespace std;
int smallestNumber (string num, int k)
{
    if(num.length()<=k)
        return 0;   
    unordered_map<char,int> pos;
    for(int i=0;i < num.length();i++)
    { 
       pos[num[i]]=i;}
    string temp=num;    
    sort(num.begin(),num.end());    
    string ans=num.substr(0,num.length()-k);
    vector < int > v;    
    for(int i=0;i < ans.length();i++)
    v.push_back(pos[ans[i]]); 
    sort(v.begin(),v.end());
    string ret;
    for(int i=0;i < v.size();i++) { ret+=temp[v[i]]; } int final=stoi(ret); return final; } int main() { string s; cin >> s;
    int k;
    cin >> k;
    int ans;
    cout << smallestNumber(s,k)%(int)(pow(10,9)+7);
    return 0;
}

import sys
n=input()
k=int(input())
n1=len(n)
if len(n)<=k:
 print(0)
 sys.exit()
a=''
i=0
while i < (n1-1) and k>0:
 if int(n[i])>int(n[i+1]):
  i+=1
  k-=1
  continue

 else:
  a+=n[i]
  i+=1

a+=n[i]
i+=1
if k>0:
 a=a[:-k]

if i<=(n1-1):
 while i < n1:
  a+=n[i]
  i+=1
print(int(a)%((10**9)+7))

import java.util.*;
class Main
{
  public static void main (String[]args)
  {
    Scanner sc = new Scanner (System.in);
    String s = sc.nextLine ();
    int k = sc.nextInt ();    
    int ans;
      System.out.println (smallestNumber (s, k) % (int) (1e9 + 7));
  }  
  static int smallestNumber (String num, int k)
  {
    if (num.length () <= k)
      return 0;  
    HashMap < Character, Integer > pos = new HashMap <> (); 
    for (int i = 0; i < num.length (); i++)
      {
    	pos.put (num.charAt (i), i);
      } 
    String temp = num;
    num = sortString (num);    
    String ans = num.substring (0, num.length () - k);
    ArrayList < Integer > v = new ArrayList <> ();   
    for (int i = 0; i < ans.length (); i++)
      {
	    v.add (pos.get (ans.charAt (i)));
      } 
      Collections.sort (v);
    String ret = "";   
    for (int i = 0; i < v.size (); i++)
      {
	    ret += temp.charAt (v.get (i));
      } 
      int result = Integer.parseInt ("" + ret);
    return result;
  }
  public static String sortString (String inputString)
  {
    char tempArray[] = inputString.toCharArray ();
    Arrays.sort (tempArray);
    return new String (tempArray);
  }
}

Run

#include<bits/stdc++.h>
using namespace std;
int func(int s,int p,int n)
{
  if(p==n-1) return 1;
  int ans=0;
  for(int i=s;i<=9;i++) ans+=func(i,p+1,n); return ans; } int main() { int n,a, ans=0; cin>>n;
  vector < int >  v(n);
  for(int i=0;i<n;i++) { cin>>a;
    for(int i=0;i<=9;i++)
    ans+=func(i,0,a);
  }
  cout<<ans;
}

n=int(input())
a1=[]
for i in range(n):
 a1.append(int(input()))
dp=[0]*201
dp[1]=10
dp[2]=55
a=[1]*10
i=3
while i<201:
 s=0
 for i1 in range(10):
   s+=a[i1]
   a[i1]=s
   dp[i]+=(s*(10-i1))
   dp[i]=dp[i]%((10**9)+7)
 i+=1
s1=0
for i in a1:
 s1+=dp[i]
 s1=s1%((10**9)+7)
print(s1)

import java.util.*;
class Main
{
  static int func(int s,int p,int n)
  {
    if(p==n-1) return 1;
    int ans=0;
    for(int i=s;i<=9;i++)
    ans += func(i,p+1,n);
    return ans;
  }
  public static void main (String[]args)
  {
    Scanner sc = new Scanner (System.in);
    int n = sc.nextInt ();
    int  ans=0;    
    for(int i=0; i<n; i++){       
        int a = sc.nextInt ();
        for(int j=0; j <=9; j++)
           ans+=func(j,0,a);       
    }    
    System.out.println (ans);
  }
}