All Hard Articles
What is the other name of Dijkstra algorithm? (A) single-source shortest path problem (B) multiple-source shortest path problem (C) multiple-destination shortest path problem (D) single-destination… Read More
Extensible Markup Language(XML), is a markup language that you can use to create your own tags. It was created by the World Wide Web Consortium… Read More
Among all the Operating systems, Window’s Operating System stands the most user-friendly GUI (Graphical User Interface) based OS because of its highly interactive mode with… Read More
“If you want your code to run faster, you should probably just use PyPy.” — Guido van Rossum (creator of Python)   If you have ever coded in… Read More
Python 3.9 is still in development and scheduled to be released in October this year. On Feb 26, alpha 4 versions have been released by… Read More
Sometimes, while working with dictionary, we can have a problem in which we need to reverse the order of dictionary. This is quite a common… Read More
Validation in node.js can be easily done by using the express-validator module. This module is popular for data validation. There are other modules available in… Read More
Secret Sharing schemes are used in the distribution of a secret value among multiple participants (shareholders) by dividing the secret into fragments (shares). This is… Read More
Sometimes, while working with Python dictionaries, we can have a problem in which we need to perform concatenation of all the key values list that… Read More
Given a Binary Tree, the task is to print all Root to Leaf path of this tree in Boundary Root to Leaf path traversal.  Boundary… Read More
Given a partially filled 9×9 matrix, digits (from 1 to 9) must be assigned to the empty cells so that every row, column, and submatrix… Read More
Given an array A containing N integers. Find the maximum sum possible such that exact floor(N/2) elements are selected and no two selected elements are… Read More
Given an array A of size N, find the minimum value of the expression : over all pairs (i, j) (where i != j). Here , and represent bitwise… Read More
Given preorder traversal of a binary search tree, construct the BST.For example, if the given traversal is {10, 5, 1, 7, 40, 50}, then the… Read More
I interviewed for Amazon SDE2 position in Bangalore, India on March 2020. I had 3 years of Experience at the time of Interview Round 1:… Read More
Concurrent processing is a computing model in which multiple processors execute instructions simultaneously for better performance. Concurrent means, which occurs when something else happens. The… Read More
Introduction: Payment gateways help the user to make their payments. There are many payment gateways available in the market like Razorpay, Google pay, etc but… Read More
I got referred by a college senior. The process took 2 weeks in total. 1 telephonic round, asking about my experience as some basic DS… Read More
This was a campus recruitment so the level and difficulty might vary according to your college Round 1: Coding round on Hackerearth Some 20 MCQ… Read More