## Longest sub-sequence of array containing Lucas numbers

Given an array arr[] of N elements, the task is to find the length of the longest sub-sequence in arr[] such that all the elements… Read More »

- How can one become good at Data structures and Algorithms easily?
- Load Factor and Rehashing
- Rat in a Maze | Backtracking using Stack
- How do Dynamic arrays work?
- Find the node with maximum value in a Binary Search Tree
- Remove last node of the linked list
- Sort the array of strings according to alphabetical order defined by another string
- Iterative Method To Print Left View of a Binary Tree
- Count the Number of Binary Search Trees present in a Binary Tree
- Number of array elements derivable from D after performing certain operations
- Fibonacci Heap - Deletion, Extract min and Decrease key
- Print all nodes between two given levels in Binary Tree
- Zig-Zag traversal of a Binary Tree using Recursion
- Number of special nodes in an n-ary tree
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Count all Grandparent-Parent-Child Triplets in a binary tree whose sum is greater than X
- Check if the given Binary Tree have a Subtree with equal no of 1's and 0's
- Print all odd nodes of Binary Search Tree
- Number of sub-strings which are anagram of any sub-string of another string
- Number of subarrays have bitwise OR >= K
- Reverse zigzag Traversal of a Binary Tree
- Check whether the two Binary Search Trees are Identical or Not
- Delete all the even nodes from a Doubly Linked List
- A variation of Rat in a Maze : multiple steps or jumps allowed
- Sum of all the elements in an array divisible by a given number K
- Sum and Product of minimum and maximum element of Binary Search Tree
- Print the last k nodes of the linked list in reverse order | Iterative Approaches
- Find the first maximum length even word from a string
- Difference between Stack and Queue Data Structures
- Find maximum among all right nodes in Binary Tree

Given an array arr[] of N elements, the task is to find the length of the longest sub-sequence in arr[] such that all the elements… Read More »

Given an array arr[], the task is to count the number of elements from the array which divide the sum of all other elements. Examples:… Read More »

Given N boxes with their capacities which denotes the total number of boxes that it can hold above it. You can stack up the boxes… Read More »

Given a Binary Tree, the task is to print the leaf nodes from left to right.The nodes must be printed in the order they appear… Read More »

Given an array A containing N elements (N is divisible by 3), the task is to split the numbers into groups of 3, let the… Read More »

Given a string S containing only uppercase English characters. The task is to find whether S is the same as its reflection in a mirror.… Read More »

Given an array containing N elements, each element is either 1 or 2. The task is to find out whether the array can be divided… Read More »

Given three integers N, D and K. The task is to check whether it is possible to make a tree with exactly N vertices, D… Read More »

Given a NxN 2-D matrix, the task to find the sum of all the submatrices. Examples: Input : arr[] = {{1, 1}, {1, 1}}; Output… Read More »

Given an array of n length. The task is to check if the given array can be split into an odd number of sub-segment starting… Read More »

Given an array Arr[] of N integers. The task is to find minimum number of elements needed to be removed from the array, so that… Read More »

Given an undirected complete graph of N vertices where N > 2. The task is to find the number of different Hamiltonian cycle of the… Read More »

Given an integer K and an array arr[], the task is to split the array arr[] into K consecutive subarrays to find the maximum possible… Read More »

Given a directed graph and a node X. The task is to find the minimum number of edges that must be added to the graph… Read More »

Given an array arr[] of N integers and an integer M where N % M = 0. The task is to find the minimum number… Read More »