Mitsogo Interview Questions — CS-Next ByCompany

16 of 16

No.	Problem	Difficulty	Frequency
3131	Find the Integer Added to Array I ArrayMath	Easy	100.0%
3132	Find the Integer Added to Array II ArrayMath	Medium	100.0%
3144	Minimum Substring Partition of Equal Character Frequency StringDPTree	Medium	100.0%
3213	Construct String with Minimum Cost String	Hard	100.0%
3180	Maximum Total Reward Using Operations I	Medium	100.0%
3181	Maximum Total Reward Using Operations II	Hard	100.0%
3097	Shortest Subarray With OR at Least K II Array	Medium	100.0%
3095	Shortest Subarray With OR at Least K I Array	Easy	100.0%
3128	Right Triangles	Medium	100.0%
2978	Symmetric Coordinates	Medium	100.0%
3837	Delayed Count of Equal Elements	Medium	87.5%
118	Pascal's Triangle	Easy	75.0%
31	Next Permutation	Medium	75.0%
556	Next Greater Element III	Medium	62.5%
6	Zigzag Conversion	Medium	62.5%
20	Valid Parentheses Stack/Queue	Easy	62.5%