Capgemini Interview Questions — CS-Next ByCompany

36 of 36

No.	Problem	Difficulty	Frequency
1	Two Sum Sliding Window	Easy	100.0%
2356	Number of Unique Subjects Taught by Each Teacher Math	Easy	87.5%
3498	Reverse Degree of a String String	Easy	87.5%
3005	Count Elements With Maximum Frequency	Easy	75.0%
283	Move Zeroes	Easy	75.0%
9	Palindrome Number StringMath	Easy	62.5%
26	Remove Duplicates from Sorted Array Array	Easy	62.5%
121	Best Time to Buy and Sell Stock	Easy	62.5%
189	Rotate Array Array	Medium	62.5%
14	Longest Common Prefix DP	Easy	62.5%
4	Median of Two Sorted Arrays ArrayHeap	Hard	62.5%
626	Exchange Seats	Medium	62.5%
242	Valid Anagram String	Easy	62.5%
3	Longest Substring Without Repeating Characters StringTree	Medium	62.5%
34	Find First and Last Position of Element in Sorted Array Array	Medium	62.5%
21	Merge Two Sorted Lists	Easy	62.5%
28	Find the Index of the First Occurrence in a String String	Easy	62.5%
217	Contains Duplicate	Easy	62.5%
49	Group Anagrams String	Medium	62.5%
2	Add Two Numbers Math	Medium	50.0%
1405	Longest Happy String String	Medium	50.0%
42	Trapping Rain Water	Hard	50.0%
560	Subarray Sum Equals K Array	Medium	50.0%
322	Coin Change DP	Medium	50.0%
75	Sort Colors	Medium	50.0%
7	Reverse Integer Math	Medium	50.0%
11	Container With Most Water	Medium	50.0%
13	Roman to Integer Math	Easy	50.0%
176	Second Highest Salary	Medium	50.0%
2677	Chunk Array Array	Easy	50.0%
66	Plus One	Easy	50.0%
1877	Minimize Maximum Pair Sum in Array Array	Medium	50.0%
235	Lowest Common Ancestor of a Binary Search Tree TreeBinary Search	Medium	50.0%
349	Intersection of Two Arrays Array	Easy	50.0%
18	4Sum	Medium	50.0%
67	Add Binary	Easy	50.0%