Given an array ‘arr’ of length ‘n’. The task is to find the largest contiguous sub-array having the count of prime numbers strictly greater than… Read More »
All Hard Articles
Given an array of n size contains the cost of sweets in such a way that that sweet[i] is the cost of i sweets. The… Read More »
There are some syntactical structures that are valid for both C and C++ but different behavior when compiled and run in the both languages. Several… Read More »
Given a doubly linked list containing N nodes, the task is to delete all the even nodes from the list. Examples: Input: Initial List =… Read More »
Given a doubly linked list containing N nodes and a number K, the task is to delete all the nodes from the list that are… Read More »
Given a singly linked list, the task is to remove all the nodes which have a greater value on left side. Examples: Input: 12->15->10->11->5->6->2->3 Output:… Read More »
Given an array A having N elements and two integers L and R where, and . You can choose any element of the array (let’s… Read More »
The reliability growth group of models measures and predicts the improvement of reliability programs through the testing process. The growth model represents the reliability or… Read More »
Let {N(t), t > 0} be a counting process and let be the time between the and the event of this process, . Definition: If… Read More »
Given a sequence of matrices, find the most efficient way to multiply these matrices together. The problem is not actually to perform the multiplications, but… Read More »
Recently LinkedIn visited our campus to hire interns for summer 2019. The process consisted of an online coding round followed by telephonic interviews. Online Coding… Read More »
Given an infinite series and a value x, the task is to find its sum. Below is the infinite series 1^2*x^0 + 2^2*x^1 + 3^2*x^2… Read More »
The study of software fault-tolerance is relatively new as compared with the study of fault-tolerant hardware. In general, fault-tolerant approaches can be classified into fault-removal… Read More »
The Jelinski-Moranda (J-M) model is one of the earliest software reliability models. Many existing software reliability models are variants or extensions of this basic model.… Read More »
Given a number N. The task is to find the sum of the below series up to N-th term: 1 + 22 + 333 +… Read More »
Given a number N. The task is to find the sum of the below series up to nth term. 1- 2 + 3 – 4… Read More »
Given two numbers a and n, the task is to find the single sum of digits of a^n (pow(a, n)). In single digit sum, we… Read More »
Given a list of characters, convert the list to a string. Input : list = {‘g’, ‘e’, ‘e’, ‘k’, ‘s’} Output : “geeks” Input :… Read More »
Given an array, print the Next Greater Element (NGE) for every element. The Next greater Element for an element x is the first greater element… Read More »
ArrayList is a part of collection framework and is present in java.util package. It provides us dynamic arrays in Java. Though, it may be slower… Read More »