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 Does Infosys Hire & What Is Its Recruitment Process?

Infosys Limited is a multinational information technology firm based in India that specializes in business consulting, information technology, and outsourcing. The firm is based in Bangalore and was started in...

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

## Magical Ropes

CONCEPTS USED: Binary Search DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array H of lengths of Magical Ropes and array R of the rate by which rope increases daily, print...

CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Print all those elements that have no element greater than them in the right side of the array. Print elements from...

## Greater And Least

CONCEPTS USED: Searching DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given a number N, find the smallest number that has same set-of-digits as N and is greater than N. If N is...

## Array Max

CONCEPTS USED: Suffix Sum Arrays DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array of N integers and an integer K, the task is to find the maximum sum taking every...

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

## Multiplication of Digits

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

## Sliding Window

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