# A Naive recursive python program to find minimum of coins

# to make a given change V

  

import sys

  

# m is size of coins array (number of different coins)

def minCoins(coins, m, V):

  

    # base case

    if (V == 0):

        return 0

  

    # Initialize result

    res = sys.maxsize

      

    # Try every coin that has smaller value than V

    for i in range(0, m):

        if (coins[i] <= V):

            sub_res = minCoins(coins, m, V-coins[i])

  

            # Check for INT_MAX to avoid overflow and see if

            # result can minimized

            if (sub_res != sys.maxsize and sub_res + 1 < res):

                res = sub_res + 1

  // https://t.me/Coding_human

    return res

  

# Driver program to test above function

coins = [9, 6, 5, 1]

m = len(coins)

V = 11

print("Minimum coins required is",minCoins(coins, m, V))

Python 3

Telegram:-  https://t.me/Coding_human

Guys ❤️

Infosys Exam 3 PM Solution
Telegram:- https://t.me/infosys_sp_dsp_all_code
https://t.me/Coding_human

Note : Some codes are already in the channel/group, you can search the code by their names.

C++
Lexicographicallysmallest

Telgram https://t.me/Coding_human

#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
string str;
cin >> str;
int n = str.length(), ans = 0;
for(int i = 0; i < n; i++){
if(str[i] == '5' || str[i] == '6')
continue;
else
ans += 1;
}
cout << ans << endl;
}
return 0;
}

Beautiful Number

Telegram:- https://t.me/Coding_human

// Word Subset
class Solution:
def wordSubsets(self, words1: List[str], words2: List[str]) -> List[str]:
ans = set(words1)
letters = {}
for i in words2:
for j in i:
count = i.count(j)
if j not in letters or count > letters[j]:
letters[j] = count
for i in words1:
for j in letters:
if i.count(j) < letters[j]:
ans.remove(i)
break
return list(ans)

Python 3

Telegram:- https://t.me/Coding_human

#include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll solve(ll n)
{


ll position = 1;
ll m = 1;

while (!(n & m)) {


m = m << 1;
position++;
}
return position;
}
int main() {
// your code goes here
ll n,p;
cin>>n;
vector<int> ans(n);
for(int i=0;i<n;i++)
{
cin>>p;

ans[i] = solve(p+1);

}
for(int i=0;i<n;i++)
cout<<ans[i]<<"\n";
return 0;
}

C++

Telegram:-https://t.me/Coding_human

Amazon Prime Members & Flipkart Plus Members Stay Super Active Tonight For Freedom Sale. ♥️🤩

Best loot deals milegi , iski guarantee humaari😍

https://t.me/DMADLootz/12969

Join Prime Before Sale : https://t.me/DMADLootz/11596

Most Important : Many Loots Will Be Live For Few Minutes Or Seconds, So Turn On Channel Notification & Pin The Channel On Top, So That You Won't Miss Any Loots.

Share Our Telegram Channel With Your Friends/Family Members for Upcoming Loots :
https://t.me/DMADLootz

⭕L&T Technical Interview Experience⭕

1) Overview of internship?
2) What you have learned from the
internship?
3) Safety measures adopted by the
company?
4) What practical exposure did you get
during the internship?
5) What is bio-fuel?
6) What is the impact of bio-fuel blending
on the economy? (I had said my
interest is reading business news)
7) Do you know the process of biofuel
manufacturing?
8) Explain "Fuel and
combustion" (Elective subject).
9) Why excess air is required during
combustion?
10) What is the half-burned coal is
called? What will you do with that?

Note: No questions were asked from
the final year project. Majority Of
Questions (Internship, Elective
Subject, Hobbies).

Tips: 1) Read thoroughly the internship
report.
2) Basics of MTO, HTO, FFO, CET are
important.
3) Knowledge about software like
DWSIM/ASPAN can give you an
upper edge.

Telegram - https://t.me/Coding_human

Jai Hind 🇮🇳

THRYVE DIGITAL & WILEY EDGE EXAM SOLUTION GROUP:

https://t.me/Coding_human

https://t.me/thryve_digital_wiley_edge_code

✅ Share post in ur college Whatsapp grps.

Tina code
Python

Telegram : https://t.me/Coding_human

#include<stdio.h>
int main()
{
int n;
scanf("%d",&n);
int arr[n];
for(int i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
int count=0;
int num=arr[0];
for(int i=1;i<n;i++)
{
if(num!=arr[i])
count++;
}
printf("%d",count);
}
Paper and alice
C Language ✅✅
Telegram - https://t.me/Coding_human

Python
Vijay code
TG : https://t.me/Coding_human

N=int(input())
K=int(input())
price=list(map(int,input().split()))
vol=list(map(int,input().split()))
maxvol=0
volu=0
maxvol=max(vol)
for i in range(0,N):
    if (maxvol==vol[i] and price[i]<=K):
        K=K-price[i]
        volu=maxvol
for i in range(0,N):
    for j in range(i+1,N+1):
        if (price[i]<=K and price[i]==price[j]):
            if (vol[i]>vol[j]):
                volu=volu+vol[i]
                K=K-price[i]
            else:
                volu=volu+vol[j]
                K=K-price[j]
        elif (price[i]<=K and price[i]!=price[j]):
            K=K-price[i]
            volu=volu+vol[i]
print(volu)

Python
Vijay code
Telegram - https://t.me/Coding_human

include<stdio.h>
int main()
{
    int n;
    scanf("%d",&n);
    int arr[n];
    for(int i=0;i<n;i++)
    {
        scanf("%d",&arr[i]);
    }
    int count=0;
    int num=arr[0];
    for(int i=1;i<n;i++)
    {
       if(num!=arr[i])
            count++;
    }
    printf("%d",count);
}

C Language
TCS 1st Qsn

✅Telgram - https://t.me/Coding_human

TCS NQT SOLUTION GROUP:

https://t.me/Coding_human


https://t.me/tcs_nqt_thryve_wiley_edge_code


✅ Share post in ur college Whatsapp grps.

n=int(input())
k=int(input())
mon=[]
for i in range(n):
mon.append(int(input()))
mi=min(mon)
ma=max(mon)
ma=ma-k
mi=mi+k
diff=ma-mi
print(diff)

Python
Reddington has invested Code
Telegram - https://t.me/Coding_human