All Medium Articles
Round 1 (F2F 1.5 hour) OS concepts – semaphors and fork Average of two numbers , how do you handle over flow? and generalise the… Read More
Given a string, find the smallest window length with all distinct characters of the given string. For eg. str = “aabcbcdbca”, then the result would… Read More
An n-ary tree in computer science is a collection of nodes normally represented hierarchically in the following fashion.   The tree starts at the root node.… Read More
In natural language processing (NLP), stopwords are frequently filtered out to enhance text analysis and computational efficiency. Eliminating stopwords can improve the accuracy and relevance… Read More
There are several ways by which we can create objects of a class in java as we all know a class provides the blueprint for… Read More
We have already been introduced to primality testing in the previous articles in this series.  Introduction to Primality Test and School MethodFermat Method of Primality… Read More
Prerequisite: Generating Random numbers in Javajava.security.SecureRandom class: This class provides a cryptographically strong random number generator (RNG). A cryptographically strong random number minimally complies with the… Read More
Given a linked list and a value x, partition a linked list around a value x, such that all nodes less than x come before… Read More
Whenever a user updates the database, the system must check whether any of the functional dependencies are getting violated in this process. If there is… Read More
Given two sorted arrays of size m and n respectively, you are tasked with finding the element that would be at the k’th position of… Read More
Given two integer arrays arr1[] and arr2[] sorted in ascending order and an integer k. Find k pairs with smallest sums such that one element… Read More
Wide char is similar to char data type, except that wide char take up twice the space and can take on much larger values as… Read More
The aim of this project is to develop an application which can detect pedestrians effectively. The problem of motion-based object detection can be divided into… Read More
Prerequisite : HashMap and TreeMap in Java  TreeMap, HashMap and LinkedHashMap: What’s Similar?  All offer a key->value map and a way to iterate through the… Read More
Generate all prime numbers between two given numbers. The task is to print prime numbers in that range. The Sieve of Eratosthenes is one of… Read More
Given an array of numbers where each element represents the max number of jumps that can be made forward from that element. For each array… Read More
We have an integer array that is sorted in ascending order. We also have 3 integers A, B and C. We need to apply A*x*x… Read More
Java Based: OOPs concepts ( mostly polymorphism and difference between encapsulation and abstraction) Difference between abstract class and interface. Difference between == and .equals() functions.… Read More
Prerequisite :- Local inner classes , anonymous inner classes 1) What is the output of the following java program? public class Outer  {     public static… Read More
Tim Sort is a hybrid sorting algorithm derived from merge sort and insertion sort. It was designed to perform well on many kinds of real-world… Read More