## Sudo Placement[1.4] | K Sum

Given head of a linked list of integers and an integer k, your task is to modify the linked list as follows: Consider nodes in… Read More »

- Delete Nth node from the end of the given linked list
- Create new linked list from two given linked list with greater element at each node
- Count duplicates in a given linked list
- Find the node with minimum value in a Binary Search Tree using recursion
- Remove Nth node from end of the Linked List
- Find the balanced node in a Linked List
- Create a linked list from two linked lists by choosing max element at each position
- Traverse Linked List from middle to left-right order using recursion
- Print all the peaks and troughs in an Array of Integers
- Print all the sub diagonal elements of the given square matrix
- Maximum sum of the array after dividing it into three segments
- Print all the super diagonal elements of the given square matrix
- Compare sum of first N-1 elements to Nth element of an array

Given head of a linked list of integers and an integer k, your task is to modify the linked list as follows: Consider nodes in… Read More »

Given a root node to a tree, find the sum of all the leaf nodes which are at maximum depth from root node. Example: 1… Read More »

Given an N x M grid. The task is to find the minimum product of four adjacent numbers in the same direction (up, down, left,… Read More »

Given a linked list, rearrange it such that converted list should be of the form a < b > c < d > e <… Read More »

Given a BST and a key. The task is to find the inorder successor and predecessor of the given key. In case, if either of… Read More »

Given an array A of N numbers where Ai represent the value of the (i+1)th node. Also given are M pair of edges where u… Read More »

Given a Binary tree and a number N, write a program to find the N-th node in the Postorder traversal of the given Binary tree.… Read More »

Given a binary tree, find the vertical width of the binary tree. The width of a binary tree is the number of vertical paths. In… Read More »

Write a function to print ZigZag order traversal of a binary tree. For the below binary tree the zigzag order traversal will be 1 3… Read More »

Given two arrays that represent Preorder traversals of a full binary tree and its mirror tree, we need to write a program to construct the… Read More »

Construct the BST (Binary Search Tree) from its given level order traversal. Examples: Input : arr[] = {7, 4, 12, 3, 6, 8, 1, 5,… Read More »

Given a binary tree containing n nodes. The problem is to find the sum of all nodes on the longest path from root to leaf… Read More »

Given two BSTs containing n1 and n2 distinct nodes respectively. Given a value x. The problem is to count all pairs from both the BSTs… Read More »

Given a Binary Tree, find sum of all right leaves in it. Similar article : Find sum of all left leaves in a given Binary… Read More »

Prerequisite – Array Basics Given an array, write a program to find the sum of values of even and odd index positions separately. Examples: Input… Read More »