Ideserve.co.in Website Review

preparing for interviews? ideserve team is here to help. here's how! study following topics to enhance your algorithmic skills. these range from easy to advanced level and are frequently asked in. find last index of an element in a sorted array with duplicates. find first index of an element in a sorted array with duplicates. lowest common ancestor of two nodes in a binary search tree. detect a loop in a linked list and find the node where the loop starts.. minimum number of trials to reach from source word to destination word. find total number of ways to make change using given set of coins. remove the nodes of binary search tree which are outside the given range. check if all internal nodes of bst have only one child without building tree. find the length of longest increasing subsequence in an array. check if two binary search trees are identical given their array representations. find an integer array corresponding to the string specifying increase-decrease transitions. find floor and ceiling of an element from given dataset using binary search tree. find increasing sub-sequence of length three having maximum product. re-arrange elements in an array to put positive and negative elements in alternate order. find index of 0 to replace to get longest continuous sequence of 1s. o(n) time approach to find index of 0 to replace to get longest continuous sequence of 1s. given an array with all distinct elements, find the length of the longest sub-array which has elements(not in any particular order) that. check if a binary tree is sub-tree of another binary tree in space o(1). check if a binary tree is sub-tree of another binary tree in time o(n). construct the binary tree from its parent array representation. find height of the binary tree from its parent array representation. given a sequence of words, group together all anagrams and print them.. serialize and deserialize a binary search tree using post order traversal. construct binary tree from inorder and postorder traversals.