Why do we still use C? Isn’t it quite old? Ans. C is considered to be the mother of all modern-day languages. It was initially created for the purpose of...
Linked List is a linear data structure which comprises of elements/nodes stored at various locations not necessarily contiguous. But don’t we have arrays for keeping a list? Well, there are...
In this tutorial, we will be discussing Wipro interview questions for freshers and experienced. If you have the talent, passion, and ability to work, able to work on cutting-edge technologies...
1. Write a program to swap two numbers in Java. Ans. Two ways to do this -with third variable and without third variable. public static void swapNumberswithtemp(int a, int b)...
C is a general-purpose procedural programming language developed by Dennis M. Ritchie. It was used to develop the UNIX operating system so you can understand how powerful it really is....
What is immutable object? Ans. Immutable objects can be created of immutable classes. Objects of these class cannot be modified. So whenever we try to change or modify these objects...
1. Write a program in Java to reverse a number. Ans. Extract each digit and keep multiplying with 10 and adding the remainder. static int REV(int n){ long RevNumber=0; while...
1. What is the difference between procedural language and object-oriented language? Ans. Procedural Programming languages follow a sequence of instructions and conveys it to the computer. Procedural programming depends on...
How to crack coding interview Whether you are a recent graduate or a job seeker, if you are searching for a job this article will help you to prepare yourself...
Java is a highly well-known object-oriented programming language that was developed in 1972, but it has continued to be one of the most crucial languages for decades. As its competitors...
Concepts Used Binary Search Difficulty Level Easy Problem Statement : Finding a number has always been an interesting puzzle! Well in this problem we are given a sorted array of...
This blog will give the detailed description to Delete Nth node from the end of the linked list. Deleting the Nth node from the end of the linked list will...
Concepts Used DYNAMIC PROGRAMMING Difficulty Level Easy. Problem Statement : Once upon a time, Arya visited a toy store. As Arya is a small kid he is attracted to every...
CONCEPTS USED: Dynamic programming. DIFFICULTY LEVEL: Easy. PROBLEM STATEMENT(SIMPLIFIED): Arnab is now handed N rupees, he is asked by his mom to buy at least two ingredients which when used...
CONCEPTS USED: Recursion and Backtracking. DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): Rohan is now fond of balanced sequences, but suddenly he realized that he is in love with balanced parenthesis. Now...
CONCEPTS USED: Recursion,Dynamic programming. DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): Arnab is now given N nodes. Now he asked how many binary search trees can be formed using those N nodes....
LCS, which stands for "Longest Common Subsequence" is a fundamental problem in computer science and bioinformatics. It involves finding the longest subsequence that is common to two or more sequences....
CONCEPTS USED: Dynamic programming. DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Arnab is now given N numbers, which are actually stacks of coins containing a[i] amount of coins each. Now he is...
CONCEPTS USED: Dynamic programming DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Himanshu visited a building with N floors and he carried with him k eggs, he found out that the eggs are...
Concepts Used Dynamic programming. Difficulty Level Medium. Problem Statement : Let's suppose when a person i cheats from a person j, then we draw a line segment between them. We...
CONCEPTS USED: Dynamic programming DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT (SIMPLIFIED): Arnab is now given a String S. He is given N different typed of pieces of sticks with strings written...
CONCEPTS USED: Dynamic programming DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): For each query , give the size of maximum square with all pictures i.e. all ones from the given matrix of...
CONCEPTS USED: Dynamic programming DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Arnab can take one candy from each row of candies but with the restrictions imposed: There are 3 sections in each...
CONCEPTS USED: Recursion and memorization. DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT$($SIMPLIFIED$)$: There are notes having values V1,V2,V3...Vn arranged in a row. You and your friend take turns alternatively. In each turn...
CONCEPTS USED: Dynamic programming DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): After having lost to you the last time, your friend challenges you to another round of Monopoly. This time, he changes...
CONCEPTS USED: Dynamic programming DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): After having lost to you again, your friend challenges you yet again for another round of Monopoly. This time, he changes...
Concepts Used Reversing a linked list,pointers Difficulty Level Hard. Problem Statement : Reverse a linked list from position M to N. Do it in-place and in one-pass. Example: Given 1−>2−>3−>4−>5−>NULL,...
Concepts Used Stack Difficulty Level Hard Problem Statement : Rahul and Ritika are playing a game of stacks where each of them are having a stack A and B of...