All Hard Articles

Node-RED

NODE-RED is a stream based advancement instrument for visual programming and basically its main focus on visual apparatus for wiring the Internet of Things. This… Read More

JavaScript-Misc

Web Technologies

Difference between Hard Copy and Soft Copy

1. Hard Copy : Hard copy refers to the digital document file which is printed on paper or other material like transparency. In hard copy the… Read More

Difference Between

Software Engineering

0/1 Knapsack using Least Cost Branch and Bound

Given N items with weights W[0..n-1], values V[0..n-1] and a knapsack with capacity C, select the items such that: The sum of weights taken into… Read More

knapsack

priority-queue

Algorithms

Branch and Bound

DSA

Dynamic Programming

Heap

Sorting

Primary Indexing in Databases

Indexing is a technique used to reduce access cost or I/O cost, now the question arrives what is access cost? Access cost is defined as… Read More

DBMS

GATE CS

Isomorphism in N-ary Trees

Given two N-ary trees having M nodes each. Also, given their edges and their roots respectively. The task is to check if they are isomorphic… Read More

n-ary-tree

Advanced Data Structure

Data Structures

DSA

Graph

Tree

Computational Graphs in Deep Learning

Computational graphs are a type of graph that can be used to represent mathematical expressions. This is similar to descriptive language in the case of… Read More

AI-ML-DS

Deep Learning

Minimum count of increment of K size subarrays required to form a given Array

Given an array arr[] and an integer K, the task is to find the minimum number of operations required to change an array B of… Read More

array-range-queries

subarray

Arrays

Data Structures

DSA

Dynamic Programming

Binary Space Partitioning

Binary Space Partitioning is implemented for recursively subdividing a space into two convex sets by using hyperplanes as partitions. This process of subdividing gives rise… Read More

Picked

Advanced Data Structure

Data Structures

DSA

Recursion

How to implement text Auto-complete feature using Ternary Search Tree

Given a set of strings S and a string patt the task is to autocomplete the string patt to strings from S that have patt… Read More

Trees

Trie

Advanced Data Structure

Algorithms

Binary Search Tree

C++ Programs

Competitive Programming

Computer Subject

Data Structures

Divide and Conquer

DSA

Pattern Searching

Recursion

Searching

Strings

Tree

Minimum clicks to convert string X to Y

Given a starting string X of 3 characters, finishing string Y of 3 characters and an array of forbidden strings. The task is to find… Read More

BFS

Competitive Programming

DSA

Graph

Searching

Strings

Kali Linux – Crunch Utility

In order to hack a password, we have to try a lot of passwords to get the right one. When an attacker uses thousands or… Read More

Kali-Linux

Linux-Unix

Find the missing end tag in the given HTML Code

Given a string htmlCode which is HTML code of a webpage, the task is to find the missing end tag in the HTML code.Examples: Input:… Read More

DSA

HTML

Pattern Searching

Stack

Web Technologies

Find all possible ways to Split the given string into Primes

Given string str that represents a number. The task is to find all possible ways to split the given string such that each segment is… Read More

digit-DP

number-digits

Prime Number

sieve

Bit Magic

C++ Programs

Combinatorial

DSA

Dynamic Programming

Mathematical

Strings

Fast Doubling method to find the Nth Fibonacci number

Given an integer N, the task is to find the N-th Fibonacci numbers.Examples: Input: N = 3 Output: 2 Explanation: F(1) = 1, F(2) = 1 F(3) = F(1)… Read More

Fibonacci

matrix-exponentiation

Algorithms

Articles

C++

C++ Programs

Competitive Programming

Divide and Conquer

DSA

Matrix

Hotel Management System

Given the data for Hotel management and User:Hotel Data: Hotel Name Room Available Location Rating Price per RoomH1 4 Bangalore 5 100H2 5 Bangalore 5… Read More

Algorithms

DSA

Placements

Project

Length of longest connected 1’s in a Binary Grid

Given a grid of size N*M consists of 0 and 1 only, the task is to find the length of longest connected 1s in the… Read More

BFS

binary-representation

DFS

Competitive Programming

DSA

Graph

Greedy

Matrix

Recursion

Pentanacci Numbers

The Pentanacci series is a generalization of the Fibonacci sequence where each term is the sum of the five preceding terms. The first few Pentanacci… Read More

Numbers

DSA

Dynamic Programming

Mathematical

Recursion

Microservices Architecture on AWS

Monolithic applications are built using different layers, a user interface layer, a business layer, and a persistence layer. A central idea of a microservices architecture… Read More

AWS

Amazon Web Services

Python

Longest subarray having sum K | Set 2

Given an array arr[] of size N containing integers. The task is to find the length of the longest sub-array having sum equal to the… Read More

Binary Search

prefix

prefix-sum

subarray

subarray-sum

Algorithms

Arrays

Competitive Programming

Divide and Conquer

DSA

Searching

Sorting

Check if N can be obtained from 1 by repetitively multiplying by 10 or 20

Given an integer N, the task is to determine whether it is possible to obtain the value N from 1 by repetitively multiplying by 10… Read More

DSA

Mathematical

School Programming