Capgemini Coding Questions and Solutions

Practice Capgemini coding questions for placement preparation with company-wise problems, examples, approaches, and detailed solutions.

Questions

• Remove Linked List Elements — Easy
• Reverse Linked List — Easy
• Valid Parentheses — Easy
• Two Sum — Easy
• Palindrome Number — Easy
• Maximum Subarray - Kadane's Algorithm — Hard
• Remove Duplicates from Sorted Array — Easy
• Container With Most Water — Medium
• Longest Substring Without Repeating Characters — Medium
• Reverse String — Easy
• First Unique Character in a String — Easy
• Valid Palindrome — Easy
• Remove Duplicates from Sorted List — Easy
• Merge Two Sorted Lists — Easy
• Palindrome Linked List — Easy
• Bubble Sort Implementation — Easy

Other Company Coding Collections