Meta Phonescreen

Summary

I had a phone interview at Meta where I successfully solved two data structure and algorithm problems, and I am currently awaiting a reply.

I was able to solve both questions awaiting for reply

Hope this helps for other users

01
Swap Nodes in Pairs
Data Structures & Algorithms · Medium
Given a head of a linked list, swap every two adjacent nodes and return its head. I must solve the problem without modifying the values in the list's nodes (i.e., only nodes themselves may be changed).
Open the problem
02
Insert Delete GetRandom O(1)
Data Structures & Algorithms · Medium
Implement the RandomizedSet class:
- RandomizedSet() Initializes the RandomizedSet object.
- bool insert(int val) Inserts an item val into the set if not present. Returns true if the item was not present, false otherwise.
- bool remove(int val) Removes an item val from the set if present. Returns true if the item was present, false otherwise.
- int getRandom() Returns a random element from the current set of elements (at least one element must exist when this method is called). Each element must have the same probability of being returned. I must implement the functions of the class such that each function works in average O(1) time complexity.
Open the problem