TheJobOverflow

REGISTER NOW

Register Now

Request Recent Questions Now!

Showing : Capgemini • reset

0 Votes | 1 Reply

strings combinatorics math 2025 capgemini

8 days ago

Pravardhan Aare • 0

0 Votes | 1 Reply

Strings Capgemini TwoPointers Simulation OA

8 days ago

Sahil Jain • 0

0 Votes | 1 Reply

math arrays bit-manipulation capgemini

10 days ago

Pravardhan Aare • 0

0 Votes | 2 Replies

capgemini oa 2026 coding-round

0 Votes | 2 Replies

capgemini 2026 communication-round

2 Votes | 3 Replies

Capgemini coding-round 2025 OA

5 Votes | 3 Replies

Online-Assessments Capgemini coding-round free-public-post 2022

7 results • Page 1 of 1

Request Recent Questions Now!

Filter Posts by Company

Recent Replies

Answer: RELIANCE JIO Hiring | On Campus OA (2024) | Optimal Partition of String by Padala Indira Bhavani • 0

Approach Use a Greedy Strategy. Maintain a set of characters present in the current substring. For each character: If the ch…

Answer: HUAWEI TECHNOLOGIES Hiring | On Campus OA (2024) | Encode and Decode TinyURL by Padala Indira Bhavani • 0

Approach To implement TinyURL: Generate a random 6-character code. Store mapping: Long URL → Short URL Short Code …

Answer: WELLS FARGO Hiring | Off Campus OA (2024) | Maximum Number of Achievable Transfe by Padala Indira Bhavani • 0

Approach Since the number of requests is at most 16, we can try every possible subset of requests. For each subset: Track emplo…

Answer: Standard Chartered OA 2025 | Number of Ways to Reorder Array to Get Same BST by Padala Indira Bhavani • 0

Approach When constructing a BST: First element becomes the root. Elements smaller than root go to the left subtree. Elements …

Answer: Bank of America OA 2025 | Maximum Gap | Bucket Sort | Java Solution by Padala Indira Bhavani • 0

Approach Sorting directly would take: O(n log n) But the problem requires: O(n) Using the Pigeonhole Principle, we divid…

Answer: DXC Technology Hiring | Minimum Number of Days to Eat N Oranges | Online Assess by Padala Indira Bhavani • 0

Approach This problem can be solved using Dynamic Programming + Memoization. For any number of oranges n: Option 1: Make n divisib…

Answer: Verizon OA 2024 | Path With Minimum Effort (Dijkstra's Algorithm) | Java Solutio by Padala Indira Bhavani • 0

Approach This problem can be solved using Dijkstra's Algorithm. Key Observation Unlike the traditional shortest path problem w…

Answer: Genpact Hiring | Find the Difference of Two Arrays | HashSet | Online Assessment by Padala Indira Bhavani • 0

Approach The most efficient solution is to use HashSet. Step 1 Store all elements of nums1 in a set. set1 = {1,2,3} Store …

Answer: Johnson Controls OA 2024 | Minimum Number of Operations to Move All Balls to Eac by Padala Indira Bhavani • 0

Approach A brute-force solution would calculate the distance from every ball to every box. Time Complexity = O(n²) Since n can b…

Answer: Persistent Systems SDE-1 Off-Campus OA | Sliding Window Maximum & Greedy Refuel by Sahil Jain • 0

Solution 1 - Data Center Server Temperature Spikes Strategy For every window, we need the maximum element. A brute-force approach …

Answer: LTIMindtree SDE OA | Prefix Sum & Array Partition by Sahil Jain • 0

Solution 1 - Numeric Stream Filter Optimization Strategy The value at every position depends on the sum of all previous elements. …

Answer: Amdocs SDE OA | Parity Sorting, Cycle Detection & Invoice Combinations by Sahil Jain • 0

Solution 1 - Subscriber Bandwidth Data Alignment Strategy The problem requires grouping all even numbers before all odd numbers while…

Answer: Cognizant GenC Pro OA | Data Compression Sequence Evaluator & Fleet Route Alloca by Sahil Jain • 0

Solution 1 - Data Compression Sequence Evaluator Strategy A direct decompression approach is extremely dangerous because the expanded…

Answer: Zepto OA 2025 | Inventory Traversal & Delivery Pair Optimization by Sahil Jain • 0

Solution 1 - Dark Store Inventory Extraction Strategy The perimeter consists of four independent segments: Top Row Right Colu…

Answer: Groww OA 2025 Off-Campus | SIP Cost Optimization by Sahil Jain • 0

Solution 1 - Investment SIP Frequency Range Minimizer Strategy A greedy approach is not reliable because a locally optimal pass purch…

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now

Top Problem Solvers

Claim your TJO hamper 🎁

Meet the Champions

Recent Votes

Tensor School of CS and AI - Interview Experience (In-Person, Hyderabad)

AlgoUniversity Technology Fellowship: Stage 2 || Important Questions

Flipkart | October, 2022 | Interview Questions

TCS | Online Assessments | Deleting Channel

MediaNet, Recently Asked Online Assessments in October, 2022 | Omega Primes | Fruits on Tree | Damaged Roads

Tensor School of CS and AI - Interview Experience (In-Person, Hyderabad)

How to get Premium Access?

Amazon, Recently Asked Online Assessments in 27 Aug, 2025 | Single Sign-On Security Code | Lexicographical Binary Strings | HackerRank Coding Assessment |

Comment: Amazon | Recent Online Assessment 2026 | Priority Bug Sorting | Package Prefix D

Recent Locations

Hyderabad, 2 hours ago

Ludhiana, 4 hours ago

Bengaluru, 4 hours ago

Hyderabad, 4 hours ago

Bengaluru, 5 hours ago

Recent Awards • All

Centurion to Sahil Jain • 0

Centurion to Padala Indira Bhavani • 0

Centurion to Pravardhan Aare • 0

Rising Star to Sahil Jain • 0

Rising Star to Padala Indira Bhavani • 0

Rising Star to Pravardhan Aare • 0

Appreciated to Ayush Gangwani 1.3k

Great Question to papa 430

Teacher to Apna_time _aayega • 60

Great Question to admin 1.9k

Land on Leaderboard & Claim your Hamper

Top Problem Solvers

You have successfully registered to our first ever Exclusive Contest!