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
Server Side Programming Articles - Page 1898 of 2650
760 Views
Census data is the source of information collected by the government to understand the population and its characteristics. It consists of details such as age, gender, education, and housing. This helps the government in understanding the current scenario as well as planning for the future. In this article, we are going to learn how to analyze the census data in Python. Python, with its libraries like pandas, numpy, and matplotlib, is widely used for analyzing census data. Analyzing Census Data Here, we are going to use the sample data that consists of the census data stored in ... Read More
2K+ Views
In this problem, we are given a prefix expression. Our task is to print the infix conversion of the given expression.Prefix expression is those expressions which have operators before the operands.Example: +AB.Infix expressions are those expressions which have operators between the operands.Example: A+BInfix expression are information for human understanding, but the computer does computations on prefix or postfix expressions (generally postfix).Let’s take an example to understand the problemInput: prefix : /+LM/NX Output: infix : (L+M) / (N/X)To solve this problem, we will be using the stack data structure. We will traverse the prefix expression in reverse order of the expression. ... Read More
4K+ Views
In this problem, we are given a prefix expression. Our task is to print the postfix conversion of the given expression.Prefix expression is those expressions which have operators before the operands.Example: +AB.Postfix expressions are those expressions which have operators after operands in the expressions.Example: AB/The conversion of prefix to postfix should not involve the conversion to infix.Let’s take an example to understand the problem, Input: /+XY+NM Output: XY+NM+/ Explanation: infix -> (X+Y)/(N+M)To solve this problem, we will first traverse the whole postfix expression in an reverse order. And we will be using the stack data structure for our processing. And do ... Read More
172 Views
In this problem, we are given string str containing only a and b and an integer N such that a string is created by appending str n times. Our task is to print the total number of substring in which the count of a’s is more than the count of b.Let’s take an example to understand the problemInput: aab 2 Output: 9 Explanation: created string is aabaab. Substrings with count(a) > count(b) : ‘a’ , ‘aa’, ‘aab’, ‘aaba’, ‘aabaa’, ‘aabaab’, ‘aba’, ‘baa’, ‘abaa’.To solve this problem, we will have to check if the string contains the required prefix subsets. Here, ... Read More
2K+ Views
In this problem, we are given the inorder and postorder traversal of a binary tree. Our task is to print the postorder traversal of the tree.Let’s take an example to understand the problemInput:inorder: 16 7 21 12 1 5 9 postorder: 16 21 7 1 9 5 12 Output: preorder: 12 7 16 21 5 1 9 Explanation: the binary tree is :To solve this problem, a simple solution could be creating a tree using the given traversals and then finding the preorder traversal of the tree. But this method will be more complex for the system.A more effective solution ... Read More
455 Views
In this problem, we are given a binary tree and a node value. Our task is to print the preorder predecessor of the node.Binary Tree is a special type of tree in which each root node can have maximum 2 child nodes.Preorder Traversal is a way to traverse nodes of the tree. In this we will first traverse root node then left child and then the right child.Preorder predecessor node is the node that comes before the node in the preorder traversal of the node.Let’s take an example to understand the problemInput: 1 Output: 9To solve this problem, a navie approach will ... Read More
668 Views
In this problem, we are given a binary tree and a node value. Our task is to print the preorder successor of the node.Binary Tree is a special type of tree in which each root node can have maximum 2 child nodes.Preorder Traversal is a way to traverse nodes of the tree. In this we will first traverse root node then left child and then the right child.Preorder successor node is the node that comes next to the node in the preorder traversal of the node.Let’s take an example to understand the problemInput: 9 Output 0 Explanation: the preorder traversal ... Read More
257 Views
In this problem, we are given an N-ary Tree. Our task is to print the preorder traversal of the tree.First, let’s learn some basic terminologies, N-ary Tree is a tree in which all nodes can have at max N child nodes. Example 2-ary (binary) tree has max 2 child nodes.Preorder Traversal is a way to traverse nodes of the tree. In this we will first traverse root node then left child and then the right child.Let’s take an example to understand our problemPreorder traversal : 12151499411719To solve this problem, we have to use the stack data structure. We will first ... Read More
1K+ Views
In this problem, we are given an array. Our task is to return the greatest element that precedes the current element in the array otherwise print -1.Let’s take an example to understand the problemInput: {6, 2, 7, 1, 5, 3} Output: -1, 6, -1, 7, 7, 7To solve this problem, an easy and obvious solution will be using nested loops that will check greater element in the preceding part of the array.Program to show the implementation of our solutionExample Live Demo#include using namespace std; void preceddingGreatestElement(int arr[], int n){ cout = 0; j--) { if (arr[i]
374 Views
In this problem, we are given an integer n. Our task is to check weather the preceding number is equal to 1’s complement of the number.Let’s take a few examples to understand our problemInput: 12 Output: No Explanation: (12)10 = (1100)2 Preceding number 11 = (1011)2 1’s complement of 12 = (0011)2 Input: 4 Output: Yes Explanation: 4 = (100)2 Preceding number 3 = (011)2 1’s complement of 12 = (011)2To solve this problem, we can use a simple approach which is by comparing the previous number and the 1’s complement of the number.This approach is simple but consumes space ... Read More