CoCubes Coding Questions: Top 5 Coding Problems and Solutions 2025

With the competition in today’s job market, freshers looking to join top companies need to stand out, and one way to do so is through acing standardised assessments like the CoCubes test. 

CoCubes is widely used by organisations to evaluate candidates’ technical and analytical skills, and for many freshers, the coding section is the highlight. Understanding the types of coding questions asked in CoCubes, analysing patterns from previous years, and practising frequently repeated questions are crucial to success.

Overview of CoCubes Coding Module

The CoCubes coding module assesses key programming skills across a range of topics and difficulty levels. Most coding questions are designed to be language-agnostic, focusing instead on problem-solving logic and efficiency.

Quick Tip: Although CoCubes allows programming in languages like C, C++, Java, and Python, your choice of language should be the one you’re most comfortable with, as time efficiency is key.

Insights from Previous Year CoCubes Coding Questions

Analysing past questions offers insight into the structure and focus of CoCubes coding tests. Questions tend to cover fundamental concepts and practical applications. Here are some examples from previous years:

Tip for Freshers: Review a variety of questions from each year to identify recurring concepts, as many companies prefer these tried-and-tested questions to evaluate core skills.

Commonly Repeated CoCubes Coding Questions

Certain question types tend to reappear over the years, providing an excellent focus for preparation. Below are some popular examples:

Pro Tip: Prioritize these repeated questions in your practice sessions, as familiarity with them will increase your accuracy and confidence.

Breakdown of Coding Topics in CoCubes

Here’s a structured look at the key areas covered in the CoCubes coding test to help freshers focus their preparation:

1. Basic Programming Concepts – Covers fundamental operations such as basic I/O, loops, and data type manipulations.
2. Data Structures – Questions on arrays, linked lists, stacks, queues, and binary trees are common.
3. Algorithms – Includes sorting (e.g., Bubble, QuickSort) and searching (e.g., Binary Search) algorithms.
4. Mathematics – Includes problems like prime number checking, factorial calculations, and Fibonacci series generation.
5. String Manipulation – Encompasses palindrome checking, anagram verification, and substring extraction.

Top 5 Coding Questions for CoCubes 

Problem Statement 1

One day, Mary wanted to give a present to her friend. She decided on a beautiful bouquet of flowers and began collecting them. She needed precisely 2 types of flowers, and the total number of flowers required was 't'. To gather these, she started picking from her garden, which contained 'N' types of flowers.

Each type was arranged in a queue in non-decreasing order, such as 1, 3, 6, 15, and so forth. Now, she seeks your help in determining the indexes of the flowers she should collect.

Note: For every case, there will always be a pair of flowers whose sum equals 't'. If multiple pairs exist, select the first occurrence.

Input Format

The first line contains integers N and t, where N is the total types of flowers and t is the total number of flowers needed. The second line contains n integers a1,a2,…, an- elements of the a array.

Output Format

Print the indexes of the two flowers that sum up to 't'. The first index should be smaller than the second index. Both indexes should be zero-based.

Constraints

2 <= N <= 10^4

1 <= a[i] <= 10^3

2 <= t <= 2*10^3

Solution C++

Solution Java

Soultion Python

Problem Statement 2

John was learning about arrays when his friend Ram arrived. Seeing John, Ram thought of a challenge for him. He challenged John to calculate the "measurement" of an array a of size n.

Given a 0-indexed array, Ram defined the measurement of the array as the sum of the "sanities" of all the elements in the array. To calculate the sanity of each element in the array, the following operations need to be performed: Sort the given array.

Calculate the sanity of an element in the array, which is defined as the sum of its original index (before sorting) and the index of its last occurrence in the new array (after sorting).

Your task is to help John calculate the measurement of the array. Since the output may be too large, print it modulo 10^9+7.

Note that duplicate elements may exist in the array.

Input Format

The first line contains ‘n’ denoting the number of elements in the array a.

The next line contains n elements denoting the elements of the array a.

Output Format

Print the measurement of the given array

Constraints

1<=n<=10^6

1<=ai<=10^6

Solution C++

Solution Java

Solution Python

Problem Statement 3

Ravi discovered that some strings read the same forwards and backwards, which are called palindromes. He noticed that every string he encountered had at least one palindromic substring. He wants to know how to find the longest palindromic substring in a given string, S.

Can you help him determine the length of this longest palindromic substring?

Input Format

The first line of input contains an integer N representing the length of the string.

The second line of input a string S representing the given string whose longest substring we have to find.

Output Format

Display an integer representing the length of the longest palindromic substring possible.

Constraints

1<= N <=10^7

Solution C++

Solution Java

Solution Python 

Problem Statement 4

In a shoe factory, left and right shoes are produced separately, each with an integral ID according to its design and size. After manufacturing, the shoes are sent to Bob, who pairs the left and right shoes with matching IDs. Each shoe can only be paired once, and the manager wants to know the IDs of all matching pairs in sorted order before final packaging.

Input Format

The first line of the input contains two integers, n and m – the number of left and right shoes, respectively.

The second line contains n space-separated integers a1, a2, ..., an – the IDs of all the left shoes

The third line contains m space-separated integers b1, b2, ..., bm – the IDs of all the right shoes.

Output Format

In the first line, print p – the number of pairs that will be ready.

In the next line, print p space-separated integers – the IDs of all the pairs that will be ready in sorted order.

Constraints

1 <= n, m <= 10^4

0 <= ai, bi <= 10^4

Solution C++

Solution Java

Solution Python

Problem Statement 5

As the festival season approaches, Simon’s mother assigns him N tasks to be completed in D days. Each task has a difficulty level represented by jobs[i] (where 0 <= i < N). Simon must complete at least one task each day, using all D days.

The difficulty Simon experiences each day is defined by the highest difficulty task he completes that day. To work on task i, all preceding tasks j (where 0 <= j < i) must be completed first.

Given an array of task difficulty and an integer D, representing the difficulty of each task and the number of days, respectively, determine the minimum total difficulty Simon faces to complete all tasks. If it’s not possible to schedule the tasks within the given days, return -1.

Input Format

The first line contains an integer B, the size of the array.

The second line contains N space-separated integers representing the array Arr[i].

The last line contains an integer D, denoting the number of days.

Output Format

Print a single integer with minimum difficulty representing the minimum difficulty Simon faces when scheduling all tasks.

Constraints

1 <= N <= 3*10^2

0<= Arr[i] <= 10^3

1<= D<=10

Solution C++

Solution Java

Solution Python

Conclusion

Cracking the CoCubes coding test is highly achievable with focused preparation. Practising a range of questions, reviewing past questions, and emphasising commonly repeated topics can give freshers the necessary advantage. 

As you prepare, remember to focus on clarity, efficiency, and error-free code to maximise your score. Keep honing your skills, stay consistent, and you’ll be ready to tackle CoCubes confidently!

Frequently Asked Questions (FAQs)

1. What types of questions are asked in the CoCubes coding test?

The CoCubes coding test includes questions on basic programming, data structures, algorithms, and string manipulations, with a mix of beginner to advanced difficulty.

2. What programming languages are allowed in CoCubes coding tests?

Candidates can choose from C, C++, Java, and Python, with flexibility in selecting the language they are most comfortable in.

3. Where can I find previous CoCubes coding questions for practice?

Questions from previous years can often be found on online forums, educational platforms, and paid test-prep services that specialise in placement materials.

4. How many questions are typically repeated in CoCubes coding tests?

While exact questions may not repeat verbatim, similar problem types (e.g., palindrome checks sorting algorithms) appear frequently. Practising these can boost your familiarity.

5. What score is needed to pass the CoCubes coding test?

There isn’t a fixed passing score as requirements vary by company, but aiming for accuracy and avoiding syntax errors is essential for a strong performance.

Disclaimer: While we strive for accuracy, we do not guarantee its completeness or reliability. Readers are encouraged to verify all facts and statistics from the official company website or check independently before making decisions. 

Suggested reads:

• Deloitte Coding Questions: Top 5 Coding Questions for Freshers
• TCS Digital Coding Questions: Top 5 Coding Questions & Solutions
• TCS Ninja Coding Questions: Top 5 Coding Questions with Solution
• HCL Coding Questions: Coding Pattern with Questions & Solutions
• Infosys Verbal Ability Questions: Best MCQs & Tips for Freshers 2025