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
Server Side Programming Articles
Page 1570 of 2109
Check if the End of the Array can be Reached from a given Position
In this problem, we will check whether we can reach the array’s end by moving back or ahead by nums[p] moves from the current position. The naïve approach to solve the problem is to check all possibilities to move into the array and see if we can reach the array’s end. Another approach is using the queue and BFS traversal in the array. In this tutorial, we will learn both approaches to check whether we can reach to the end of the array. Problem statement − We have given a nums[] array containing the positive integers. Also, we have given ...
Read MoreHow to validate IFSC Code using Regular Expression?
Indian Financial System Code is the abbreviation. Indian bank branches that take part in the electronic fund transfer system are identified by a special 11-character code. The Reserve Bank of India uses this code to transfer money between banks during internet transactions. There are two sections to the IFSC code. The bank is identified by the first four characters, whereas the branch is identified by the final six characters. NEFT (National Electronic Funds Transfer), RTGS (Real Time Gross Settlement), and IMPS (Immediate Payment Service) are just a few of the electronic transactions that require IFSC codes. Method Some general methods ...
Read MorePrint all the non-repeating words from the two given sentences
In this tutorial, we will identify and print all non-repeating words from two given sentences. Non-repeating words refer to words that appear only once in both sentences, means they do not repeat in other sentence. The task involves analysis of the input sentences, identification of the individual words, and comparing them across both sentences to find which ones appear only once. The output should be a list of all such words. This task can be accomplished through various programming approaches, such as using loops, arrays, or dictionaries. Methods Here are the two methods to print all the non-repeating words from ...
Read MorePermutation of a string with maximum number of characters greater than its adjacent characters
It is crucial to manipulate strings in various problem-solving scenarios. Discovering a permutation of the given string that optimizes the count of characters larger than their contiguous counterparts presents an enjoyable puzzle, requiring rearranging the string's characters to generate as many pairs as possible of adjacent characters where the left character is lesser than the right. Methods There are several methods to solve permutations of a string where maximum number of characters is more than characters immediately adjacent to them. Method 1 − Backtracking with Pruning − Method 2 − Dynamic Programming− Method 3 − Heap's Algorithm− Method 4 ...
Read MoreDifference between Linux and Solaris
Two popular operating systems in the IT sector are Linux and Solaris. Even while they are similar in certain ways, they are also very different from one another. In this tutorial, we'll examine how Linux and Solaris differ from one another in terms of their respective histories, architectural designs, command−line user interfaces, package−management systems, file systems, and security features. We will compare their applicability for various use scenarios as well as examine their advantages and disadvantages. What is Linux? Linus Torvalds created the Linux operating system in 1991, which is free and open−source. It is heavily used in servers, personal ...
Read MoreDifference between Job, Task and Process
Job, task, and process are three terms that are used to refer to the work being done in different types of operating systems. In this article, we will have a detailed study of these three terms and how they are different from each other. What is a Process? A program being run is known as a process. A process is referred to as a set of instructions. The process is an active entity, whereas the program is a passive one. When we run a program, it stays on our system's hard drive, and once it enters the main memory, it ...
Read MoreRepeated Character Whose First Appearance is Leftmost
Introduction In this tutorial, we will develop an approach to finding repeated characters in a string whose first appearance is leftmost. This means the character first appeared at the beginning of the string. To find out whether the first character repeats or not, we traverse the whole string and match each character to the first character of the string. To resolve the task we use the find(), length(), and end() functions of the C++ programming language. Example 1 String = “Tutorialspoint” Output = The repeating character is “t” In the above example, the leftmost character of the input ...
Read MoreQueries to check if string B exists as a substring in string A
Introduction In this tutorial, we will see queries to check if string B exists as a substring of string A. A substring is a string that is part of the main string. In the Query array, there are some integer values, and the index of string A will be checked to see if those integer values match the substring B or not.We use C++ queries to find out whether B is a substring of A or not.In this approach, there is a string A and B is the substring of A. Queries in C++ are integer values represented in array ...
Read MoreFind the sum of the ascii values of characters which are present at prime positions
Introduction In this tutorial, we will learn the concept of c++ to find the sum of ASCII values of the characters present in the prime position. Prime position means characters whose position is 2, 3, 5, or any other prime number. ASCII (American Standard Code for Information Interchange) values are unique numerical values for alphabets, letters, punctuation marks, and other characters used in coding. It is used for communication with computers as the computer does not understand human language. There are 128 ASCII values starting from 0 to 127. Capital and small alphabets have separate ASCII values. We will develop ...
Read MoreFind max length odd parity substring
Introduction In this tutorial, we develop an approach to finding the maximum length odd parity substring. Odd parity in a substring means the number of times 1 repeats in a string is odd. Parity in C++ defines the bit set number and is 1s in a number. There are two types of parity: even and odd. When the total number of “1” in a binary representation is odd it is known as an odd parity string. In this tutorial, we find the maximum length odd parity substring using C++ programming concepts. Implementation 1 String = 101100 Output = 6 ...
Read More