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
Articles by Sakshi Koshta
24 articles
How 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 MoreCheck if frequency of each character is equal to its position in English Alphabet
An integral consideration when examining character frequencies and their place within the English alphabet is determining whether each character's frequency within a string aligns with its corresponding location within the alphabet. Each letter of this 26-letter system holds an assigned position ranging from one through twenty-six. Consequently, we must explore how one can recognize if a character's count in each string correlates with its alphabetical place. The following topic will delve into this issue while exploring whether identifying these frequencies can facilitate validating and investigating connections between character frequency and placement within our beloved language's alphabetical order. Methods Here are ...
Read MoreHow to validate CVV number using Regular Expression?
A three- or four-digit number is called the Card Verification Value, or CVV, that is found on the back of most of the credit cards and debit cards as well as on the front of American Express cards. It is also known as CVV2 and CSC (Card Security Code). The CVV code is a security mechanism to ensure that the person making the purchase has a valid card. It was developed to aid in preventing unauthorised transactions. It is typically required when making online purchases over the phone or without a card on hand. Method The following methods are used ...
Read MoreCheck if left and right shift of any string results into given string
A collection of characters is represented by a string data type. It is arranged logically using letters, numbers, symbols, and empty spaces. The majority of computer languages enclose strings in single or double quotation marks to distinguish them from other data types. Programmers frequently employ strings to carry out some input and output operations, the storing, and the manipulation of textual data, and more. Concatenation (combining two or more strings), substring extraction (obtaining a segment of a string) and searching for certain characters or patterns inside a string are some frequent operations that can be carried out on strings. Methods ...
Read MoreLength of the smallest substring which contains all vowels
One common issue encountered during string manipulation assignments involves identifying the shortest substring containing every vowel atleast once. This task finds its application amongst varied domains such as data analytics, bioinformatics and natural language processing among others.The goal here is finding out which minimum contiguous section within an existing string has each of these five letters (a, e, i, o, u) atleast once.The selection process for resolving this challenge encompasses multitude techniques like implementing sliding window algorithms or incorporating hashing procedures or utilizing regular expressions etcetera.Finding a robust resolution for this problem typically becomes crucial since numerous real-world scenarios demand ...
Read MoreHow to validate MasterCard number using Regular Expression?
Mastercard is a multinational financial services company that has provided payment processing services to clients globally since its establishment in 1966. Its headquarters remain based in New York, USA. It marked as one of the biggest payment systems in the world, with rivals Visa and American Express. They stand out and are well fitted for both of the consumer and business need due to the large range of goods they provide, which may involve credit cards, debit cards, and prepaid cards. Among them are prepaid cards, debit cards, and credit cards. To distribute these card options globally, it works ...
Read MoreBinary string with given frequencies of sums of consecutive pairs of characters
A binary string is a series of 0s and 1s in computer science and mathematics. The sum of two adjacent characters is indicated by sums of subsequent pairs of characters. For example to understand the below topic, the total number or digits of the succeeding pairs in the string "11010" is 1+1=2, 1+0=1, and 0+1=1. The goal is to locate a binary string that satisfies the specified frequencies using the frequencies of these sums as a guide. Applications of this issue can be found in fields like information theory and coding theory. Methods To find a binary string with given ...
Read MoreCheck if a number ends with another number or not
A typical programming challenge is determining whether a number terminates with another number. To solve this problem, you must identify the last few digits of a given number and check to see if they match another number. Numerous applications, including data processing, string manipulation, and numerical analysis, frequently include this kind of operation. Programming approaches including converting numbers to strings, modular arithmetic, and the use of logical operators are used to solve this challenge. Beginner and intermediate programmers who want to get better at manipulating numbers and solving algorithmic issues should be interested in this topic. Methods There are various ...
Read More