Programming Articles - Page 1459 of 3363

Given a square matrix[][] containing non negative numbers as its elements. Also given a variable score. The goal is to count the ways to reach the given score by adding elements from matrix[][] such that only moves allowed are right moves and down moves. Starting from matrix[0][0] only moves can be, move to matrix[0][1]  ( right move ) or move to matrix[1][0] ( down move ) and add value to reach sum=score.Let us understand with examples.For ExampleInput -  matrix[row][col] = { {1, 1}, { 1, 1} } score=3Output - Count of number of ways to reach a given score in a ... Read More

We are given a string and a range starting from start till end and the task is to calculate the count of palindromic substring present in a given range. Palindrome strings are those strings which are similar from forward and backward of a string like nitin, aba, etc.For ExampleInput - InputString = "cccaabbbdee", start = 2, end = 6;Output - Count of Palindromic substrings in an Index range 7Explanation - we are given with a range and a string so, we will start traversing the string from the start pointer which is 2 i.e. 'c' till 6 i.e. 'b' therefore the substring is ... Read More

In this tutorial, we are going to write a program that creates a new linked list from the given linked lists.We have given two linked lists of the same size and we have to create a new linked list from the two linked lists with the max numbers from the two linked lists.Let's see the steps to solve the problem.Write a struct node.Create two linked lists of the same size.Iterate over the linked list.Find the max number from the two linked lists nodes.Create a new node with the max number.Add the new node to the new linked list.Print the new ... Read More

In this tutorial, we are going to learn how to create a linked list from the given array.Let's see the steps to solve the problem.Initialize the array with dummy data.Write the struct node.Iterate over the array.Create a new node with the data.Insert the new node into the linked list.Print the linked list.ExampleLet's see the code.#include using namespace std; struct Node {    int data;    Node* next; }; struct Node* newNode(int data) {    Node* node = new Node;    node->data = data;    node->next = NULL;    return node; } void insertNewNode(Node** root, int data) {    Node* ... Read More

In this tutorial, we are going to write a program that creates a new string by alternately combining the characters of the two halves of the string in reverse order.Let's see the steps to solve the problem.Initialize the string.Find the length of the string.Store the first half and second half string indexes.Iterate from the ending of the two halves of the string.Add each character to the new string.Print the new string.ExampleLet's see the code. Live Demo#include using namespace std; void getANewString(string str) {    int str_length = str.length();    int first_half_index = str_length / 2, second_half_index = str_length;    string ... Read More

In this tutorial, we are going to reflect the given binary tree.Let's see the steps to solve the problem.Write a struct node.Create the binary tree with dummy data.Write a recursive function to find the mirror of the given binary tree.Recursively call the function with left and right nodes.Swap the left node data with the right node data.Print the tree.ExampleLet's see the code. Live Demo#include using namespace std; struct Node {    int data;    struct Node* left;    struct Node* right; }; struct Node* newNode(int data) {    struct Node* node = new Node;    node->data = data;    node->left = ... Read More

In this tutorial, we are going to write a program that creates a new linked list from the given linked lists.We have given two linked lists of the same size and we have to create a new linked list from the two linked lists with the max numbers from the two linked lists.Let's see the steps to solve the problem.Write a struct node.Create two linked lists of the same size.Iterate over the linked list.Find the max number from the two linked lists nodes.Create a new node with the max number.Add the new node to the new linked list.Print the new ... Read More

In this tutorial, we are going to learn how to double the given tree.Let's see the steps to solve the problem.Create node class.Initialize the tree with dummy data.Write a recursive function to double the tree.Recursively traverse through the tree.Store the left node in a variable.After traversing add the data by creating a new node.Now, add the left node to the newly created node as a left child.Print the tree.ExampleLet's see the code. Live Demo#include using namespace std; class node {    public:    int data;    node* left;    node* right; }; node* newNode(int data) {    node* Node = ... Read More

In this tutorial, we are going to write a program that doubles the first element and moves all the zeroes to the end of the given array.We have to double a number when there are tow the same elements in adjacent indices. After that, we have to add a zero to the array.Move all the zeroes in the array to the end.ExampleLet's see the code. Live Demo#include using namespace std; void moveZeroesToEnd(int arr[], int n) {    int count = 0;    for (int i = 0; i < n; i++) {       if (arr[i] != 0) { ... Read More

In this tutorial, we are going to create a double-ended priority queue using the set in c++.Let's see the steps to create a double-ended queue.Create a struct with a name as you wish.Create a variable for the queue using the set.size method that returns the size of the queue.is_empty method that returns whether the queue is empty or not.insert method to insert a new element into the queue.get_start method that returns an element from the left side of the queue.get_end method that returns the element from the right side of the queue.delete_start method that deletes the first element from the ... Read More