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
Articles on Trending Technologies
Technical articles with clear explanations and examples
Check if a string can be repeated to make another string in Python
When working with strings in Python, we sometimes need to check if one string can be repeated multiple times to form another string. This is useful in pattern matching and string manipulation tasks. Given two strings s and t, we need to find how many times string s must be concatenated to generate string t. If it's impossible to generate t using s, we return -1. Algorithm To solve this problem, we follow these steps ? Check if the length of t is divisible by the length of s If not divisible, return -1 (impossible ...
Read MoreCheck if a string can be obtained by rotating another string 2 places in Python
String rotation is a common programming problem where we check if one string can be obtained by rotating another string by a specific number of positions. In this case, we need to check if we can rotate a string exactly 2 places in either direction (left or right). Problem Understanding Given two strings s and t, we need to determine if string s can be obtained by rotating string t exactly 2 positions left or right. For example, if t = "takolka": Left rotation by 2: "takolka" → "kolkata" Right rotation by 2: "takolka" → "katakolka" ...
Read MoreCheck if a string can be converted to another string by replacing vowels and consonants in Python
Sometimes we need to check if one string can be transformed into another by replacing characters with specific rules. In this problem, we can only replace vowels with other vowels and consonants with other consonants. The transformation rules are: A vowel (a, e, i, o, u) can only be replaced with another vowel A consonant can only be replaced with another consonant Both strings must have the same length Example If we have s = "udpmva" and t = "itmmve", we can transform: u (vowel) → i (vowel) ✓ d (consonant) → t (consonant) ...
Read MoreCheck if a sorted array can be divided in pairs whose sum is k in Python
Suppose we have a sorted array of numbers and another number k. We need to check whether the given array can be divided into pairs such that the sum of every pair equals k. So, if the input is like arr = [1, 2, 3, 4, 5, 6] and k = 7, then the output will be True as we can form pairs like (1, 6), (2, 5) and (3, 4). Algorithm To solve this, we will follow these steps − Get the size of the array If the array size is odd, return False ...
Read MoreCheck if a queue can be sorted into another queue using a stack in Python
Sometimes we need to check if elements in a queue can be rearranged into sorted order using an auxiliary stack. This problem involves three data structures: an input queue, a stack for temporary storage, and an output queue for the final sorted sequence. Problem Understanding Given a queue with the first n natural numbers in unsorted order, we need to determine if we can sort them into non-decreasing sequence using these operations: Push or pop elements from stack Delete element from input queue Insert element into output queue For example, with queue [6, 1, ...
Read MoreCheck if a Queen can attack a given cell on chessboard in Python
In chess, a queen is the most powerful piece that can move horizontally, vertically, and diagonally any number of squares. Given two coordinates on a chessboard representing a queen's position and a target cell, we need to determine if the queen can attack that position. So, if the input is like Q = (1, 1) and O = (4, 4), then the output will be True as the queen can reach (4, 4) diagonally. ...
Read MoreCheck if a prime number can be expressed as sum of two Prime Numbers in Python
Given a prime number n, we need to check whether it can be expressed as the sum of two prime numbers (x + y where both x and y are prime). This is related to Goldbach's conjecture, which states that every even integer greater than 2 can be expressed as the sum of two primes. For example, if n = 19, we can express it as 19 = 17 + 2, where both 17 and 2 are prime numbers. Approach We'll use a simple approach by checking if both n and (n - 2) are prime numbers. ...
Read MoreCheck if a point lies on or inside a rectangle in Python
When working with geometric problems in Python, checking if a point lies inside a rectangle is a fundamental task. Given a rectangle defined by its bottom-left and top-right corner points, we can determine if any point (x, y) falls within its boundaries. Problem Statement Given a rectangle represented by two points: bottom-left corner (x1, y1) and top-right corner (x2, y2), we need to check whether a given point (x, y) lies inside or on the rectangle. For example, if bottom_left = (1, 1), top_right = (8, 5), and point = (5, 4), the output should be True ...
Read MoreRunning Selenium Webdriver with a proxy in Python.
We can run a proxy with Selenium webdriver in Python. A proxy is an essential component to do localization testing. We can take an e-commerce application and check if the language and currency visible is as per the user location. With the help of proxy within tests, we can verify if the website user interface matches with the location. We have to set a proxy with below steps − Import webdriver from Selenium package. Define proxy server address. Create an object of ChromeOptions class Communication of proxy with ChromeOptions. Summing options to Chrome() object. Basic ...
Read MoreProgram to Find Out the Smallest Substring Containing a Specific String in Python
Finding the smallest substring that contains a specific string as a subsequence is a challenging problem. Given two strings s and t, we need to find the shortest substring in s where t appears as a subsequence. If multiple substrings exist with the same minimum length, we return the leftmost one. For example, if s = "abcbfbghfb" and t = "fg", the output will be "fbg" because it's the smallest substring containing "f" and "g" in sequence. Algorithm Overview We use dynamic programming to solve this problem efficiently ? Create a DP array where dp[i] ...
Read More