## Count of all subsequences having adjacent elements with different parity

Given an array arr[] of size N, the task is to find the number of non-empty subsequences from the given array such that no two… Read More »

- Must Do Coding Questions for Companies like Amazon, Microsoft, Adobe, ...
- Must Do Coding Questions Company-wise
- Which Java libraries are useful for competitive programming?
- Which Python Modules are useful for competitive programming?
- 10 Tips to Prepare for a Video Job Interview
- Find the element in a linked list with frequency at least N/3
- Count of all subsequences having adjacent elements with different parity
- Find the node at the centre of an N-ary tree
- Count of N-digit numbers with absolute difference of adjacent digits not exceeding K
- Minimize number of cuts required to break N length stick into N unit length sticks
- The Fox, The Duck and a Circular Pond
- Minimum count of numbers required with unit digit X that sums up to N
- Print the longest path from root to leaf in a Binary tree
- Smallest number containing all possible N length permutations using digits 0 to D
- Maximize jobs that can be completed under given constraint
- Calculate weight of parenthesis based on the given conditions
- Maximum size subset with given sum using Backtracking
- Maximize Profit by trading stocks based on given rate per day
- Length of race track based on the final distance between participants
- Minimum changes required to make all Array elements Prime
- Difference between sum of even and odd valued nodes in a Binary Tree
- Check if two nodes are on same path in a tree | Set 2

Given an array arr[] of size N, the task is to find the number of non-empty subsequences from the given array such that no two… Read More »

Prerequisites: Diameter of a N-ary tree Path between two nodes in a graph Given a N-ary tree with N nodes numbered from 0 to N-1… Read More »

Given a binary tree, the task is to find the absolute difference between the even valued and the odd valued nodes in a binary tree.… Read More »

Given two integers N and K, the task is to find the count of N-digit numbers such that the absolute difference of adjacent digits in… Read More »

Given a valid parenthesis string S, the task is to find the weight of parenthesis based on the following conditions: Weight of “( )” is… Read More »

Given two nodes of a binary tree v1 and v2, the task is to check if two nodes are on the same path in a… Read More »

Given two integers N and X, the task is to find the minimum count of integers with sum N and having unit digit X. If… Read More »

Given a binary tree, the task is to print the longest path from the root node to the leaf node. If there are multiple answers… Read More »

Given an array arr[] consisting of N integers and an integer K, the task is to find the length of longest subsequence with sum equal… Read More »

Given an integer N denoting number of jobs and a matrix ranges[] consisting of a range [start day, end day] for each job within which… Read More »

Given an array arr[] of N positive integers which denotes the cost of selling and buying a stock on each of the N days. The… Read More »

Given an array of integers arr[], the task is to count the minimum number of changes required to convert each array element to its nearest… Read More »

A Duck that is being chased by a Fox saves itself by sitting at the centre of a circular pond of radius r. The Duck… Read More »

Given an integer N denoting the length of a given stick, the task is to minimize the time required to split the stick into pieces… Read More »

Given two integer N and K, the task is to find the size of the smallest string that contains all permutations of length N that can… Read More »