一亩三分地论坛

 找回密码
 获取更多干货,去instant注册!

一亩三分地官方iOS手机应用下载
查看: 899|回复: 10
收起左侧

google phone ...bless

[复制链接] |试试Instant~ |关注本帖
池大侠 发表于 2015-3-17 02:01:10 | 显示全部楼层 |阅读模式

2013(1-3月) 码农类 硕士 全职@Google - 内推 - 技术电面 |Other

注册一亩三分地论坛,查看更多干货!

您需要 登录 才可以下载或查看,没有帐号?获取更多干货,去instant注册!

x
just finished .. all three can be solve with hashing..... Waral 鍗氬鏈夋洿澶氭枃绔,
Bless!!

first question:
1.find the latest events
2.find pairs in hands  need to define data structure by myself
3.find straight in hands

all problem can be done in linear time.. visit 1point3acres.com for more.
below are questions and my solution.

bless!!!!!!!!!!! anyway....
  1. Please use this Google doc to code during your interview. To free your hands for coding, we recommend that you use a headset or a phone with speaker option.-google 1point3acres

  2. Best,. more info on 1point3acres.com
  3. Google Staffing


  4. A session is a series of Events. Each session is identified by a number, the sessionId. Events have this structure:

  5. class Event {-google 1point3acres
  6.   public int sessionId;  // identities the session this Event belongs to
  7.   public int timestamp;  // time the Event occurred
  8.   [...]
  9. }
  10. .1point3acres缃
  11. We have an unordered list of Events from multiple sessions intermixed. Given this list (List<Event>), construct a new list containing only the latest Event for each session.
  12. #input=[event1,event2,.....]
  13. #linear space and linear time.1point3acres缃
  14. #time1 12:00PM 鏉ユ簮涓浜.涓夊垎鍦拌鍧.
  15. #hashtable
  16. def solve(events):
  17.         dict={}# key: sessionID, value would be eventname sorted by timestamp. 鐗涗汉浜戦泦,涓浜╀笁鍒嗗湴
  18. for elem in events:       
  19.                 if elem.sessionId not in dict:. 鐣欏鐢宠璁哄潧-涓浜╀笁鍒嗗湴
  20.                         dict[elem.sessionId]=elem
  21.                 elif elem.timestamp>dict[elem.sessionId].timestamp:
  22.                         dict[elem.sessionId]=elem
  23. res=[]
  24. for elem in dict:
  25.         res.append(dict[elem])
  26. return res
  27. .鐣欏璁哄潧-涓浜-涓夊垎鍦
  28. . 鍥磋鎴戜滑@1point 3 acres
  29. . visit 1point3acres.com for more.

  30. 52-card deck.1point3acres缃
  31. 4 suits: spades, hearts, diamonds, clubs. 鍥磋鎴戜滑@1point 3 acres
  32. 13 values: A, 2, 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K
  33.        

  34. hand: 5 cards
  35. Write a function to detect whether a poker hand contains a “pair” (exactly 2 cards with the same value).. 涓浜-涓夊垎-鍦帮紝鐙鍙戝竷
  36. ## given 5 cards -google 1point3acres
  37. .鏈枃鍘熷垱鑷1point3acres璁哄潧
  38. class card:
  39.         def __init__(self,value,suit):
  40.                 self.value=value
  41.                 self.suit=suit.鏈枃鍘熷垱鑷1point3acres璁哄潧
  42. #class hand:
  43. #        def __init__(self,n):
  44. #                self.n=n
  45. #                self.hand=[]
  46. #        def getcard(self,card):
  47. #                self.hand.append(card). visit 1point3acres.com for more.
  48.        
  49. #list of cards=>hand
  50. #nlog(n) time sort by its value  give me the result 3, 8 eight?
  51. #hash.鏈枃鍘熷垱鑷1point3acres璁哄潧
  52. # linear time and space
  53. def check(hand):
  54.         dict={}
  55.         for card in hand:
  56.                 if card.value not in dict:
  57.                         dict[card.value]=1
  58.                 else:
  59.                         dict[card.value]+=1
  60.         ## check whether  I have a pair
  61.         for elem in dict:
  62.                 if dict[elem]==2:
  63.                         return True
  64.         return False

  65. # determine whether the hand contains a “straight”: values are consecutive
  66. # Ace can be high or low
  67. # A, 2, 3, 4, 5 is a straight
  68. # 4, 5, 6, 7, 8 is a straight. more info on 1point3acres.com
  69. # 10, J, Q, K, A is also a straight       
  70. # replace A with both 1 and 14
  71. # sort nlog(n)
  72. # 7,8,9,10,A -> 7,8,9,10,1,14. 鐗涗汉浜戦泦,涓浜╀笁鍒嗗湴
  73. # 10,11,12,13,A-> 10,11,12,13,14,1-google 1point3acres
  74. # go through the sorted array of cards to check whether they are consecutive
  75. # this take nlogn time.鏈枃鍘熷垱鑷1point3acres璁哄潧
  76. # hash to detect consecutive cards.鏈枃鍘熷垱鑷1point3acres璁哄潧



  77. .鏈枃鍘熷垱鑷1point3acres璁哄潧

  78. def check(hand):
  79.         ## deal with A first -> replace A with 1 and 14
  80.         ## ‘J’:11, ‘K’:13####

  81. for cardelem in hand:. From 1point 3acres bbs
  82.         ## first step deal with A
  83. if cardelem.value=’A’:
  84.         newcard=card(14,’spade’)
  85.         cardelem.value=1
  86. hand.append(newcard). Waral 鍗氬鏈夋洿澶氭枃绔,
  87. dict={}

  88. for cardelem in dict:
  89.         if cardelem not in dict:
  90.                 dict[cardelem.value]=True       
  91.                      count=1
  92.                 maxlen=1. 1point3acres.com/bbs
  93.                 for key in dict:
  94.                         count=1
  95.                         pre=key-1
  96.                         while pre in dict and dict[pre]:. Waral 鍗氬鏈夋洿澶氭枃绔,
  97.                                 count+=1
  98.                                 dict[pre]=False
  99.                                 pre-=1
  100.         ## 6,7<-8 ->9 10
  101.                         post=key+1
  102.                         while post in dict and dict[post]:
  103.                                 count+=1.鐣欏璁哄潧-涓浜-涓夊垎鍦
  104.                                 dict[post]=False
  105.                                 post+=1
  106.                         maxlen=max(maxlen,count)
  107.         if maxlen==5:
  108.                 return True
  109.         else:       
  110.                 return False
  111.                
  112. #linear time and space 鏉ユ簮涓浜.涓夊垎鍦拌鍧.
  113. #

  114.        
  115. Ace of Spades
  116. 3 of diamonds
  117. 8 of clubs. from: 1point3acres.com/bbs
  118. 8 of hearts
  119. J of diamonds
复制代码

补充内容 (2015-3-16 17:43):
some  problem in the code fomat cause jst copied from google doc.

评分

3

查看全部评分

jeager 发表于 2015-3-17 02:45:54 | 显示全部楼层
关注一亩三分地公众号:
Warald_一亩三分地
第三题 可以 这么办
一个boolean A, A是否出现
一个max,一个min
A不计入max,min,length
一圈下来
if(A){
    if((min == 2 || max == 13) && max-min +1 == 4) return true;
    else return false;
}
else{. 1point3acres.com/bbs
  if(max-min +1 == 5) return true;-google 1point3acres
  else return false;
}. 鐣欏鐢宠璁哄潧-涓浜╀笁鍒嗗湴

这样的话,time O(n), space(1);

评分

1

查看全部评分

回复 支持 3 反对 0

使用道具 举报

fishyuze 发表于 2015-3-18 09:21:01 | 显示全部楼层
关注一亩三分地微博:
Warald
for the straight: why not just use a boolean array?
and what about J Q K A 2?
回复 支持 1 反对 0

使用道具 举报

houqingniao 发表于 2015-3-17 02:36:26 | 显示全部楼层
bless~
lz 没问题的
回复 支持 反对

使用道具 举报

Reborn2beCoder 发表于 2015-3-18 07:25:15 | 显示全部楼层
跪求lz解释这段代码. 1point 3acres 璁哄潧

              for key in dict:
                        count=1
                        pre=key-1
                        while pre in dict and dict[pre]:
                                count+=1
                                dict[pre]=False
                                pre-=1
        ## 6,7<-8 ->9 10-google 1point3acres
                        post=key+1. 1point 3acres 璁哄潧. 鍥磋鎴戜滑@1point 3 acres
                        while post in dict and dict[post]:
                                count+=1
                                dict[post]=False
                                post+=1
.1point3acres缃                        maxlen=max(maxlen,count)
求职神器indeed - 在全球最大的求职网站找找适合你的工作?
回复 支持 反对

使用道具 举报

 楼主| 池大侠 发表于 2015-3-18 08:47:09 | 显示全部楼层
Reborn2beCoder 发表于 2015-3-17 22:25
跪求lz解释这段代码

              for key in dict:
. visit 1point3acres.com for more.
longest consecutive sequence...
回复 支持 反对

使用道具 举报

Reborn2beCoder 发表于 2015-3-18 08:56:46 | 显示全部楼层
池大侠 发表于 2015-3-18 08:47. 鍥磋鎴戜滑@1point 3 acres
longest consecutive sequence...
.1point3acres缃
可是pre 跟 post 都只加一次就被false了呀。。还会继续运行吗><
回复 支持 反对

使用道具 举报

 楼主| 池大侠 发表于 2015-3-18 09:22:43 | 显示全部楼层
Reborn2beCoder 发表于 2015-3-17 23:56
可是pre 跟 post 都只加一次就被false了呀。。还会继续运行吗>
. 鐣欏鐢宠璁哄潧-涓浜╀笁鍒嗗湴
yes.. just need to check once . if they are consecutive it doesnt matter.
that's y its linear
回复 支持 反对

使用道具 举报

Reborn2beCoder 发表于 2015-3-18 09:37:50 | 显示全部楼层
池大侠 发表于 2015-3-18 09:22
yes.. just need to check once . if they are consecutive it doesnt matter.
that's y its linear
. 鐗涗汉浜戦泦,涓浜╀笁鍒嗗湴
看明白啦~~~ 不过其实如果只是连着的5个数的话只要判断没有重复而且dic[4] - dic[0] == 4就好了吧?有A的话就看 dic[4] - dic[0] ==4 || dic[5]-dic[1]==4 ?
回复 支持 反对

使用道具 举报

本版积分规则

请点这里访问我们的新网站:一亩三分地Instant.

Instant搜索更强大,不扣积分,内容组织的更好更整洁!目前仍在beta版本,努力完善中!反馈请点这里

关闭

一亩三分地推荐上一条 /5 下一条

手机版|小黑屋|一亩三分地论坛声明 ( 沪ICP备11015994号 )

custom counter

GMT+8, 2017-2-19 23:35

Powered by Discuz! X3

© 2001-2013 Comsenz Inc. Design By HUXTeam

快速回复 返回顶部 返回列表