Programming Articles - Page 805 of 3363

In this problem, we are given a sorted linked list consisting of N elements. Our task is to finding Median in a Sorted Linked List.Sorted Linked List is a simple linked list in which all elements are sorted in a specific order. Example − 4 -> 6 -> 7 -> 9 -> NULLMedian is the middle elements of the linked list. It can be found as if N is odd : median is (n/2)th elementif N is even −s median is average of (n/2)th element and (n/2 + 1)th element.Let's take an example to understand the problem, Input: 2 -> ... Read More

In this problem, we are given an 2D matrix mat[][]. Our task is to find inverse of a matrix using Gauss Jordan Method.Now, lets understand the basics of the problem, MATRIX is a two dimensional array of numbers.Example$\begin{bmatrix}2&5&4 \1&6&7 \9&3&8\end{bmatrix}$Inverse of Matrix [A-1] −It is an operation performed on square matrix. The following are the properties that are required for a matrix to have an inverse −Initial matrix should be square matrix.It must be non-singular matrix.An identity matrix I exist for the matrix A such that, $$AA^{-1} = A^{-1}.A = I$$Their is a formula that can be used to find ... Read More

Format String − It is an ASCII string that is used for formatting strings. It is an ASCII string consisting of texts and formatting parameters.For formatting, the program’s output, there are various format strings in C.FORMAT STRING VULNERABILITIESThese are bugs that arise due to errors in programming that might be made easily by the programmer. If any such error-prone code blog is passed to output functions like printf, sprintf, etc. Then the write operation is performed to an arbitrary memory address.Example#include #include int main(){    char buffer[100];    strncpy(buffer, "Hii ", 5);    printf(buffer);    return 0; ... Read More

In this problem, we are given a number N. Our task is to find the decimal conversion of the fist three and last three bits for the given integer values N.Let's take an example to understand the problem, Input : 57 Output : 71Solution ApproachA simple solution is by changing the number n into its binary equivalent and then saving the bits in an array. After this, we will convert the first three and last three values from the array into numbers individually. The decimal conversion of both the sets of bits is our result.For example, take the number 80.The ... Read More

In this problem, we are given a number n and a prime number p. Our task is to find the power of prime number p in n!Let's take an example to understand the problem, Input : n = 6, p = 2 Output : 4Solution ApproachA simple solution to the problem is by simply finding the values of n!. And the factorize it, and find the power of prime number p in the factorization.Here, the number can be represented as the power factorization of 2 in 5! = 30 is 3.The value of n factorial is$$n!\:=\:n^*(n-1)^*(n-2)^*(n-3)\dotso{^*}2^*1$$ $$n!\:=\:3^*2^*1\:=\:6$$Let take n = 6 ... Read More

In this problem, we are given a number n. Our task is to find the n-th term of series 3, 13, 42, 108, 235...Let's take an example to understand the problem, Input : 5 Output : 235Solution ApproachThe series can be represented as the sum of cubes of first n natural numbers. The formula for that is (n*(n+1)/2)2. Also if we add 2* to it we will get the required series.The formula for sum of the series is (n*(n+1)/2)2+2*n.For n = 5 sum by the formula is(5 * (5 + 1 ) / 2)) ^ 2 + 2*5= (5 * ... Read More

In this problem, we are given a positive integer. Our task is to create a program to form the smaller number using at most one swap operation.We will be creating a new number using the digits of the existing number. The smallest number formed can have only one digit swapped from the existing number.Let’s take an example to understand the problemInput: n = 63519 Output: 36519Solution ApproachOne method to solve the problem is by finding all the numbers created by swapping pair of digits of the given number. Out of all these swapped digit numbers, the smallest one is returned. ... Read More

In this problem, we are given a positive integer. Our task is to create a program to form the largest number using at most one swap operation.We will be creating a new number using the digits of the existing number.The largest number formed can have only one digit swapped from the existing number.Let’s take an example to understand the problemInput: n = 63512 Output: 65312Solution ApproachOne method to solve the problem is by finding all the numbers created by swapping pair of digits of the given number. Out of all these swapped digit numbers, the largest one is returned. For ... Read More

In this problem, we are given a 2d array representing a 2-D screen, the coordinates of a pixel on the screen to be filled with color and the color. Our task is to create a program to Color the current pixel and all the adjacent pixels which have that color.Coloring in paint, we will select a color and click on the given pixel with a brush.Let’s take an example to understand the problemInput: Sceen[][] = {{W, W, B, W, W, W, W, W}, {W, W, W, W, W, W, B, B}, {W, B, B, W, W, B, W, W}, {W, ... Read More

In this problem, we are given two integer values. Our task is to create a c program to operform the operation, For every set bit of a number toggle bits of other. Let’s take an example to understand the problemInput: 3 7 Output: 4 Binary of 3: 011 Binary of 3: 111First and second bits of the second number is flipped which makes it 100 i.e 4.Solution ApproachAn approach to solve the problem is by performing the XOR operation of the two numbers. The result will be toggled for the bit where ever the bits of the I’st is 1 using ... Read More