Rubrik Interview Questions — CS-Next ByCompany

35 of 35

No.	Problem	Difficulty	Frequency
3207	Maximum Points After Enemy Battles	Medium	100.0%
2249	Count Lattice Points Inside a Circle	Medium	75.0%
3410	Maximize Subarray Sum After Removing All Occurrences of One Element Array	Hard	75.0%
3426	Manhattan Distances of All Arrangements of Pieces	Hard	75.0%
2928	Distribute Candies Among Children I	Easy	62.5%
2929	Distribute Candies Among Children II	Medium	62.5%
2927	Distribute Candies Among Children III	Hard	62.5%
2132	Stamping the Grid	Hard	62.5%
3021	Alice and Bob Playing Flower Game	Medium	62.5%
723	Candy Crush	Medium	62.5%
3098	Find the Sum of Subsequence Powers StringMath	Hard	62.5%
3083	Existence of a Substring in a String and Its Reverse StringTree	Easy	62.5%
528	Random Pick with Weight	Medium	62.5%
2982	Find Longest Special Substring That Occurs Thrice II StringTree	Medium	62.5%
3525	Find X Value of Array II Array	Hard	62.5%
3524	Find X Value of Array I Array	Medium	62.5%
621	Task Scheduler	Medium	50.0%
146	LRU Cache	Medium	50.0%
1242	Web Crawler Multithreaded	Medium	50.0%
301	Remove Invalid Parentheses Stack/Queue	Hard	50.0%
1146	Snapshot Array Array	Medium	50.0%
2193	Minimum Number of Moves to Make Palindrome StringMath	Hard	50.0%
18	4Sum	Medium	37.5%
31	Next Permutation	Medium	37.5%
87	Scramble String String	Hard	37.5%
380	Insert Delete GetRandom O(1)	Medium	37.5%
1463	Cherry Pickup II	Hard	37.5%
1236	Web Crawler	Medium	37.5%
2502	Design Memory Allocator	Medium	37.5%
2365	Task Scheduler II	Medium	37.5%
622	Design Circular Queue Stack/Queue	Medium	37.5%
761	Special Binary String String	Hard	37.5%
2747	Count Zero Request Servers	Medium	37.5%
276	Paint Fence	Medium	37.5%
1202	Smallest String With Swaps String	Medium	37.5%