Implement the next permutation, which rearranges numbers into the numerically next greater permutation of numbers. If such arrangement is not possible, it must be rearranged as the lowest possible order ie, sorted in an ascending order. The replacement must be in-place, do not allocate extra memory ~~~~Asked in: Microsoft, Morgon Stanley, Samsung, Intuit
Design a data structure which performs the following operations(Insert an element/Remove an element /find random element) in O(1) time complexity ~~~~ Asked in : Google, Facebook, Amazon
This course explains all the deep concepts of Data structure and Algorithms with the help of problems. These problems are frequently asked during interviews. System Design problems also explains with all core components of distributed system.
Design the data structures for a generic deck of cards by using objected orinted princial ~~~~ Asked in : OLA, Juniper Networks
Design custom implementation hashmap, how hashmap works internally in Java
Given two n-ary trees, the task is to check if they are mirror of each other or not