Channel address:
Categories:
Technologies
Language: English
Subscribers:
202.72K
Description from channel
🌀 ” Our Only Aim Is To Let Get Placed To You In A Reputed Company. “
Contact Admin:
instagram.com/offcampusjobsindia_it
Ratings & Reviews
Reviews can be left only by registered users. All reviews are moderated by admins.
5 stars
2
4 stars
0
3 stars
0
2 stars
1
1 stars
0
The latest Messages 66
2022-04-24 12:45:51
Java8
Gcd code
Telegram - t.me/codingsolution_IT
15.7K views09:45
2022-04-24 12:45:07
Python
Factor dilemma Code
Telegram - t.me/codingsolution_IT
15.0K views09:45
2022-04-24 12:39:47
Java
Divine to sequence
Telegram - t.me/codingsolution_IT
15.2K viewsedited 09:39
2022-04-24 10:43:01
Python
LIS Problem Code
Telegram - t.me/codingsolution_IT
17.5K views07:43
2022-04-24 09:51:19
def isPalindrome(Str):
Len = len(Str)
if (Len == 1):
return True
ptr1 = 0
ptr2 = Len - 1
while (ptr2 > ptr1):
if (Str[ptr1] != Str[ptr2]):
return False
ptr1 += 1
ptr2 -= 1
return True
def noOfAppends(s):
if (isPalindrome(s)):
return 0
del s[0]
return 1 + noOfAppends(s)
//CodingSolution
se = "abede"
s = [i for i in se]
print(noOfAppends(s))
Python
Make palindrome code
Telegram - t.me/codingsolution_IT
20.2K viewsedited 06:51
2022-04-24 09:22:29
Python
A lot of sum Code
Telegram - t.me/codingsolution_IT
19.5K views06:22
2022-04-24 09:16:36
Python
Positive sum segment code
Telegram - t.me/codingsolution_IT
19.1K views06:16
2022-04-24 09:13:24
Python
Maximise multiplication code
Telegram - t.me/codingsolution_IT
18.2K views06:13
2022-04-24 09:08:27
Python
TCS CPA Code
Telegram - t.me/codingsolution_IT
18.2K views06:08
2022-04-24 08:56:02
#include
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 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 - t.me/codingsolution_IT
18.6K viewsedited 05:56
C
