
Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Found 26504 Articles for Server Side Programming

706 Views
When working with strings that contain a combination of numbers and alphabets, it can be beneficial to insert a space between the numbers and alphabets. Adding this space can improve the readability and formatting of the string, making it easier to interpret and work with. Further, we will explore a technique to achieve this using Python. Python provides powerful tools for string manipulation, and we will utilize the re module, which is the built-in module for working with regular expressions. Regular expressions allow us to match and manipulate strings based on specific patterns, making them ideal for solving this task. ... Read More

221 Views
Our task is to add list items to a tuple list (i.e, a list of tuples) in Python. Tuples store sequences of data enclosed in parentheses, as shown below: Tuples = (11, 22, 33) And the list of tuples is represented as follows: List of tuples = [(11, 22, 33), (44, 55, 66), (77, 88, 99)] Scenario Suppose we have a list of tuples, "a", and another list of items, "b". We have to add all items of the "b" to each item of the "a" as follows - Input Lists: a = [(2, 3), ... Read More

276 Views
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

805 Views
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

555 Views
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

221 Views
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

199 Views
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

224 Views
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

424 Views
Python Kivy is a powerful framework for building multi-touch applications, allowing developers to create interactive and intuitive user interfaces. One common requirement in many applications is the ability to detect and respond to double tap gestures on specific widgets. Setting up the Kivy Application Before diving into the implementation of double tap functionality, we need to set up a basic Kivy application. This step provides a foundation for the subsequent code implementation. We start by creating a new Python file and importing the necessary modules from the Kivy framework − from kivy.app import App from kivy.uix.boxlayout import BoxLayout from ... Read More

322 Views
Matrices are fundamental data structures in linear algebra and are extensively used in various scientific and mathematical computations. A matrix is a rectangular array of numbers arranged in rows and columns. It is commonly represented as a two-dimensional grid. However, there are scenarios where we may need to manipulate matrices with additional dimensions, either for data transformation or to perform advanced mathematical operations. Python, being a versatile programming language, offers a rich ecosystem of libraries that provide powerful tools for matrix operations. One such library is NumPy, which stands for Numerical Python. NumPy provides efficient and convenient tools for working ... Read More