Message on Whatsapp 8879355057 for DSA(OA + Interview) + Fullstack Dev Training + 1-1 Personalized Mentoring to get 10+LPA Job
© 2024 DesiQnA 2024
Toggle navigation
Email or Username
Password
Remember
Login
Register
|
I forgot my password
Dynamic Programming
Tutorials
Compiler
Company-wise questions!
Hot
Tags
Categories
Recent activity by zilda
User zilda
Recent activity
All questions
All answers
User zilda
Recent activity
All questions
All answers
0
answers
you are given n balls numbered in a horizontal line from 1 to N For each i (1<=i<=N) , the colour of the i-th ball is given Si.. Adjacent balls with the sme colour will merge into one large ball without changing the color . if there were a ball adjacent to this group of balls before fusion that ball is now adjacent to the new large ball. task is to find the final number of balls present after all the merging is completed
asked
Feb 26, 2023
in
Online Assessments
|
1,268
views
dynamic-programming