Free Post Coding Leaders in an array Print all the leaders in an array. An element is a leader if it's greater than all the elements to it's right (the rightmost element is always a leader).
Free Post Coding Merge K Sorted Arrays We think of the Merge operation in the Merge Sort to merge two sorted arrays into one. Also use the Min Heap approach to optimize.
Free Post Coding 236. Lowest Common Ancestor of a Binary Tree Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
Free Post Coding 116. Populating Next Right Pointers in Each Node (LeetCode) Connect nodes at the same level: Write a function to connect all the adjacent nodes at the same level in a binary tree.
Free Post Coding Clone a Linked List with a next and random pointer Given a double linked list with one pointer pointing to the next node similar to single linked list. The second pointer can point to any node in the linked list. We have to write a program in O(n) time.
Free Post Coding Program to print the last N lines Given the string, we have to print the last N lines (known problem to print last 10 lines). If number of lines is less than N, then print all lines.
Free Post Coding Sum of two Linked List Sum of two linked lists using recursion without any extra space and modification to the Linked List.
Free Post Coding Search in a Rotated Array The interesting property of a sorted and rotated array is that when you divide it into two halves, atleast one of the two halves will always be sorted.
Free Post Coding Remove all duplicates from a given string Remove all duplicates from a given string using constant space and linear time
Free Post Coding Leetcode 98. Validate Binary Search Tree (BST) - C# Given a binary tree, determine if it is a valid binary search tree (BST)
Free Post Coding Edit Distance - LeetCode Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2
Free Post Coding 1035. Understand Uncrossed Lines (LeetCode) Uncrossed Lines problem (1035) is part of the May 2020 monthly challenge on LeetCode platform. We solve the problem by using Dynamic Programming concept by finding a pattern in the matrix representation.
Free Post Coding How Number of ways with combinations to get a final score help you live a better life - II Count number of ways to reach a given number with combinations
Free Post Coding How Number of ways to get a final score help you live a better life - I Count number of ways to get a final number
Free Post Coding Why Articulations Point or Cut Vertex in a Graph is sexy A vertex in a graph is called an articulation point or a cut vertex iff removing it disconnects the graph. It identifies the vulnerabilities in a connected network, on failure would split the graph and helps designing reliable networks.