Vmware Topics for Interview Preparation

Table of ContentEasy LevelMedium LevelHard LevelEasy LevelWrite a program to reverse an array or stringA Boolean Matrix QuestionCount frequencies of all elements in array ...

Table of Content Easy Level Medium Level Hard Level Easy Level Write a program to reverse an array or string A Boolean Matrix Question Count frequencies of all elements in array in O(1) extra space and O(n) time Find common elements in three sorted arrays Program for Armstrong Numbers Run Length Encoding Sieve of Eratosthenes Find the middle of a given linked list in C and Java Write a Program to Find the Maximum Depth or Height of a Tree Write an Efficient Function to Convert a Binary Tree into its Mirror Tree Diameter of a Binary Tree Maximum width of a binary tree Sorted Array to Balanced BST Stack | Set 2 (Infix to Postfix) Medium Level A program to check if a binary tree is BST or not Detect and Remove Loop in a Linked List Dynamic Programming | Set 11 (Egg Dropping Puzzle) Find a pair with given sum in a Balanced BST Reverse a Linked List in groups of given size Hard Level Given an array arr[], find the maximum j - i such that arr[j] > arr[i]