heythisisom

↗ HN profile [ 44.4 ms ] full profile
Karma
1
Created
June 5, 2017 (9y ago)
Submissions
0
  1. I'm trying to solve a problem where my program would read a log file containing IP addresses and UNIX timestamp. at any instant of time, I need to find the top K IP addresses with the highest number of hits over a time…

  2. "Given a billion points p1, p2, p3,...,pN in which each point is of the form (x1,y1). Also given a point Q which is of the form (x,y). Find the closest point P from Q. Constraint: Time Complexity O(logN)". The Naive's…

  3. I'm a recent Computer Science graduate also the CTO of a Million dollar startup. Being a Computer science Engineer and Tech enthusiast, my long time goal was to get the taste of work culture at one of the Big 4.…