## Find the number of points that have atleast 1 point above, below, left or right of it

Given N points in 2 dimensional plane. A point is said to be above another point if the X coordinates of both points are same… Read More »

- How can one become good at Data structures and Algorithms easily?
- How do Dynamic arrays work?
- Find the node with maximum value in a Binary Search Tree
- Remove last node of the linked list
- Iterative Method To Print Left View of a Binary Tree
- Sort the array of strings according to alphabetical order defined by another string
- Fibonacci Heap - Deletion, Extract min and Decrease key
- Zig-Zag traversal of a Binary Tree using Recursion
- Number of array elements derivable from D after performing certain operations
- Print all nodes between two given levels in Binary Tree
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Print all odd nodes of Binary Search Tree
- Number of subarrays have bitwise OR >= K
- Reverse zigzag Traversal of a Binary Tree
- Count all Grandparent-Parent-Child Triplets in a binary tree whose sum is greater than X
- Number of sub-strings which are anagram of any sub-string of another string
- A variation of Rat in a Maze : multiple steps or jumps allowed
- Difference between Stack and Queue Data Structures
- Sum and Product of minimum and maximum element of Binary Search Tree
- Minimum number of edges between two vertices of a graph using DFS
- Building Expression tree from Prefix Expression
- Print All Leaf Nodes of a Binary Tree from left to right | Set-2 ( Iterative Approach )
- Sum of minimum elements of all possible sub-arrays of an array
- Delete all odd or even positioned nodes from Circular Linked List
- Sum of all the elements in an array divisible by a given number K
- Sum and Product of the nodes of a Circular Singly Linked List which are divisible by K
- Find maximum among all right nodes in Binary Tree
- Finding the path from one vertex to rest using BFS
- Product of all nodes in a Binary Tree
- Multidimensional Collections in Java

Given N points in 2 dimensional plane. A point is said to be above another point if the X coordinates of both points are same… Read More »

Given an array a[] consisting only 0 and 1. The task is to check if it is possible to transform the array such that the… Read More »

Given an array arr[], the task is to find the sum of the minimum elements of every possible sub-array of the array. Examples: Input: arr[]… Read More »

Given an array arr[], the task is to find the sum of the maximum elements of every possible sub-array of the array. Examples: Input: arr[]… Read More »

Given an integer N, the task is to construct a tree such that sum of for all ordered pairs (u, v) is maximum where u… Read More »

Given the position of a Bishop on an 8 * 8 chessboard, the task is to count the total number of squares that can be… Read More »

Given a string str, the task is to print all the distinct permutations of str. A permutation is an arrangement of all or part of… Read More »

Given N strings consisting of lowercase letters of the English alphabet. The task is to find how many strings out of these N strings are… Read More »

Given a binary tree with N nodes, in which each node value represents number of candies present at that node, and there are N candies… Read More »

Given the position of a Bishop and a Pawn on a 8 * 8 chessboard, the task is to check whether the Bishop can take… Read More »

Given an array arr[] of N integers and an integer cost, the task is to calculate the cost of making all the elements of the… Read More »

Given a string, write a Python program to check if that string is Pangram or not. A pangram is a sentence containing every letter in… Read More »

Given a keypad of a mobile, and keys that need to be pressed, the task is to print all the words which are possible to… Read More »

Given an array arr[], the task is to print the count of unique pairs (arr[i], arr[j]) such that i < j. Examples: Input: arr[] =… Read More »

Given N intervals of the form of [l, r], the task is to find the intersection of all the intervals. An intersection is an interval… Read More »