Question 1:
https://leetcode.com/problems/valid-palindrome/)
Question 2:
Given a location of shops, facebook users and k is the integer. Return the k number of shops closer to each facebook user. No input output constrains provided
After some discussion he gave me a helper method
helper(3, user1, shop1)
helper(3, user2, shop1)
helper(3, user1, shop2)
Any clue on how would you go about solving the 2nd problem?