Prateek Jangid has Published 172 Answers

C++ program to Reorder the Given String to Form a K-Concatenated String

Prateek Jangid

Prateek Jangid

Updated on 10-Aug-2022 13:03:21

We are given a string and an integer k, and we need to reorder the characters in the string so that it becomes the concatenation of k similar substring. If not possible, output the result as "Impossible”. string = "malaalam"; K = 2; res = solve(s, K); Example (Using ... Read More

C++ program to Replace Duplicates with Greater than Previous Duplicate Value

Prateek Jangid

Prateek Jangid

Updated on 10-Aug-2022 12:54:28

A series of integers is given in this article. Let's say we have an array of four elements without counting the repetitive elements, [2, 2, 5, 5, 7, 8, 7], and we have to make the array distinctive. Changing a value with one that is greater than the previous one ... Read More

C++ program to remove row or column wise duplicates from matrix of characters

Prateek Jangid

Prateek Jangid

Updated on 10-Aug-2022 12:18:34

We are given a 2D matrix with rows and columns. The matrix consists of elements in char data type. A method is devised to remove the elements which are duplicated in their respective rows or columns. In this method, we check if any element is repeating in its row or ... Read More

Finding the second largest element in BST using C++

Prateek Jangid

Prateek Jangid

Updated on 10-Aug-2022 12:03:40

In a binary search tree (BST), the second largest element must be returned. In a binary tree, the second element is the largest element. According to the given BST, 13 is the second largest element. Now we are using the C++ approach to solve this problem. We can traverse ... Read More

C++ program to find the shortest distance between two nodes in BST

Prateek Jangid

Prateek Jangid

Updated on 10-Aug-2022 12:02:23

In this article, we are given a BST (binary search tree), and we need to find the shortest distance between 2 given nodes in the BST. Let's have a tree and below are the following scenarios. Let’s assume some simple input and output scenarios Now we have to find ... Read More

C++ program to Replace a Node with Depth in a Binary Tree

Prateek Jangid

Prateek Jangid

Updated on 10-Aug-2022 11:58:31

Suppose we have a binary tree and we want to replace the depth of each node with its value. The depth of the node starts from 0 at the root node and increases by 1 for each level we go; for example, we have a binary tree like this; ... Read More

Replace Each Node in Binary Tree With The Sum Of Its Inorder Predecessor And Successor Using C++

Prateek Jangid

Prateek Jangid

Updated on 10-Aug-2022 11:54:27

We are given a binary tree, and we need to replace all the elements with the sum of its inorder predecessor and successor. Inorder is a traversed path in a graph that reads in the order of left node – root node – right node. The method adds the elements ... Read More

Rencontres Number (Counting partial derangements) Using C++

Prateek Jangid

Prateek Jangid

Updated on 10-Aug-2022 11:50:50

Given two integers N and k, we need to count the number of derangements where k points are fixed at their position. Given constraints on k are between 0 and n as the number of fixed points when there are n points cannot be more than n. int N=4, k=2; ... Read More

Remove Edges Connected to a Node Such That The Three Given Nodes are in Different Trees Using C++

Prateek Jangid

Prateek Jangid

Updated on 10-Aug-2022 11:48:01

Suppose we are given a binary tree and three nodes in that binary. We have to disconnect one node entirely from the tree. Disconnecting that node leaves us with three different trees. Each of the three given nodes lies in one of them, or each of the given three nodes ... Read More

Searching an Element in a Linked List using C++

Prateek Jangid

Prateek Jangid

Updated on 10-Aug-2022 10:09:30

To search an element in a linked list, we must iterate through the complete list, compare each node with the desired data, and keep searching until a match is obtained. Because a Linked List does not provide random access, we must start the search from the first node. We are ... Read More

1 2 3 4 5 6 7 ... 18 Next
Advertisements