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!

How to crack a job interview at Wipro? Know more about the recruitment process!

Wipro is a multinational IT services company. The company is headquartered in Bangalore, India. The company's primary function is that of an IT consulting and outsourced service provider. In addition,...

TCS Is Hiring & You Can Be Their Next Best Recruit!

Tata Consultancy Services (TCS), one of the worlds largest IT services and consulting companies, is on the lookout for talented individuals to join their workforce. With a reputation for excellence,...

FIND SHELTER

CONCEPTS USED: Greedy algorithm. DIFFICULTY LEVEL: Easy. PROBLEM STATEMENT(SIMPLIFIED): Nishant is lost along with his N−1 wandering friends. Now they have to find some shelter. Nishant and his N−1 friends...

DIGIT GAME

CONCEPTS USED: Greedy algorithm. DIFFICULTY LEVEL: PROBLEM STATEMENT(SIMPLIFIED): Arnab is playing a game. He is given a number N in string format and now he is asked to remove M...

Chocolates

Concepts Used Sorting Difficulty Level Medium Problem Statement (Simplified): For given values of N and K, an array of N elements is given. You can pick at most K items...

Find the Closest Palindrome

Concepts Used Strings Difficulty Level Hard Problem Statement (Simplified): For given numbers we have to print the nearest anagram to it if two numbers are equidistant and anagram to the...

Arithmetic Progression

CONCEPTS USED: Hashing, Basic Mathematics DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array of N integers, print the value of all those elements, whose indexes form an increasing Arithmetic Progression...

Range Even

CONCEPTS USED: Recursion DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given a number N, your task is to print all even numbers (>0) from 1 to N using recursion. See original problem...

Pairs

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...

Minimum number of notes

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...

Benchmates

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...