How to Check Given Number is Armstrong or not
In this article, We shall learn what a Java Armstrong Number is. The method for determining if a number is Armstrong or not will be shown, along with its code....
Expression Evaluation
Problem Statement You will be given a string representing a mathematical expression. You have to evaluate it and return the result. Some Constraints The input string will be in Infix...
Prim’s algorithm using priority_queue in STL
Embarking on the journey of understanding Prim's algorithm and its implementation using the priority_queue in the C++ Standard Template Library (STL) opens a gateway to the realm of efficient minimum...
Conversion Infix notation to Prefix notation
The conversion from infix notation to prefix notation involves reversing the order of the expression, replacing each operator with its corresponding prefix operator, and swapping the positions of each operand....
Conversion of Postfix expression to Infix expression
Problem statement Given an arithmetic expression in postfix notation , convert it into the equivalent infix notation. Sample example : Postfix Input : abc/-ad/e-* Infix output : ((a-(b/c))*((a/d)-e)) Postfix input...
Postfix to Prefix Conversion
Problem statement Given an arithmetic expression in postfix notation , convert it into the equivalent prefix notation. Sample example : Postfix input: abc/-ad/e-* Prefix output: *-a/bc-/ade Postfix input : ab*...
Conversion of Prefix to Postfix notation
We have been given an arithmetic expression, and we have to write a program that converts prefix to postfix. The expression is given in the form of a string that...
Conversion of Prefix expression to Infix expression
Conversion of prefix expression to infix expression involves rearranging the operators and operands to follow the rules of infix notation while maintaining the order of operations. This can be achieved...
Infix to Postfix Conversion using Stack
We have given an Arithmetic Expression and we have to write a program that converts the infix to postfix using stack in C. The Expression will be given in the...
The Celebrity Problem
TThe Celebrity Problem in Java is a classic algorithmic puzzle that challenges programmers to efficiently identify a special individual within a group who is known by everyone but knows no...
Maximum Product of Indexes of next greater on Left and Right
Problem Statement You are given an array A. Let us say that the array has indices from 1 to N. For each index i in the array: The quantity L(i)...
Top 10 Accenture Coding Questions for Placements
In this article, we’ll discuss Accenture Coding questions with solution 2022. Most of Accenture Coding questions mock test will be of the same pattern which are discussed below. In Accenture...
Iterative Tower of Hanoi
The Tower of Hanoi puzzle has fascinated mathematicians and puzzle enthusiasts alike for centuries with its elegant simplicity and complex nature. Originally formulated by the French mathematician Édouard Lucas in...
Access Specifiers In C++ – A Quick glimpse to private, public, and protected
In C++, access specifiers are used to control the accessibility of class members (variables and functions) from different parts of a program. They specify the level of access that other...
Top 10 Basic Python Programming Interview Questions
Python is one of the most popular and widely used programming language. It is used in web development, machine learning, desktop applications, game development, web scraping, web automation and many...
Number of NGEs to the Right
Problem Statement You will be given an array of N integers. You will also be given an Integer Q denoting the number of queries. Then, you will have Q queries...
How to create a mergeable stack?
Let’s assume there are 2 stacks. Stack A and Stack B. Now we are going to push elements in both the stacks. After Merge Operation we will push all elements...
How to efficiently implement K Stacks in a single Array?
Our task is to Implement K stacks that should use only one array. The K stacks must support these functions push(int x, int sn): pushes element x to stack number...
Design a Stack with operations on Middle element
Brief about Stack Data structure: A stack is a linear data structure that follows the principle of Last In First Out (LIFO). This means the last element inserted inside the...
Accenture Aptitude Questions For Placement
Securing a position at Accenture, one of the leading global professional services companies, is a significant milestone for any aspiring professional. A crucial step in the Accenture recruitment process is...
Accenture Placement – Top 20 Aptitude Questions 2022
Accenture most repeated questions or we can say similar questions with solutions are given in this article. Accenture Aptitude questions 2022 will give you an idea of expected questions in...
Accenture Aptitude Preparation for Freshers On-Campus
In this article, we have provided Accenture Aptitude Questions and Answers For Freshers (2022 and 2023 Batches). Applicants can gain more knowledge by practicing all the Accenture Questions and Answers...
Time complexity of building a heap
Heapify is a common operation performed on binary heaps, which are data structures that are used to implement priority queues. It involves rearranging the elements in a heap to maintain...
Print Next Greater number of Q queries
Problem statement You are given an integer array of size n and q queries. Your task is to find the next greater element for each query. Each query consists of...
C++ Programs to Convert Binary to Decimal Number
The binary is a base-2 numbering system that uses only two digits, 0 and 1, to represent numbers. Decimal is a base-10 numbering system that uses ten digits, 0 through...
Heap sort in Java
What is heap? Heap is a special kind of complete binary tree in which the all node has a value greater (or smaller ) than all of its children ....
Min Heap in Java
What is Heap? Heap is a special kind of complete binary tree in which the all node has a value greater (or smaller ) than all of its children ....
Heap overflow and Stack overflow
The computer’s RAM has a few sections in it. Two of them are heap and stack. Both heap and stack store variables. Let's see about Heap and Stack briefly:- Both...
Next Greater Frequency Element
Problem statement Given an array, consisting of n elements, find the next greater frequency element of each element. The next greater frequency element of any element is the first element...
Evaluation of Postfix Expression
Evaluating postfix expressions, also known as Reverse Polish Notation (RPN), is a fundamental concept in computer science and mathematics. Unlike the more familiar infix notation, where operators are placed between...