😢56👍40❤10🔥5🤯2
TCS NQT 9AM
ADV. APTI
1) 26/35
2) 18
3) greater by 14 14/15
4) 9500 and 10500
5) 20
6) 15
7) 9
8) 30
9) 80000
10) 15000
Telegram:- @allcoding1
ADV. APTI
1) 26/35
2) 18
3) greater by 14 14/15
4) 9500 and 10500
5) 20
6) 15
7) 9
8) 30
9) 80000
10) 15000
Telegram:- @allcoding1
👍52😢17🤩4👏3
TCS NQT 9AM
ADV. APTI
1) 26/35
2) 18
3) greater by 14 14/15
4) 9500 and 10500
5) 20
6) 15
7) 9
8) 30
9) 80000
10) 15000
Telegram:- @allcoding1
ADV. APTI
1) 26/35
2) 18
3) greater by 14 14/15
4) 9500 and 10500
5) 20
6) 15
7) 9
8) 30
9) 80000
10) 15000
Telegram:- @allcoding1
👍31😢21
Advance reasoning
1) No
2) red
3)266839
4) data in either
5) candidate will be not be selected
Telegram:- @allcoding1
1) No
2) red
3)266839
4) data in either
5) candidate will be not be selected
Telegram:- @allcoding1
❤26👍14🔥6😢6
Advance reasoning
1) No
2) red
3)266839
4) data in either
5) candidate will be not be selected
6. 3
7. MERKLF...
Telegram:- @allcoding1
1) No
2) red
3)266839
4) data in either
5) candidate will be not be selected
6. 3
7. MERKLF...
Telegram:- @allcoding1
👍24🔥9❤6
Advance reasoning
1) No
2) red
3)266839
4) data in either
5) candidate will be not be selected
6. 3
7. MERKLF.
.
8) lily
Telegram:- @allcoding1
1) No
2) red
3)266839
4) data in either
5) candidate will be not be selected
6. 3
7. MERKLF.
.
8) lily
Telegram:- @allcoding1
👍18🔥7❤4👏2
Advance reasoning
1) No
2) red
3)266839
4) data in either
5) candidate will be not be selected
6. 3
7. MERKLF.
8) lily
9)32
Telegram:- @allcoding1
1) No
2) red
3)266839
4) data in either
5) candidate will be not be selected
6. 3
7. MERKLF.
8) lily
9)32
Telegram:- @allcoding1
👍18🔥3👏2❤1🤯1
Advance reasoning
1) No
2) red
3)266839
4) data in either
5) candidate will be not be selected
6. 3
7. MERKLF.
8) lily
9)32
10) 11:1353
Telegram:- @allcoding1
1) No
2) red
3)266839
4) data in either
5) candidate will be not be selected
6. 3
7. MERKLF.
8) lily
9)32
10) 11:1353
Telegram:- @allcoding1
👍19❤6🤯4👏2
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
vector<string> v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
int ans = 0;
for (int i = 0; i <= n - k; i++)
{
map<string, int> mp;
for (int j = i; j < i + k; j++)
{
mp[v[j]]++;
}
int p = mp.size();
ans = max(ans, p);
}
cout << ans << endl;
}
C++
N-Day (TCS 1st Qsn)
Telegram:- @allcoding1
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
vector<string> v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
int ans = 0;
for (int i = 0; i <= n - k; i++)
{
map<string, int> mp;
for (int j = i; j < i + k; j++)
{
mp[v[j]]++;
}
int p = mp.size();
ans = max(ans, p);
}
cout << ans << endl;
}
C++
N-Day (TCS 1st Qsn)
Telegram:- @allcoding1
👍16❤6😢5👎1
❤35👍20🔥7👏7🥰1