Objective: Given a string, find a longest palindromic subsequence in it. What is Longest Palindromic Subsequence: A longest palindromic subsequence … Read more
Objective: Given a rope of length n meters, write an algorithm to cut the rope in such a way that … Read more
Objective: Generate Well Ordered Passwords of a Given Length K. Well ordered means that digits should be in increasing order … Read more
Objective: Given a string and a dictionary of words, find out if the input string can be broken into a … Read more
Objective: A knight’s tour is a sequence of moves of a knight on a chessboard such that the knight visits … Read more
Objective: Given an amount of ‘A’ and n coins, v1<v2<v3<………..<vn. Write a program to find out the minimum number of … Read more
Objective: Reverse The Doubly Linked List. Example: Approach: Every Node in a doubly-linked list has the next and previous pointer. … Read more
Objective: – Given Binary Tree, Print All The Nodes Which are X distance from the Given Node.
Example :
Approach:
Quite Tricky solution, i will explain using the example given in the picture.
Find out all the nodes which are at distance ‘3’ from the given node 5.
Objective: – Given a binary tree, print it in vertical order sum
What is Vertical Order Sum
as you can see in the example above, [4],[2], [12],[3],[7] are the vertical order sum of the given binary tree.
Approach:
Objective: – Given a binary tree, print it in vertical order path.
What is Vertical Order
as you can see in the example above, [4],[2], [1,5,6],[3],[7] are the verical order of the given binary tree.
Approach:
Objective: Given Two linked lists, check whether both lists intersect each other, if yes then find the starting node of the intersection.
An intersection point means the end of one linked list is linked with some node in another linked list and it forms a Y shape.
Input: Two Linked List
Output: Intersection Node or point
Example:
Approach: