Sixt Software Engineer interview questions

Merge K sorted link list, given an (n X n) binary row-wise sorted matrix find row having the highest number of 1’s, given a BST check whether the given element is present in BST or not?

1) Hashmap implementation in case of bad hashcode function 2) Linked list merge 3) LRU cache implementation . 4)Array prob to move zeros to end 5)Water Trapper in building problem . 6)implement Hashmap using any DS (Design) 7)lift system 8) Binary tree problem 9) find K neighbours from target node