CODING SOLUTION - Placement Jobs & Materials

2022-01-09 14:53:30 Java
Number of times you can remove the palindromes and unique elemtns to empty the string
Telegram - t.me/codingsolution_IT Open / Comment

2022-01-09 14:01:03 Java
Maximum possibility of unique digits in k divided subarrray of given arraylist
Telegram - t.me/codingsolution_IT Open / Comment

2022-01-09 13:59:29 n=int(input())
m=int(input())
s=input()
t=input()
def subString(s,n):
c=0
for i in range(n):
for len in range(i+1,n+1):
a=s[i: len]
c+=1
return c-2
if s==t:
print(1)
else:
if t in s:
print(subString(s,n))
else:
print(0)

Python
Telegram - t.me/codingsolution_IT Open / Comment

2022-01-09 13:50:13 Python
Rooted tree with N nodes code
An array A of N integer code
Bob received n job invitations code
Telegram - t.me/codingsolution_IT Open / Comment

2022-01-09 13:43:07 Java
Telegram - t.me/codingsolution_IT Open / Comment

2022-01-09 13:41:40 class GFG
{
public static int ans =10000000;
public static void solve(int a[], int n, int k, int index, int sum, int maxsum)
{
// K=1 is the base Case if (k == 1)
{
maxsum = Math.max(maxsum, sum); sum = 0;
for (int i = index; i < n; i++)
{
sum += a[i];
}
// we update maxsum maxsum =Math.max(maxsum, sum);
// the answer is stored in ans ans = Math.min(ans, maxsum);
return;
}
sum = 0; // using for loop to divide the array into // K-subarray
for (int i = index; i < n; i++)
{
sum += a[i]; // for each subarray we calculate sum ans update // maxsum maxsum = Math.max(maxsum, sum); // calling function again solve(a, n, k - 1, i + 1, sum, maxsum);
}
}
public static void main(String[] args) { int arr[] = { 1, 2, 3, 4 }; int k = 3; // K divisions int n = 4; // Size of Array solve(arr, n, k, 0, 0, 0); System.out.println(ans + "\n"); } }

Java
Telegram - t.me/codingsolution_IT Open / Comment

2022-01-09 13:36:57 Java
Palindrome moves
Telegram - t.me/codingsolution_IT Open / Comment

2022-01-09 13:29:52 Python
General ali code
Telegram- t.me/codingsolution_IT Open / Comment

2022-01-09 13:29:19 n = int(input())
a = list(map(int,input().split()))
c = 0
for i in range(n-1):
for j in range(i+1:n):
s1 = sum(list(map(int,bin(i)[2:].split())))
s2 = sum(list(map(int,bin(j)[2:].split())))
if s1 == s2:
c += 1
print(c)

Python
Bob and Numbers Code
Telegram- t.me/codingsolution_IT Open / Comment

2022-01-09 13:28:57 Python
Max Count
Telegram- t.me/codingsolution_IT Open / Comment