Flipkart SDE-ll Interview Question | Advanced Data Structures (Skip Lists) | Off-campus

Question 1: Design a Skip List Problem Statement Design a SkipList without using any built-in libraries. A Skip List is a probabilistic data structure that allows O(log n) search, insertion, and removal within an ordered sequence of elements. It achieves this by maintaining a hierarchy of linked lists, bypassing large sections of data. Implement the Skiplist class: Skiplist() Initializes the object of the skip list. boolean search(int target) Returns true if the integer target exists in the SkipList or false ...