Posts

Showing posts with the label HackerEarth Practice

Array Insert

-
Gary likes to solve problems of array, but he doesn't like problems that involve queries. His school teacher gave him an assignment full of problems but one of them involve queries. Can you help Gary in solving that problem so that he can go and play with his friends? The problem is : Given an Array A consisting of N positive integers, you have to answer Q queries on it. Queries can be of the two types: * 1 X Y - Update X at location Y in the array. * 2 L R - Print the sum of range [L, R], i.e. Both L and R are inclusive. Note :- Array indexing is from 0. Input : The first line contains two space separated integers N ( Length of Array ) and Q ( Queries ). Next Line contains N space separated integers denoting array A . Next Q Line contains 3 space separated integers for each line , as described above Output : Answer to the each query of type 2 in a new line, only when range is valid, otherwise ouput `-1` Constraints:   1 <= N <= 10^9 1 <= Q ...
Post a Comment
Read more

Fitting circles

-
You are given a rectangle of length   a   and width   b . You are required to determine a circle that contains the maximum circumference that fits inside the rectangle. This type of circle is called a big circle. Your task is to determine the maximum number of big circles that can fit inside the rectangle.  Input format First line: An integer   t  denoting the number of test cases First line of each test case: Integers   a   and   b Output format For each test case, print the answer on a new line denoting the maximum number of big circles that can fit in the provided rectangle.   Constraints 1 ≤ t ≤ 1000 1 ≤ a , b ≤ 10 9 SAMPLE INPUT   1 40 10 SAMPLE OUTPUT   4 Explanation 4 circles of radius 10 can fit inside the rectangle.
Post a Comment
Read more

Anti-palindrome strings

-
You are given a string  S  containing only lowercase alphabets. You can swap two adjacent characters any number of times (including 0). A string is called anti-palindrome if it is not a palindrome. If it is possible to make a string anti-palindrome, then find the lexicographically smallest anti-palindrome.   Otherwise, print -1 − 1 Input format The first line contains a single integer  T  denoting the number of test cases. The description of  T  test cases follows. Each line contains a string  S   of lower case alphabets only. Output format For each test case, print the answer in a new line. Constraints 1 ≤ T ≤ 100 2 ≤ | S | ≤ 2 × 10 5 S  contains only lowercase alphabets. SAMPLE INPUT 4 bpc pp deep zyx SAMPLE OUTPUT bcp -1 deep xyz Explanation In the first test case, you can create "bcp" which is not a palindrome and it is a lexicographically-small...
Post a Comment
Read more

Supernatural

-
You are given a number   n . A supernatural number is a number whose product of digits is equal to   n , and in this number there is no digit 1. Count the number of supernatural numbers for a given   n . Input Contains a single integer   n ,   1 <= n <= 100 . Output Print the number of supernatural numbers. SAMPLE INPUT 4 SAMPLE OUTPUT 2 Explanation There are only two natural numbers, the product of the digits of which is 4 - 4, 22.
Post a Comment
Read more

Finding vaccines

-
 You are creating a vaccine to fight against a worldwide novel pandemic virus. A vaccine contains a weakened virus that is injected inside people to produce antibodies to let it fight against the virus. The study of interaction among RNA of various viruses is quite necessary for this. An RNA consists of four types of molecules Guanine ( G ), Adenine ( A ), Cytosine ( C ), and Uracil ( U ). You are given the structures of RNA for the pandemic virus and several vaccine viruses in the form of strings containing characters   G ,   A ,   C , and   U   representing respective molecules. You know that if there is higher interaction between the pandemic virus and vaccine virus, then better the vaccine will be. You also know that the only interaction between any two RNAs is a result of the interaction between their Guanine ( G ) and Cytosine ( C ) molecules. Formally, if the strings for RNA structures are...
Post a Comment
Read more

Popular posts from this blog

MySQL Multi Source Master Slave Replication using GTID

-
Image
We are using GTID-based master-slave replication. In this replication, both master and slave should have the same GTID. This blog post aims to provide a step-by-step guide to help you set up MySQL Replication using GTIDs and help you replicate your MySQL data with ease. Prerequisite Master Source 1 Channel name:  DEVELOPMENT Database: mydb1 Enable Replication For Tables testing1 testing2 testing3 Mysql Server Running: 192.168.0.201:3307 Master Source 2 Channel name:  PRODUCTION Database: mydb1 Enable Replication For Tables testing4 testing5 testing6 Mysql Server Running: 192.168.0.201:3308 Slave Mysql Server Running: 192.168.0.209:3306 Configuration of  masters(192.168.0.201:3307/192.168.0.201:3308) and slave (192.168.0.209:3306) my.cnf config for master (192.168.0.201:3307) my.cnf config for master (192.168.0.201:3308) my.cnf config for slave (192.168.0.209:3306) Steps for taking a dump and restoring it Run the following commands in both masters 192.168.0.201:3307 and 1...
Read more

Setting Up PostgreSQL Logical Replication with Docker Compose

-
Hi everyone 😀, Sorry😅 for not posting any blogs; I was stuck in other work. In the previous post, we saw that we enabled MySQL Replication using GTID . Today, we see how to allow Postgres Logical Replication in our local setup using docker-compose.  Environment Setup We have two PostgreSQL instances configured using Docker Compose: Publisher (postgres-1): The source server where changes are captured. Subscriber (postgres-2): The destination server that receives replicated data. Docker Compose Configuration Publisher (docker-compose.yml) version: '3.8' services: postgres-1: build: ./ container_name: postgres-1 environment: POSTGRES_USER: postgresadmin POSTGRES_PASSWORD: admin123 POSTGRES_DB: postgresdb PGDATA: "/data" volumes: - ./postgres-1/pgdata:/data - ./postgres-1/config:/config - ./postgres-1/archive:/mnt/server/archive ports: - "5000:5432" networks: - custom_network ...
Read more

Regex 101: An Introduction to Regular Expressions for Developers

-
Regular expressions (regex) are a powerful tool for searching and manipulating text. They allow you to describe patterns of characters that you want to match, rather than specifying every possible combination of characters. In this blog, we will go over some common regex operations and provide examples for each one. Matching a literal string: regex: hello will match the string "hello". Matching any character: regex: . will match any single character. Matching a set of characters: regex: [aeiou] will match any single vowel. Matching a range of characters: regex: [a-z] will match any single lowercase letter. Matching a negated set of characters: regex: [^aeiou] will match any single non-vowel character. Matching zero or one occurrence: regex: a? will match either the string "a" or an empty string. Matching zero or more occurrences: regex: a* will match any string that contains zero or more "a" characters. Matching one or more occurrences: regex: a+ will matc...
Read more