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

Find the star value of an array

Qbrust and ibm exam Discussion Group👇👇👇👇👇 https://t.me/exams_discussion Keep supporting us ❤️          ➖ @ILOVEU_000 ➖

Minimum purchase Qbrust

Non overlapping code

def checkValid(str,i, L, R): right = R[ord(str[i]) -    ord('a')] for j in range(i, right):     if (L[ord(str[j]) -    ord('a')] < i):    return -1     right = max(right, R[ord(str[j]) -        ord('a')]) return right def maxcntOfSubstrings(str): res = [] n = len(str) L = [-1] * 26 R = [-1] * 26 for j, i in enumerate(str):   x = ord(i) - ord('a')       if L[x] == -1:         L[x] = j     R[x] = j right = -1 for j, i in enumerate(str):   x = ord(i) - ord('a')     if j == L[x]:          new_right = checkValid(str, j,         L, R)       if new_right != -1:         sub = str[j : new_right + 1]         if new_right < right:      res[-1] = sub     else:                       res.append(sub)     right = new_right return res if name == 'main': str = "adefaddaccc" res = maxcntOfSubstrings(str) for sub in res:   print(sub, end = " ")

predict queen code also avaible...✅ contact -@ILOVEU_000

Qburst Solve Raju's dilemma code done If anyone needs contact @ILOVEU_000

All qbrust 5 codes are posted 👍 For 11 am exam slot Share this channel with your friends @Coding_000😍

Qbrust and ibm exam Discussion Group👇👇👇👇👇 https://t.me/exams_discussion Keep supporting us ❤️          ➖ @ILOVEU_000 ➖

spiral traverse code in python 3 ✅✅ All Test Cases Passed 💯✅ Share & Join : @Coding_000

share ✅✅

Work Completion in possible Time Code in python 3 ✅✅ Passed All Test Cases 💯✅ Share & join : @Coding_000

Walking Robot Code ✅ Passed All Test Cases ✅💯 Telegram @Coding_000

Treasure hunt code Python Telegram:- @Coding_000

Tally puzzle share ✅✅✅✅ Python3

Treasure hunt code

Tally Puzzle Python

Drop your 8 am questions here https://t.me/exams_discussion