#include<bits/stdc++.h>
using namespace std;
int find(int n1, int n2) {
int count = 0;
for (int i = n1 ; i <= n2 ; i++) {
int num = i;
vector<bool> visited;
visited.assign(10, false);
while (num > 0) {
if (visited[num % 10] == true)
break;
visited[num % 10] = true;
num /= 10;
}
if (num == 0)
count++;
}
return count;
}
int main()
{
int n1 = 101, n2 = 200;
cout << find(n1, n2);
}
C++ ✅✅
Raju code
Telegram - t.me/codingsolution_IT
using namespace std;
int find(int n1, int n2) {
int count = 0;
for (int i = n1 ; i <= n2 ; i++) {
int num = i;
vector<bool> visited;
visited.assign(10, false);
while (num > 0) {
if (visited[num % 10] == true)
break;
visited[num % 10] = true;
num /= 10;
}
if (num == 0)
count++;
}
return count;
}
int main()
{
int n1 = 101, n2 = 200;
cout << find(n1, n2);
}
C++ ✅✅
Raju code
Telegram - t.me/codingsolution_IT
IBM EXAM 6PM SOLUTION GROUP:
telegram.me/codingsolution_IT
1) telegram.me/+V7_OuuZWqTAwZWZl
2) telegram.me/+wxfAMtYpHoMxZjNl
✅ Share post in ur college Whatsapp grps.
telegram.me/codingsolution_IT
1) telegram.me/+V7_OuuZWqTAwZWZl
2) telegram.me/+wxfAMtYpHoMxZjNl
✅ Share post in ur college Whatsapp grps.
strips.sort()
fis=""
las=""
n=len(strips)
for i in range(n):
s=strips[i]
fis+=s[1]
las+=s[2]
print(fis)
print(las)
Python
Telegram - t.me/codingsolution_IT
fis=""
las=""
n=len(strips)
for i in range(n):
s=strips[i]
fis+=s[1]
las+=s[2]
print(fis)
print(las)
Python
Telegram - t.me/codingsolution_IT