网站综合信息 techinterview.org
- 标题:
- Tech Interview | A site for technical
- 关键字:
- 描述:
- Welcome to techInterview, a site for technical interview questions, brain teasers, puzzles, quizzles
- 域名信息
- 域名年龄:23年1个月19天 注册日期:2001年05月31日 到期时间:
邮箱:deadprogrammer 电话:+1.9174143650
注册商:eNom, Inc. (R39-LROR)
- 服务器空间
- IP:198.211.115.84 同IP网站1个 详情
地址:美国 纽约州纽约市Digital Ocean股份有限公司
- 备案信息
- 备案号:
域名流量Alexa排名
域名注册Whois信息
techinterview.org
域名年龄: 23年1个月19天注册时间: 2001-05-31
注 册 商: eNom, Inc. (R39-LROR)
注册邮箱: deadprogrammer
联系电话: +1.9174143650
获取时间: 2015年05月21日 06:31:19
Domain Name:TECHINTERVIEW.ORG
Domain ID: D71574504-LROR
Creation Date: 2001-05-31T01:16:34Z
Updated Date: 2014-09-15T00:20:32Z
Registry Expiry Date: 2016-05-31T01:16:34Z
Sponsoring Registrar:eNom, Inc. (R39-LROR)
Sponsoring Registrar IANA ID: 48
WHOIS Server:
Referral URL:
Domain Status: clientTransferProhibited -- http://www.icann.org/epp#clientTransferProhibited
Registrant ID:25f9e741a3047a00
Registrant Name:Michael Krakovskiy
Registrant Organization:Third Ingredient Consulting
Registrant Street: 1612 Kings Highway
Registrant Street: 96
Registrant City:Brooklyn
Registrant State/Province:NY
Registrant Postal Code:11229
Registrant Country:US
Registrant Phone:+1.9174143650
Registrant Phone Ext:
Registrant Fax: +1.9174143650
Registrant Fax Ext:
Registrant Email:deadprogrammer
Admin ID:25f9e741a3047a00
Admin Name:Michael Krakovskiy
Admin Organization:Third Ingredient Consulting
Admin Street: 1612 Kings Highway
Admin Street: 96
Admin City:Brooklyn
Admin State/Province:NY
Admin Postal Code:11229
Admin Country:US
Admin Phone:+1.9174143650
Admin Phone Ext:
Admin Fax: +1.9174143650
Admin Fax Ext:
Admin Email:deadprogrammer
Tech ID:25f9e741a3047a00
Tech Name:Michael Krakovskiy
Tech Organization:Third Ingredient Consulting
Tech Street: 1612 Kings Highway
Tech Street: 96
Tech City:Brooklyn
Tech State/Province:NY
Tech Postal Code:11229
Tech Country:US
Tech Phone:+1.9174143650
Tech Phone Ext:
Tech Fax: +1.9174143650
Tech Fax Ext:
Tech Email:deadprogrammer
Name Server:DNS1.REGISTRAR-SERVERS.COM
Name Server:DNS2.REGISTRAR-SERVERS.COM
Name Server:DNS3.REGISTRAR-SERVERS.COM
Name Server:DNS4.REGISTRAR-SERVERS.COM
Name Server:DNS5.REGISTRAR-SERVERS.COM
Name Server:
Name Server:
Name Server:
Name Server:
Name Server:
Name Server:
Name Server:
Name Server:
DNSSEC:Unsigned
Access to Public Interest Registry WHOIS information is provided to assist persons in determining the contents of a domain name registration record in the Public Interest Registry registry database. The data in this record is provided by Public Interest Registry for informational purposes only, and Public Interest Registry does not guarantee its accuracy. This service is intended only for query-based access. You agree that you will use this data only for lawful purposes and that, under no circumstances will you use this data to(a) allow, enable, or otherwise support the transmission by e-mail, telephone, or facsimile of mass unsolicited, commercial advertising or solicitations to entities other than the data recipient's own existing customers; or (b) enable high volume, automated, electronic processes that send queries or data to the systems of Registry Operator, a Registrar, or Afilias except as reasonably necessary to register domain names or modify existing registrations. All rights reserved. Public Interest Registry reserves the right to modify these terms at any time. By submitting this query, you agree to abide by this policy. For more information on Whois status codes, please visit https://www.icann.org/resources/pages/epp-status-codes-2014-06-16-en.
网站头文件(HTTP Header)
HTTP/1.1 301 永久重定向 服务器:nginx/1.0.15 访问时间:2015年05月21日 06:38:05 类型:text/html; charset=UTF-8 Transfer-Encoding: chunked 连接:keep-alive 语言环境:PHP/5.5.16 X-Pingback: http://www.techinterview.org/xmlrpc.php 目标网址:http://www.techinterview.org/ HTTP/1.1 200 OK 服务器:nginx/1.0.15 访问时间:2015年05月21日 06:38:05 类型:text/html; charset=UTF-8 Transfer-Encoding: chunked 连接:keep-alive 语言环境:PHP/5.5.16 X-Pingback: http://www.techinterview.org/xmlrpc.php 设置Cookie:PHPSESSID=eqvlsaj3fm50fahfc5fvtl6o44; path=/ 过期时间:1981年11月19日 16:52:00 缓存控制:no-store, 不缓存,必须更新, post-check=0, pre-check=0 其他指令:不缓存 Content-Encoding: gzip 网站编码:UTF-8
同IP网站(同服务器)
其他后缀域名
网站首页快照(纯文字版)
抓取时间:2015年05月21日 06:31:17
网址:http://techinterview.org/
标题:Tech Interview | A site for technical interview questions, b
关键字:
描述:Welcome to techInterview, a site for technical interview questions, brain teasers, puzzles, quizzles (whatever the heck those are) and other things that make you think!
主体:
网址:http://techinterview.org/
标题:Tech Interview | A site for technical interview questions, b
关键字:
描述:Welcome to techInterview, a site for technical interview questions, brain teasers, puzzles, quizzles (whatever the heck those are) and other things that make you think!
主体:
Tech Interview Search for: MenuGames Bookstore Building a Stack with a getMax() functionGetting a fair result with an unfair coinStoring 1 million phone numbersReverse a String100 Doors in a RowRed Marbles, Blue MarblesBumblebeeint atoi( char* pStr )Daughters’ Ages Building a Stack with a getMax() function Suppose you had a Stack class. Write a new class MaxStack which, in addition to push() and pop(), has a method getMax() which returns the largest item in the stack. Use your existing Stack class to store the stack’s contents. Don’t just use pop() to “dig” through your stack to find the max—do something that lets you return the max in constant time. Solution We could have an instance variable where we hold the max, but there’s a problem—when we pop that item from our stack it’s no longer the max. Now we have to “dig” through our stack to find the new max. Ideally we’d keep track of the current max as well as what the new max will be when that max is popped. The trick is to have two instances of Stack inside our MaxStack. One holds the actual stack contents, while the other (call it maxesStack) holds the maxes. Whenever we push() an item, if it’s larger than the top item in maxesStack, we also push it to maxesStack. Whenever we pop() an item, if it’s the same as the top item in maxesStack(), we also pop() it from maxesStack. So at any given point we can get the overall max in constant time be peeking at the top item in maxesStack. Getting a fair result with an unfair coin How can you get a fair coin toss if someone hands you a coin that is weighted to come up heads more often than tails? We are NY Tech asks: “How many unique areas of human knowledge have the right size of passionate users to make it as a Stack Exchange site?” Answer: 30,000. Storing 1 million phone numbers What is the most efficient way, memory-wise, to store 1 million phone numbers? Apparently this is an interview question at Google, although this seems like its a bit too easy. Reverse a String A typical programming interview question is “reverse a string, in place”. if you understand pointers, the solution is simple. even if you don’t, it can be accomplished using array indices. i usually ask candidates this question first, so they get the algorithm in their head. then i play dirty by asking them to reverse the … Read More 100 Doors in a Row Problem: you have 100 doors in a row that are all initially closed. you make 100 passes by the doors starting with the first door every time. the first time through you visit every door and toggle the door (if the door is closed, you open it, if its open, you close it). the second … Read More Red Marbles, Blue Marbles Problem: you have two jars, 50 red marbles, 50 blue marbles. you need to place all the marbles into the jars such that when you blindly pick one marble out of one jar, you maximize the chances that it will be red. (when picking, you’ll first randomly pick a jar, and then
最近查询网站