es
Feedback
Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO

Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO

Ir al canal en Telegram

Main channel https://t.me/Coding_000 Contact Admin 👉 @ILOVEU_143 for booking your exam slots Web- https://coding000.github.io/Projects/ 💯% clearance in any placement exams OffCampus -https://t.me/Offcampus_000 Discussion- https://t.me/exams_discussion

Mostrar más
3 343
Suscriptores
-424 horas
-187 días
-5230 días
Archivo de publicaciones
C++ Question:- You are given Queries.each query consists of 3 integer X[i],Y[i] and N[i] where i donates the ith query The an
C++ Question:- You are given Queries.each query consists of 3 integer X[i],Y[i] and N[i] where i donates the ith query The answer to ith query X[i],Y[i] and N[i] is denoted By (X[i],Y[i])^((X[i]+1),Y[i])^....^((X[i],N[i]*Y[i]) Find the sum of all answers modulo 10^9+7 Telegram:- @Coding_000

#include using namespace std; int count(string s) { int N, i, cnt = 0, ans = 0; N = s.length(); for (i = 0; i < N; i++) {
#include <bits/stdc++.h> using namespace std; int count(string s) { int N, i, cnt = 0, ans = 0; N = s.length(); for (i = 0; i < N; i++) {   if (s[i] == 'R')    cnt++;   if (s[i] == 'L')    ans += cnt; } return ans; } int main() { string s = "RRLL"; cout << count(s) << endl; return 0; } C++ Telegram - @Coding_000

Share this link to big groups and your friends 👍 I will try to post all codes here All the best❤️

if (n > k && n > a) { printf("N is the Biggest number is %d", n); return n; } if (k > n && k > a) { printf("k is the Biggest
if (n > k && n > a)   {         printf("N is the Biggest number is %d", n);         return n;     }     if (k > n && k > a)     {         printf("k is the Biggest number is %d", k);         return k;     }     if (a > n && a > k)      {      printf("a is the Biggest number is %d", a);         return a; } @Coding_000

def getLargestString(s, k):     frequency_array = [0] * 26     for i in range(len(s)):         frequency_array[ord(s[i]) -                         ord('a')] += 1     ans = ""     i = 25     while i >= 0:         if (frequency_array[i] > k):             temp = k             st = chr( i + ord('a'))                          while (temp > 0):                 ans += st                 temp -= 1                        frequency_array[i] -= k             j = i - 1                          while (frequency_array[j] <= 0 and                    j >= 0):                 j -= 1             if (frequency_array[j] > 0 and                 j >= 0):                 str1 = chr(j + ord( 'a'))                 ans += str1                 frequency_array[j] -= 1                          else:                 break         elif (frequency_array[i] > 0):             temp = frequency_array[i]             frequency_array[i] -= temp             st = chr(i + ord('a'))             while (temp > 0):                 ans += st                 temp -= 1         else:             i -= 1                  return ans           if name == "main":        S = input()     k = 3     print (getLargestString(S, k)) Python Bob code @Coding_000