Відео

Hi guys due to some unavoidable situation iam unable to post daily test at morning if possible i will definitely make it by evening.Thanks for your patience and if any guy know the daily test please do solution in the comments ❤thanks a lot

Thank you bro

Happy New year brother ✨

happy new year anna

😊😊

Are you from nec college

Super

Thanks ❤

Good work

Great job! Keep doing what you're doing

registration link kudunga bro

Congrats on 2k bro .keep pushing forward ❤❤🎉

Congratulations on 2K bro more to goooo.................😎💥

😮

Again changed...

Will you provide certificate for this bro?

Yes bro actually this is different from today's question can u pls check it once

Bro is this DT is not todays questions,, its different both DC and DT

Bro daily test daily challenge question a maathi vitangae bro. Ena pnrathu..??

Brother, how do you code easily and understand the logic? How do you learn to upgrade your skills? As a prefinal student, how do you go about learning and practicing your own coding? Please tell me, Anna, how to learn and practice coding on a website.

docs.google.com/forms/d/e/1FAIpQLSdZE5FsV6sOJd102utyRHUKZyKXJVlIpwPaGKruPGoV7LQmqA/viewform?usp=sharing

Bro vara vara perusa podringa😭

Bro how did you take abcdef for 0 and bc for 1 like that for all explain bro

Daily test bro

Daily test

Keep going bros, let's not stop

def is_valid_mix(s): # Track the count of 'a', 'b', 'c', 'd', and 'e' in the correct order positions = [0] * 5 # Counts for 'a', 'b', 'c', 'd', 'e' for char in s: if char == 'a': positions[0] += 1 elif char == 'b' and positions[1] < positions[0]: positions[1] += 1 elif char == 'c' and positions[2] < positions[1]: positions[2] += 1 elif char == 'd' and positions[3] < positions[2]: positions[3] += 1 elif char == 'e' and positions[4] < positions[3]: positions[4] += 1 else: return False # Invalid character order or incomplete groups # Ensure all counts are equal, meaning complete groups of "abcde" return positions[0] == positions[1] == positions[2] == positions[3] == positions[4] # Input s = input().strip() # Output print("YES" if is_valid_mix(s) else "NO")

def is_sorted(arr): for i in range(1, 5): if arr[i] == -1 or arr[i] < arr[i - 1]: return False return True def main(): s = input() arr = [0] * 5 while len(s) != 0: arr[0] = s.find('a') arr[1] = s.find('b') arr[2] = s.find('c') arr[3] = s.find('d') arr[4] = s.find('e') if is_sorted(arr): s = s[:arr[0]] + s[arr[0]+1:arr[1]] + s[arr[1]+1:arr[2]] + s[arr[2]+1:arr[3]] + s[arr[3]+1:arr[4]] + s[arr[4]+1:] else: break print("YES" if len(s) == 0 else "NO") if __name__ == "__main__": main()

Daily test?

Thanks❤

Thanks

Super code bro🔥

Thanks bro❤

pls dont say issue on skillrack if u don't get it the below code worked s=list(input().split()) sorted_words = [] for word in s: position = ''.join(filter(str.isdigit, word)) word_without_position = ''.join(c for c in word if not c.isdigit()) sorted_words.append((int(position), word_without_position)) sorted_words.sort(key=lambda x: x[0]) result = ' '.join(word for _, word in sorted_words) print(result)

Just write a if condition like this in end If '.' In s: R+='.' Print(R)

Thanks😮

Thank you !! You are doing great 👍 keep going

❤️‍🔥

Thanks for posting DC AND DT

Last for loop can u explain and also what is inside array

❤❤❤❤

❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤😂❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤

❤❤❤❤❤❤❤❤❤❤❤❤❤❤😂❤❤❤❤❤❤❤

கோபி கொலை முயற்சி குற்றவாளி ஜெயிலுக்கு ப் போகக்கூடாது. ஈஸ்வரி டயலாக்கைக் நாம் எரிச்சலுடன் கேட்க வேண்டும்