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 1749 of 2547
How to Find Factors of Number using Python?
In order to find factors of a number, we have to run a loop over all numbers from 1 to itself and see if it is divisible.Examplenum=int(input("enter a number")) factors=[] for i in range(1,num+1): if num%i==0: factors.append(i) print ("Factors of {} = {}".format(num,factors))If i is able to divide num completely, it is added in the list. Finally the list is displayed as the factors of given numberOutputenter a number75 Factors of 75 = [3, 5, 15, 25, 75]
Read MoreHow to create Python dictionary by enumerate function?
Python enumerate() function takes any iterable as argument and returns enumerate object using which the iterable can be traversed. It contains index and corresponding item in the iterable object like list, tuple, or string.Such enumerate object with index and value is then converted to a dictionary using dictionary comprehension.>>> l1=['aa','bb','cc','dd'] >>> enum=enumerate(l1) >>> enum >>> d=dict((i,j) for i,j in enum) >>> d {0: 'aa', 1: 'bb', 2: 'cc', 3: 'dd'} Learn Python with our step-by-step Python Tutorial.
Read MoreHow to Calculate the Value of nPr in Swift?
nPr is known as n permutation r, where n represents the total numbers and r represents the arrangement of the elements. A permutation is known as the arrangement of elements in a specified order. Elements can arrange either in a sequence or in a linear order, for example, we have a set of elements [2, 4], so the permutation is: [4, 2], [2, 4]. In permutation the order of elements matters whereas in combination the order of the elements does not matters. We can calculate the value of nPr with the help of the following formula: Formula nPr = ...
Read MoreMinimum Removals are Required such that a given String Consists only of a Pair of Alternating Characters
Minimum removals required such that a given string consists only of a pair of alternating characters is a common problem in computer science and is encountered frequently in applications involving string manipulation. In this tutorial, we will solve this problem using the C++ programming language. We will begin by explaining the problem statement in detail and discussing its importance in various real-world applications. Then, we will provide a step-by-step algorithm to solve this problem and demonstrate its implementation in C++. Finally, we will conclude with some insights into the time and space complexity of our solution ...
Read MoreMinimum Number of Replacements done of the Substring “01” with “110” to Remove it Completely
The minimum number of replacements done of the substring “01” with “110” to remove it completely is a common problem in string manipulation and optimization. In this tutorial, we delve into this problem and present an efficient solution using C++. The problem entails finding the minimum number of replacements required to transform a binary string by replacing all occurrences of the substring "01" with "110" while ensuring that the resulting string does not contain the substring "10". We provide a detailed explanation of the problem statement, present an algorithmic approach to solve it, and offer a ...
Read MoreMinimum distance between Duplicates in a String
Finding the minimum distance between duplicates in a string is a frequently encountered problem in computer science. It involves finding the smallest distance between any two identical characters in a given string. For example, in the string "minimum distance, " the minimum distance between the two 'i's is two, as they occur at positions 1 and 3, respectively. This problem can be solved using different programming languages, including C++. In this tutorial, we will learn a C++ algorithm with implementation to efficiently solve this problem. So let's get into this and learn something new and exciting! Problem ...
Read MoreThe Maximum Score Possible by Removing Substrings made up of Single Distinct Character
The maximum score possible by removing substrings made up of a single distinct character is a well-known problem in the field of computer science and algorithm design. The problem statement involves finding the optimal solution to remove all the contiguous substrings from a binary string that contains only one type of character and score points for every removed substring of length K, where K can vary for each substring. This problem has various real-life applications, including text analysis and compression. In this tutorial, we will provide a solution to this problem using C++, and explain the logic behind ...
Read MoreLexicographically Kth-smallest string having ‘a’ X times and ‘b’ Y times
Lexicographically Kth-smallest string having ‘a’ X times and ‘b’ Y times is a problem where we need to find the Kth smallest string that contains X number of ‘a’s and Y number of ‘b’s. The strings are arranged lexicographically which means that the smallest string comes first when we sort all the possible strings. In this tutorial, we will discuss how to solve this problem using C++. We will start by understanding the problem statement in detail, followed by the algorithmic approach. We will then move on to implementing the solution in C++ using dynamic programming. The code ...
Read MoreCount ways to Split a String into two Subsets that are Reverse of Each Other
In this tutorial, we delve into the problem of dividing a given string into two non-empty subsets, where the first subset is the reverse of the second subset. We aim to provide an efficient solution to count the number of ways to achieve such partitions. By leveraging the power of the C++ programming language, we present a solution that utilizes bitmasking and string manipulation techniques to iterate through all possible partitions and validate them against the given condition. We will explore the step-by-step implementation of the solution, discussing the algorithm and code structure. Additionally, we will provide a ...
Read MoreCount Possible Decoding of a given Digit Sequence with Hidden Characters
Count possible decoding of a given digit sequence with hidden characters is a fascinating problem in the realm of string decoding. In this tutorial, we delve into the challenge of decoding a sequence of digits that may contain hidden characters denoted by asterisks ('*'). The task at hand is to determine the number of ways these hidden characters can be decoded, taking into account a specific mapping of letters from A to Z to the digits 1 to 26. We present an efficient solution using the power of C++ programming language and dynamic programming techniques. By ...
Read More