Given n dices each with m faces, numbered from 1 to m, find the number of ways to get a given sum X. X is… Read More »
All Hard Articles
We are going to be looking at the method to close the current tab in a browser window using JavaScript. Earlier it used to happen… Read More »
Round 1:Online Test The Online round was hosted by HackerRank. There was a total of 22 questions. The time given was 1 ½ hours. Every… Read More »
Given a string str, the task is to answer Q queries where every query consists of two integers L and R and we have to… Read More »
Given a string, we need to find the minimum number of rotations required to get the same string. In this case, we will only consider… Read More »
A trip to mystical land is going to be organized in ByteLand, the city of Bytes. Unfortunately, there are limited seats say A and there… Read More »
Given a number n. You are required to find ( Fib(n) ^ Fib(n) ) % 10^9 + 7, where Fib(n) is the nth fibonacci number.… Read More »
1. Online Assessment Test (HackerRank) a. 15 aptitude questions (15 mins) b. 5 input-output programs (15 mins) c. 2 programming questions (45 mins) 2.… Read More »
Given a string str of lowercase alphabets, the task is to find all distinct palindromic sub-strings of the given string. Examples: Input: str = “abaaa”… Read More »
Given an integer array arr[] of length N consisting of positive integers, the task is to minimize the number of steps required to reach the… Read More »
Given two integers N and K, the task is to check whether N can be represented as sum of K distinct positive integers. Examples: Input:… Read More »
Given a binary string str. The task is to find the smallest positive integer C such that the binary string can be cut into C… Read More »
Given a Binary Tree, the task is to find the size of largest Complete sub-tree in the given Binary Tree. Complete Binary Tree – A… Read More »
Given a binary array arr[] and q queries of following types: k: find the index of the kth set bit i.e. kth 1 in the… Read More »
We have seen different ways of performing postorder traversal on Binary Trees. Post Order Traversal. Iterative Postorder Traversal using Two Stacks. Iterative Postorder Traversal using… Read More »
Given a binary tree, target node X and a string patt. The task is to find the last node of the binary tree following the… Read More »
Given an unsorted array and two numbers x and k, find k closest values to x. Examples: Input : arr[] = {10, 2, 14, 4,… Read More »
Behold, Marvel Fans. Avengers are out there to save the Multiverse, so are we, ready to do whatever it takes to support them. In this… Read More »
Node.js Server Node.js is a javascript framework for writing Server-side applications. A Node.js server provides the mechanisms for connecting to a service and sending/receiving data.… Read More »
Given an array arr[] of N integers and an integer X. We can choose any sub-array and multiply all its element by X. After multiplication,… Read More »
