All company sheets
Capgemini logo

Capgemini DSA interview questions

37 problems to practise before your Capgemini online test or coding round. Most widely asked first.

37
Questions
16
Easy
21
Medium
0
Hard

Good practice. Problems at the level of this company’s online test and coding round. Treat it as a practice set, not a leak. These are Astra’s own tags, not an official question list.

37 questions

  1. 1

    Maximum Subarray

    EasyArrayTagged at 7 companies
  2. 2

    Find the Maximum Depth of a Binary Tree

    EasyRecursionTagged at 7 companies
  3. 3

    Find the Lowest Common Ancestor of a Binary Search Tree

    EasyRecursionTagged at 7 companies
  4. 4

    Find Smallest Letter Greater Than Target

    EasyBinary SearchTagged at 7 companies
  5. 5

    Merge Two Sorted Arrays In-Place

    EasyArrayTagged at 7 companies
  6. 6

    Find the Majority Element in an Array (Boyer-Moore)

    EasyArrayTagged at 7 companies
  7. 7

    Find the Missing Number in an Array from 1 to N

    EasyArrayTagged at 7 companies
  8. 8

    Calculate the Range Sum Query (Immutable)

    EasyArrayTagged at 7 companies
  9. 9

    Chat Filter Symmetry Check

    EasyTwo PointersTagged at 7 companies
  10. 10

    Intersection of Two Arrays

    EasyTwo PointersTagged at 7 companies
  11. 11

    3Sum

    MediumArrayTagged at 7 companies
  12. 12

    Subarray Sum Equals K

    MediumArrayTagged at 7 companies
  13. 13

    Find the Duplicate Number

    MediumArrayTagged at 7 companies
  14. 14

    Find All Combinations that Sum to Target II (No Duplicates)

    MediumRecursionTagged at 7 companies
  15. 15

    Check if a Binary Tree is a Valid Binary Search Tree

    MediumRecursionTagged at 7 companies
  16. 16

    Generate All Unique Binary Search Trees II

    MediumRecursionTagged at 7 companies
  17. 17

    Find Number of Ways to Reach Target Sum

    MediumRecursionTagged at 7 companies
  18. 18

    Find the Number of Provinces in a Country

    MediumRecursionTagged at 7 companies
  19. 19

    Find All Majority Elements II (More than n/3)

    MediumArrayTagged at 7 companies
  20. 20

    Stripe Rate Limiter Logic

    MediumSliding WindowTagged at 7 companies
  21. 21

    Chrome Tab History Unique Domains

    MediumSliding WindowTagged at 7 companies
  22. 22

    Database Primary Key Collision

    MediumTwo PointersTagged at 7 companies
  23. 23

    Longest Repeating Character Replacement

    MediumSliding WindowTagged at 7 companies
  24. 24

    Implement a FIFO Queue using a Linked List

    EasyStack and QueueTagged at 6 companies
  25. 25

    Check if a Linked List is Sorted

    EasyLinkedListTagged at 6 companies
  26. 26

    Implement N-ary Tree Postorder Traversal

    EasyTreeTagged at 6 companies
  27. 27

    Check if an N-ary Tree is Symmetric

    EasyTreeTagged at 6 companies
  28. 28

    Count All Possible Root-to-Leaf Paths in a Generic Tree

    EasyTreeTagged at 6 companies
  29. 29

    Convert a Roman Numeral String to an Integer

    EasyStringTagged at 6 companies
  30. 30

    Lowest Common Ancestor of a Binary Tree

    MediumTreeTagged at 6 companies
  31. 31

    Longest Substring with At Most K Distinct Characters

    MediumStringTagged at 6 companies
  32. 32

    Design a Double-Ended Circular Deque

    MediumStack and QueueTagged at 6 companies
  33. 33

    Find the Maximum Width Ramp in an Array

    MediumStack and QueueTagged at 6 companies
  34. 34

    Find Shortest Distance from Gates to Rooms (Walls and Gates)

    MediumStack and QueueTagged at 6 companies
  35. 35

    Merge Two Lists at Alternate Positions

    MediumLinkedListTagged at 6 companies
  36. 36

    Design an Encode and Decode Strings (System Design)

    MediumStringTagged at 6 companies
  37. 37

    Implement a String Compression Function (e.g., 'aabcccccaaa')

    MediumStringTagged at 6 companies

More company sheets