Skip to content
Related Articles

Related Articles

PharmEasy Interview Experience for SDE-1

Improve Article
Save Article
  • Difficulty Level : Expert
  • Last Updated : 20 Jan, 2020
Improve Article
Save Article

Round 1:

Question 1: Find the element that appears once in an array where every other element appears twice in less than O(n). Array is sorted.

Question 2: https://www.geeksforgeeks.org/sliding-window-maximum-maximum-of-all-subarrays-of-size-k/

I was eliminated after this round.

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!