## Check Palindrome

CONCEPTS USED: Recursion DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given a number N, check whether the number is palindrome or not using recursion. The palindrome number remains the same when its...

Skip to content
## Check Palindrome

## Sum of Sequence

## Pragya and Gold Medalist

## Print the Pattern

## Min and Max

## Array Rotation

## PERMUSEQ

## Minimum characters required to add to given string to make it palindrome

## Pairs

## Arrange Ways

## First Capital Using Recursion

## Total number of ways to form a team of size K from X men and Y women with at least 4 men and 1 woman in the team

## POWERLEX

## Mike and Exam

## Multiplication of Digits

## N Digit Sum

## N Digit Sum Even Odd

## Quadrilateral

## Saitama’s Punch

## Minimum number of notes

## Benchmates

## How to Convert an Array into Zigzag Array?

## Sliding Window

Rambo Numbers Concepts Used Mathematics Difficulty Level Hard Problem Statement (Simplified): For given three numbers r,p,q. We have to find the total number of values divisible by r in a...
## Top 50 C Programming Interview Questions and Answers

## What is a Real-Time Operating System (RTOS)?

## What are the Different Types of Inheritance in C++?

## Right questions to ask in an interview

## How to introduce yourself in an Interview?

## How can a Non-CSE student get placed IT/Software company in 2-3 months?

Get free ebooK with 50 must do coding Question for Product Based Companies solved

Fill the details & get ebook over email

Thank You!

We have sent the Ebook on 50 Must Do Coding Questions for Product Based Companies Solved over your email. All the best!

CONCEPTS USED: Recursion DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given a number N, check whether the number is palindrome or not using recursion. The palindrome number remains the same when its...

CONCEPTS USED: Collatz conjecture DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given a positive number N, write a recursive function and sum all the number until N reaches to 1 after performing...

CONCEPTS USED: Recursion DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given two strings S1 and S2, print the count of all their Interleaving Strings. NOTE: Interleaving String is a string that has...

CONCEPTS USED: Recursion DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given a number N, print its decreasing sequence (i.e. keep subtracting by 5) till it reaches (<=0) and then print its increasing...

CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): With a given array of size N, find the largest (maximum) and smallest (minimum) element from the elements. See original problem...

CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): With a given array of size N and steps K, we have to print the array after K rotations to the...

CONCEPTS USED: Recursion DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given a sorted array A containing N distinct elements, your task is to find the Mth permutation of the given array. For...

Concepts Used Strings, LPS array KPS Algorithm Difficulty Level Hard Problem Statement (Simplified): Find the minimum number of characters required to add to the given string to make it a...

CONCEPTS USED: Hashing DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given M pairs of integers, where each integer is between 1 and N inclusive. Check if there exists two integers x and...

Concepts Used: Mathematics Difficulty Level: Medium Problem Statement (Simplified): We have to find in how many ways we can arrange X number of men from M men and Y women...

CONCEPTS USED: Recursion DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given a String T, find the 1st occurrence of the capital (uppercase) alphabet. Print its index if present, else -1. See original...

Concepts Used: Mathematics Difficulty Level: Hard Problem Statement (Simplified): In this problem, we have to find a total number of ways to form a team of size K from X...

CONCEPTS USED: Recursion DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given a string, write a recursive code to print all subsets of it. The subsets are to be printed in lexicographical(alphabetic) order....

CONCEPTS USED: Recursion DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given an array containing N elements and an integer K, find the number of ways to calculate the value of K using...

CONCEPTS USED: Recursion DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given an integer N, recursively find the multiplication of digits of N modulus with 10^9+7. See original problem statement here For Example:...

CONCEPTS USED: Recursion DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given a digit N and an integer Sum, print all the N-digit integers whose digit sum is equal to the given Sum....

CONCEPTS USED: Recursion DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an integer N, print all N-digit numbers with sum of digits at Even index equal to sum of digits at Odd...

CONCEPTS USED: Basic Mathematics, Co-ordinate Geometry DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given 4 coordinate points, check if the given quadrilateral formed from given coordinates forms a Square or not, print...

CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array A which contains the sorted time points at which a hero named Saitama punches and paralyzes his enemy...

The concept of finding the minimum number of notes refers to a problem often encountered in programming, where the goal is to determine the smallest number of currency notes required...

CONCEPTS USED: Efficient Array Search DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given marks of N students sitting on a bench and a value of K, print the index of the student...

Welcome to the world of array manipulation! If you've ever found yourself pondering over the task of converting a straightforward array into a zigzag array, you're in the right place....

CONCEPTS USED: Sliding Window Technique DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given an array A, we need to find two sub-arrays with specific lengths L and R such that sum of...

Q1. You know what are Increment and Decrement operators correct? What I want to know is how increment and decrement operators can be constructed using basic mathematical operators? Ans. (First,...

A real time operating system is a software system that is designed to manage real time applications. Real time applications require immediate responses to inputs and events, and the real...

Inheritance is one of the most important features of Object Oriented Programming (OOPs), and it plays a critical role in creating flexible and reusable code. Inheritance in C++ is a...

Just like the way the interviewer asks you at the very beginning of the interview to Introduce yourself; in 95% cases, they do also ask this question towards the end...

The highest guaranteed question to come up in an interview regardless of your industry, your job experience, and job type is - Tell me about yourself! You must have handed...

This blog is of great use for students who are from Non-CSE branch and still have 2-3 months in hand before they appear for their dream company. Even if companies...