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 1573 of 2109
How to validate Indian Passport number using Regular Expression?
An Indian passport number is special alphanumeric code that Indian government issues to owner of an Indian passport. The passport number is made up of 8–12 characters, that may include both letters and digits. The first two characters of passport number indicate type of passport, such as P for an ordinary passport, D for a diplomatic passport, and S for an official passport. The next two characters stand for the code of the organization that issues passports, and they are followed by string of numbers that serve as passport holder's special identification. Indian passport numbers are normally printed on the ...
Read MoreCount of distinct possible strings after performing given operations
Determining the number of unique strings that can be obtained by performing a set of given operations on a string is a common challenge in computer science and mathematics. Several operations, including character deletion, swapping, or string reversal, can be carried out on the string. The objective is to calculate the total count of different output strings achievable through these operations irrespective of their order. The problem-solving techniques applied for this task comprise dynamic programming, recursion, and combinatorics among others—depending upon the nature of specific operations undertaken. Methods To count the distinct possible strings after performing given operations, one ...
Read MoreCheck if there exists a permutation of given string which does not contain any monotonous substring
A monotonous substring is a contiguous substring of given string containing characters whose values are all strictly increasing or strictly decreasing. A monotonous substring is a string sequence that either strictly increases or strictly decreases in value. Method Dynamic Programming Backtracking Method 1: Dynamic Programming One technique is to apply dynamic programming to construct table of sub problems, here each item (i, j) in table denotes whether there exists a permutation of the substring S[i...j] that does not contain any monotonous substring. When i=j, the substring comprises only one character and is hence trivially monotonous. ...
Read MoreSplit a binary string into K subsets minimizing sum of products of occurrences of 0 and 1
A binary string is made up of a succession of binary numbers, also known as bits, that are either 0 or 1. It is a method of encoding data that uses only two numbers for computer applications where data is stored and processed using electronic circuits that can only recognise two states. In computer programming, binary strings are frequently used to represent data in way that is simple for electronic circuits to handle, such as numbers, text, and images. Method Method 1. Dynamic Programming Method 2. Greedy Approach Method 1: Dynamic Programming To tackle this difficulty, we can employ ...
Read MoreCheck if a given string can be formed using characters of adjacent cells of a matrix
Let's first understand the meaning of neighbour cells in matrices. To determine how each component fits into your two-dimensional matrix structure visualize each enclosed unit as being encompassed by almost eight adjacent elements positioned across/from them both diagonal directions in addition to vertical/horizontal ones. An example observation can be made about lattice size - the smallest circular enclosure in this design has nine components.(from left-to-right & up-to-down)Cell [row=9, col=8] -- within reach from [row=8, col=7], ...[row=10, col=8], and so forth. This intricate connection network links these adjacent components where they share edges or corners; creating a well-defined matrix structure stepping ...
Read MoreMinimum addition/removal of characters to be done to make frequency of each character prime
Optimising character frequency for primality is a challenging task in computer science that entails identifying the smallest number of character additions or removals required to make the frequency of each character in each string a prime integer. Cryptography, data reduction, and natural language processing are just a few of the applications for this issue. The frequency of characters in a string can be optimised for primality in this tutorial using a C++ method. We will start by involving further into the problem description and then propose an efficient solution. Method Dynamic programming Approach minOperations function Method Method ...
Read MoreMinimum flips required to generate continuous substrings of 0’s and 1’s
Continuous character sequences known as substrings of 0s and 1s can be created by selecting zero or more characters from the original string in any order without skipping any of them. Take for instance the string "0101." The sub strings that are followed up this text are: 0, " "1, " "01, " "10, " "010, " "101, " and "0101." The unfilled string is likewise a substring of all strings since it very well might be made by picking precisely 0 characters from the beginning string. As a result, in this instance "" is also a substring of "0101". ...
Read MoreUsing learning curves in Machine Learning Explained
Introduction Machine learning, at its core, involves teaching computers to learn patterns and make decisions without explicit programming. It has revolutionized several industries by powering intelligent systems capable of solving complex problems. One crucial aspect of machine learning that often goes unnoticed is the concept of learning curves. These curves reflect a fundamental journey where models refine their predictive abilities over time. In this article, we will explore the intriguing world of learning curves in machine learning with creative examples and detailed explanations. Learning Curves in Machine Learning Learning curves are graphical representations visualizing changes in model performance as ...
Read MoreLicense Plate Recognition with OpenCV and Tesseract OCR
Introduction License Plate Recognition (LPR) frameworks have become progressively well known in different applications, counting traffic administration, parking frameworks, and law requirement. These frameworks depend on computer vision procedures to distinguish and extricate license plate information from images or video streams. In this article, we'll investigate how to actualize an essential License Plate Recognition system utilizing OpenCV, a capable computer vision library, and Tesseract OCR, a renowned optical character recognition engine. We'll dig into the vital steps, counting picture preprocessing, character segmentation, and content recognition, to realize accurate permit plate recognition. Understanding the Components of License Plate Recognition Before ...
Read MoreHow to keep track of Keras Models with CodeMonitor?
Introduction In today's fast−paced world, machine learning models developed using frameworks like Keras have transformed various industries. However, keeping track of these models and their iterations can become a challenging task for data scientists and developers alike. CodeMonitor is an innovative tool that simplifies model versioning, monitoring, and collaboration for seamless experimentation and development workflows. In this article, we will dive into how CodeMonitor effortlessly enhances the management of Keras models through a practical example. Keras Models with CodeMonitor Version Control: With each training session or modification performed on the model saved as a separate commit or pull request ...
Read More