Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Overview HTML (Hyper Text Markup Language) is markup language which helps in creating the skeleton of the website and CSS (Cascading Style Sheet) is a styling language which makes the skeleton of the website more attractive by arranging in a proper order by putting the different style to the page. As in a human being the bony skeleton plays the role of the HTML and the properties of the human being such as color, height, size and many other properties plays the role of CSS. So when a user requests a page from the server, the server sends the response ... Read More
Do you know what improvement in skill means? Improvement means when you understand where you are lacking behind with the latest trends. Improvement means you are filling and overcoming your bugs in the code. As HTML is a simple markup language, in HTML we only need to understand the tags and elements. To improve your skills in HTML, you should at least practice a code daily. This habit will make your code bug free and will also help you to create a new, creative and a faster way to build an application. Quality of a good developer A good developer ... Read More
XOR, or exclusive OR, is a boolean logic operation which is used in generating parity bits for error checking, fault tolerance, etc. Various symbols are used to represent this operation: ^, ⊕, ⊻, etc. XOR Logic The XOR operation is only true if the two arguments are different. This means that the XOR of the same bits is 0, and that of different bits is 1. Same bits − 0 ^ 0 = 0 1 ^ 1 = 0 Different bits − 0 ^ 1 = 1 1 ^ 0 = 1 Problem Statement Given two numbers, a and b, ... Read More
When the minute hand moves from 12 to 12 in one hour, the hour hand also moves from the previous hour to the next. Hence, every hour, the minute hand and the hour hand coincide once. Problem Statement Given an input hour, find the time in minutes when the hour hand and the minute hand coincide within the next hour. Examples Input − Hour = 4 Output − Coinciding time: 240/11 minutes. We will discuss the explanation further with the approach. Input − Hour = 5 Output − Coinciding time: 300/11 minutes. Explanation and the Approach ... Read More
5, 55, 555, ... is a series that can be derived from geometric progression and, thus, computed with the help of GP formulae. Geometric progression is a type of series in which each succeeding term is the product of some specific term (ratio) with the preceding term. We will utilize the knowledge of GP, to find the sum of the given series. Problem Statement Given a number n, find the sum of the series 5+5+555+... up to n terms. Examples Input − N = 3 Output − 595 Explanation 5 + 5 + 555 = 595. ... Read More
There can be multiple combinations of numbers if taken 1 to n at a time. For example, if we take one number at a time, the number of combinations will be nC1. If we take two numbers at a time, the number of combinations will be nC2. Hence, the total number of combinations will be nC1 + nC2 +… + nCn. To find the sum of all combinations, we will have to use an efficient approach. Otherwise, the time and space complexities will go very high. Problem Statement Find the sum of products of all the combinations of numbers taken ... Read More
Sorting a vector using STL is a piece of cake. We can use the famous sort() function to perform the task. The real challenge is to count the number of factors for each number. A factor is a number which divides another number completely, i.e. with zero remainder. Traversing through all the numbers to count the factors might be an approach but we will try to optimize and reach efficient solutions in this article. Problem Statement Sort a given array based on the number of factors of each number in increasing order. Thus, the number having the lowest number of ... Read More
A number is p-friable for p-smooth if all of its prime factors are less than or equal to p. For example, 1620 is a 5-smooth number. Because, the prime factors of 1620 are: 2, 3, and 5. As it can be seen, 1620 is also a 7-smooth and 11-smooth number. Problem Statement Given two numbers N and P, we have to check if N is a P-friable number or not. Examples Input − N = 50, P = 7 Output − Yes, 50 is a 7-friable number. Explanation 50 can be prime factorized as: 5*5*5*5. Hence, ... Read More
Sometimes working with Python string, we may come across a real-world scenario where it can be useful for text parsing, pattern matching, and extracting specific information from text data. In Python, we have some built-in functions such as type(), index(), append(), and, isinstance() will be used to find the index containing String in List. Let’s take an example of this: The given input string, my_list = [108, 'Safari', 'Skybags', 20, 60, 'Aristocrat', 78, 'Raj'] Output 1, 2, 5, 7 Explanation The variable name my_list stores the input list that contains the mixing of integer and string in ... Read More
In this article, we will discuss different approaches to calculate the number of positive integers which have no repeated digits between a given range Low to high. The first approach is a brute force approach which iterates over all the numbers in the range and check if they contain repeated digits. In our second approach, we calculated the desired count using prefix array while in our last approach we used the concept of memorization in dynamic programming to get the desired result. Problem Statement: We are given two numbers low and high and we have to find the count of ... Read More