Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Programming Articles
Page 1812 of 2547
Count of Numbers Between L and R that are Coprime with P in CPP
In the field of computer programming, finding the count of numbers between a given range that are coprime with a specific number can be a common task. Coprime numbers, also known as relatively prime numbers, are those that have no common factors other than 1. In this piece, we shall delve into finding the coprime numbers count between two given integers, L and R when referring to a particular number P, through the aid of C++ language. Syntax We'll commence by outlining the syntax of the approach we will be utilizing in the succeeding code examples − int countCoprimes(int ...
Read MoreMinimum Moves to Make a String Palindrome by Incrementing All Characters of Substrings
In the realm of computer science and programming, discovering effective algorithms for resolving issues is highly significant. An intriguing issue is identifying the smallest possible quantity of maneuvers necessary to convert a string into a palindrome by increasing all characters within substrings. This write-up delves into two methodologies to handle this concern utilizing the C++ programming language. Syntax Before diving into the approaches, let's define the syntax of the function we will be using − int minMovesToMakePalindrome(string str); Algorithm Our objective is to minimize move count in converting strings into palindromes—a problem which our algorithm approaches with these ...
Read MoreKth Character After Replacing Each Character of String by its Frequency Exactly X Times
In this problem we have given a string ‘str’, integer K, and integer X. That string ‘str’ contains only integers in the range between 1 to 9. We have to perform an operation over the string exactly X times. Operation is that every time we have to replace a character of string by itself its frequency times. Here the frequency means the number or the value of the character of the string. Our task is to return the kth character after doing a given operation exactly X times. Sample Examples Input 1: str = “1231”, K = 5, X = ...
Read MoreGreedy Best-First Search Algorithm in C++
Good problem-solving in computer science heavily relies on efficient algorithms like the Greedy-Best First Search (GBFS). GBFS has already established credibility as an optimal solution method for pathfinding or optimization issues. Therefore, we're discussing GBFS thoroughly in this article while exploring its implementation approach using C++. Syntax void greedyBestFirstSearch(Graph graph, Node startNode, Node goalNode); Algorithm The Greedy Best-First Search algorithm aims to find the path from a given start node to a goal node in a graph. Here are the general steps of the algorithm − Initialize an empty priority queue. Enqueue the start node into the priority ...
Read MoreConvert given Strings into T by replacing characters in between strings any number of times
Convert string means we have to make the same as a given string on the basis of a given condition. In this problem, we have given an array of strings ‘arr’ and string ‘T’ of size ‘M’. our task is to check if is it possible to make all the string present in an array as same as the given string T by removing any character from a string of an array ( arr[i] ) and inserting that character into any index of another string of the array ( arr[j] ). We can do this any number of times. If ...
Read MoreCheck if the Maximum Sum of Visible Faces of N Dice is at Least X or Not
Efficiency and accuracy are often essential when solving complex problems in programming. One particular challenge involves appropriately identifying whether the maximum sum of N dice visible faces equals or surpasses X. In this piece, we evaluate various methods of tackling this difficulty in C++ coding, complete with syntax explanations and step-by-step algorithms. Furthermore, we will provide two real, full executable code examples based on the approaches mentioned. By the end, you will have a clear understanding of how to check if the maximum sum of visible faces of N dice is at least X in C++. Syntax Before diving into ...
Read MoreProgram to print binomial expansion series
Binomial expansion is a mathematical formula used to expand the expressions of the form (a+b)^n, where n is a positive integer and a and b can be any real or complex numbers. The expansion gives the coefficients of the terms in the expansion. A binomial expansion can be represented as $$\mathrm{(a+b)^n= ^nC_0a^nb^0+ ^nC_1a^{n-1}b^1 + ^nCa^{n-2}b^2+...+ ^nC_ra^{n-r}b^r+...+ ^nC_na^0b^n}$$ where $\mathrm{^nC_r}$ are the binomial coefficients and is given by $\mathrm{^nC_r=\frac{n!}{r!\times(n−r)!}}$ where n! is the factorial of n The expansion can be used for calculating all the binomial terms using the formula above and putting it into the expansion equation. Problem ...
Read MoreMessage Passing in Java
Introduction Message passing, a method of transferring communications among items or threads, is an essential idea in distributed systems and parallel programming. The transmission of messages in Java may be accomplished with an assortment of methods and structures, based on the implementation's particular needs Using the power source java.util.concurrent the container, which offers an array of interfaces and class libraries for establishing and handling threads that are active locks, and synchronization mechanisms, is a single method for implementing passing messages in Java, for instance. An Executor interface, for instance, is able to be utilized without delay to carry out duties, ...
Read MoreHow to get the value of System Property and Environment Variable in Java?
Acquiring values of system properties and environment variables plays a pivotal role in accessing critical configuration information within applications written using Java. System properties encompass various elements of a system, such as its Java installation directory or version number or user preferences. Environment variables, on the other hand, are dynamic values set either by an operating system or user that impact application performance. By accessing these properties and variables, you gain invaluable insights into the system configuration that enable you to adapt your code accordingly for greater compatibility, customization and seamless integration into its surrounding environment. Environment ...
Read MoreModify array of strings by replacing characters repeating in the same or remaining strings
Modifying an array of strings by replacing characters repeating in the same or remaining strings is a common problem in programming. It can be solved using hash tables, sets, arrays etc. The aim is to improve the time and space requirements while providing the same functionality. This problem can be encountered in many real-life scenarios, such as processing large text or cleaning up datasets with duplicates. Problem Statement Given an input string array arr[] containing lowercase and uppercase characters. The goal is to modify the array by removing characters from the strings which are repeating in the same string or ...
Read More