2 849
المشتركون
-424 ساعات
-147 أيام
-4630 أيام
أرشيف المشاركات
⭕️ Eurofins Off Campus Drive - Fresherstown
Apply Now ✅✅👇👇👇
https://www.fresherstown.com/eurofins-off-campus-drive/
⭕️ Shell Off Campus Drive - Fresherstown
Apply Now ✅✅👇👇👇
https://www.fresherstown.com/shell-off-campus-drive/
⭕️ Ivy Off Campus Drive - Fresherstown
Apply Now ✅✅👇👇👇
https://www.fresherstown.com/ivy-off-campus-drive/
⭕️ Red Hat Off Campus Drive - Fresherstown
Apply Now ✅✅👇👇👇
https://www.fresherstown.com/red-hat-off-campus-drive/
Share to your friends and larger groups to reap the benefits them too👍👍
⭕️ Xiaomi Off Campus Drive - Fresherstown
Apply Now ✅✅👇👇👇
https://www.fresherstown.com/xiaomi-off-campus-drive/
⭕️Intel Off Campus Drive - Fresherstown
Apply Now ✅✅👇👇👇
https://www.fresherstown.com/intel-off-campus-drive/
⭕️ Valeo Off Campus Drive - Fresherstown
Apply Now ✅✅👇👇👇
https://www.fresherstown.com/valeo-off-campus-drive/
Share to your friends and larger groups to reap the benefits them too👍👍
⭕️ BlackLine Off Campus Drive - Fresherstown
Apply Now ✅✅👇👇👇
https://www.fresherstown.com/blackline-off-campus-hiring/
⭕️Vestas Off Campus Drive - Fresherstown
Apply Now ✅✅👇👇👇
https://www.fresherstown.com/vestas-off-campus-drive/
⭕️ Wells Fargo Off Campus Drive - Fresherstown
Apply Now ✅✅👇👇👇
https://www.fresherstown.com/wells-fargo-off-campus-drive/
⭕️ Caterpillar Off Campus Drive - Fresherstown
Apply Now ✅✅👇👇👇
https://www.fresherstown.com/caterpillar-off-campus-drive/
Share to your friends and larger groups to reap the benefits them too👍👍
Share 👇👇👇:
https://t.me/fresherstown
#include<bits/stdc++.h>
using namespace std;
// Function to check whether given sequence is
// Jolly Jumper or not
bool isJolly(int a[], int n)
{
// Boolean vector to diffSet set of differences.
// The vector is initialized as false.
vector<bool> diffSet(n, false);
// Traverse all array elements
for (int i=0; i < n-1 ; i++)
{
// Find absolute difference between current two
int d = abs(a[i]-a[i+1]);
// If difference is out of range or repeated,
// return false.
if (d == 0 d > n-1 diffSet[d] == true)
return false;
// Set presence of d in set.
diffSet[d] = true;
}
return true;
}
// Driver Code
int main()
{
int a[] = {11, 7, 4, 2, 1, 6};
int n = sizeof(a)/ sizeof(a[0]);
isJolly(a, n)? cout << "Yes" : cout << "No";
return 0;
}
C++
Jolly Jumper Sequence Code
Telegram - https://t.me/codingsolution_group
#include<bits/stdc++.h>
using namespace std;
// Function to check whether given sequence is
// Jolly Jumper or not
bool isJolly(int a[], int n)
{
// Boolean vector to diffSet set of differences.
// The vector is initialized as false.
vector<bool> diffSet(n, false);
// Traverse all array elements
for (int i=0; i < n-1 ; i++)
{
// Find absolute difference between current two
int d = abs(a[i]-a[i+1]);
// If difference is out of range or repeated,
// return false.
if (d == 0 d > n-1 diffSet[d] == true)
return false;
// Set presence of d in set.
diffSet[d] = true;
}
return true;
}
// Driver Code
int main()
{
int a[] = {11, 7, 4, 2, 1, 6};
int n = sizeof(a)/ sizeof(a[0]);
isJolly(a, n)? cout << "Yes" : cout << "No";
return 0;
}
C++
Jolly num code
Telegram 👇👇 https://t.me/codingsolution_group
https://t.me/codingsolution_group
Tcs
Numerical:
1)11.500
2)32000
3)1:2
4)15.5
5) More by 1.75
6).6077
7)10.33%
8)576
9)23.025
10)12hrs
11)both 1 and 2
12).48.6
13)30
14)9.50
15)87
16)14
17)3000
18)35
19)23.5
20) 29.4
21)only 2
22)20
23)8
24) option D
25) option A
26) option C
https://t.me/codingsolution_group
https://t.me/codingsolution_group
Tcs
Numerical:
1)11.500
2)32000
3)1:2
4)15.5
5) More by 1.75
6).6077
7)10.33%
8)576
9)23.025
10)12hrs
11)both 1 and 2
12).48.6
13)30
14)9.50
15)87
16)14
17)3000
18)35
19)23.5
20) 29.4
21)only 2
22)20
23)8 examhuntercopy
24) option D
25) option A
26) option C
https://t.me/codingsolution_group
https://t.me/codingsolution_group
Tcs
Numerical:
1)11.500
2)32000
3)1:2
4)15.5
5) More by 1.75
6).6077
7)10.33%
8)576
9)23.025
10)12hrs
11)both 1 and 2
12).48.6
13)30
14)9.50
15)87
16)14
17)3000
18)35
19)23.5
https://t.me/codingsolution_group
https://t.me/codingsolution_group
TCS Ans
1. 14500
2.32000
3.1:2
4.15.5
5.1.75%
6.6077
7.10.33%
8. 374
9. 23.025
10. 12hrs
11.both 1 and 2
12. 48.6
13.30
14.9.50
https://t.me/codingsolution_group
https://t.me/codingsolution_group
TCS Ans
1. 14500
2.32000
3.1:2
4.15.5
5.1.75%
6.6077
7.10.33%
8. 374
9. 23.025
https://t.me/codingsolution_group
https://t.me/codingsolution_group
TCS Ans
1. 14500
2.32000
3.1:2
4.15.5
5.1.75%
6.6077
7.10.33%
8) 374
TCS
https://t.me/codingsolution_group
https://t.me/codingsolution_group
✅ Tommorow INFOSYS EXAM Answer group
✅Guys share our channel to all groups
Gather all Infosys Exam Candidates here
✅Share. ✅Share ✅Share
✳️Telegram :
https://t.me/codingsolution_group
https://t.me/codingsolution_group
https://t.me/codingsolution_group
SHARE QUESTIONS here
https://t.me/Exam_answer_group
https://t.me/Exam_answer_group
TOMORROW IBM And Accenture Exam's Ans
@codingsolution_group
@codingsolution_group
@codingsolution_group
⚠️ Share post in ur college and telegram Group's
ACCENTURE and TCS EXAM ANSWER GROUP:
@codingsolution_group
@codingsolution_group
@codingsolution_group
Share your questions here👇👇👇
https://t.me/Exam_answer_group
https://t.me/Exam_answer_group
https://t.me/Exam_answer_group
https://t.me/Exam_answer_group
✅ Share post in ur college Whatsapp grps.
