Блог пользователя SuprDewd

Автор SuprDewd, 9 лет назад, По-английски

A couple of years ago Google launched an interesting website: Google Foobar. If you try to log in, you'll get an error saying:

To login, you have to have logged in before. Confused? Search on...

Pretty mysterious, right? Well, from what I read on Hacker News at the time, this is some kind of a puzzle set up by Google to recruit Python and Java developers. To get in, you'd simply have to search for the correct phrase. Someone reported that searching for "arraylist java" got him inside, but that didn't work for me.

However, I recently found that searching for this actually gets you inside, but you have to be a little bit patient. Here's what you can do:

  1. Open a browser of your choice (it has to be a sufficiently new version so you get the newest version of Google). I've only tested this successfully with Chrome and Firefox.

  2. Go to https://google.com/ncr. (The /ncr at the end is to make sure you go to the main version of Google. Don't know if that's necessary, but doesn't hurt)

  3. Search for "arraylist java" or "python list comprehension". Other programming-related search terms may also work, but these should definitely work.

  4. Here comes the "be a little bit patient" part. Copy the URL for the search results page that you just got (Ctrl+L, Ctrl+C). Now open a lot of tabs with the same URL (repeat Ctrl+T, Ctrl+V, Enter). I'm not sure how many tabs you need to open, but from my experience 10 tabs should be sufficient.

  5. Wait for each of the tabs to load. Then go through them, one by one, and look for a tab that contains a black banner saying "You're speaking our language. Up for a challenge?" at the top of the search results. (If you don't get any tab with this banner, try going back to step 1, possibly using a different browser.)

  6. Click "I want to play". You're in!

Now you will be presented with a terminal that you can use to solve some competitive programming-style problems using Java or Python. They start easy and become progressively harder, and each problem has a certain time frame you have to solve it within.

When you've progressed to the third or fourth level (don't remember which one), you get the opportunity to send your code to Google recruiters. From what I've read online, this has lead to some people getting an interview at Google. So if you're interested in that, this might be your chance! If not, it's still a bunch of fun problems to solve. :)

  • Проголосовать: нравится
  • +207
  • Проголосовать: не нравится

»
9 лет назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

But there is only terminal.

how to get to questions>

»
9 лет назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

How about C++ or other language ??

»
9 лет назад, скрыть # |
Rev. 2  
Проголосовать: нравится +5 Проголосовать: не нравится

~ Proceeds to learn Python ~

»
9 лет назад, скрыть # |
 
Проголосовать: нравится +7 Проголосовать: не нравится

it's not so tricky to get interviewed by google. They interview almost everyone. It's tricky to get hired by google.

»
9 лет назад, скрыть # |
Rev. 2  
Проголосовать: нравится +5 Проголосовать: не нравится

At the end of level 2 you get a referral link At the end of level 3 you get asked for contact information so a recruiter can contact you At the end of level 4 you get a second referral link At the end of level 5 you get an encrypted string that I still have no idea what it means, with a note "for your eyes only"

Proof: http://i.imgur.com/pFxzMlk.png

»
9 лет назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Doesn't seem to work for me, tried Firefox and Chrome :/

Do I have to be logged in?

»
9 лет назад, скрыть # |
 
Проголосовать: нравится +18 Проголосовать: не нравится

What happens if you don't solve the problem within the time window?

»
9 лет назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Nothing works for me — tried Firefox, Chrome, both queries too. Maybe that's because I have already applied there several times and Google knows everything?

»
9 лет назад, скрыть # |
Rev. 2  
Проголосовать: нравится 0 Проголосовать: не нравится

How to switch to editor? I'm pressing TAB + ESC + ENTER, but when pressing TAB, this comes to screen :

verify submit status request ls less help feedback edit deleteme cat cd

Thanks in advance.

I found how to do it, thanks anyway.

»
9 лет назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

I was able to open terminal also solved one problem. Till what time terminal would be accessible?

»
9 лет назад, скрыть # |
 
Проголосовать: нравится +5 Проголосовать: не нравится

Anyone getting "Error compiling the code, please try again later" (java) on the second round? It compiles on my local machine.

»
9 лет назад, скрыть # |
Rev. 2  
Проголосовать: нравится 0 Проголосовать: не нравится

Not sure if this is the most relevant place to discuss problems from it, but can someone who has solved grid zero(with an approximate/non-approximate solution) from level 5 give some hint to their approach? I read it long back but never figured anything out, some googling revealed that the problem is NP hard?

»
9 лет назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Getting error:-> Error compiling the code, please try again later. in java please help My solution is working on my machine and also on online editors such as codeforces custom input

»
9 лет назад, скрыть # |
Rev. 2  
Проголосовать: нравится +8 Проголосовать: не нравится

WOW it worked...

It felt so cool I thought I was hacking the pentagon or something...too bad I can't write in JAVA or python...

Good luck guys!!!

:)

»
9 лет назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

I'd like to discuss about the problem "Distract the guards", as I realize that my submitted AC code actually fails in a counter test case that I came up with during reviewing my code.

If anyone is interested please PM me, I'd like to hear some thoughts from others on that problem.

  • »
    »
    9 лет назад, скрыть # ^ |
     
    Проголосовать: нравится +5 Проголосовать: не нравится

    So,finally did you get an interview call (Or what was the response from google)??

    • »
      »
      »
      9 лет назад, скрыть # ^ |
      Rev. 2  
      Проголосовать: нравится +14 Проголосовать: не нравится

      I've got my interview call

      Edit: Quite a few people have wrote to me about my situation so I would just put it here, if you want some extra details you are always welcome to PM me. :)

      1. How long till you receive email from Google?

      Around two weeks later, a recruiter wrote to me and confirmed my intention of applying for an internship, and assured me that there will be a phone interview for the next internship recruitment cycle. (For the China region, this is around Jan on each year)

      1. Have you solved the levels afterwards? Were there any extra favours?

      Yes I have solved them afterwards but there was no follow-up email. As other's have mentioned what you will get is another invite link, an encryted message (it is encrypted slightly different for each user), and some feedback forms.

      1. Does this stack up with the APAC (or kickstart) test?

      So far there is no evidence supporting this, but I will update if I have found any traces throughout my pursuit next year.

»
9 лет назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Worked for me.. Currently on 4 level.

»
9 лет назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Did anyone come across a question on Level 4 that requires to plan the path in such a way that maximum number of nodes should be visited between the starting and ending node in the graph with the constraint being that this has to be done with total weight of the path less than or equal to a given limit, and the path has to end at the end (last) node?

For example, if the graph is [[0, 1, 1, 1, 1], [1, 0, 1, 1, 1], [1, 1, 0, 1, 1], [1, 1, 1, 0, 1], [1, 1, 1, 1, 0]] with the limit on weight of the path being 3, 0th node be the starting node, and 4th node be the ending node, the answer would be [1, 2], i.e. 1st node and 2nd node.

I tried using DFS recursively from starting node to get all the valid paths (within limit and ending at last node) and return the path with maximum nodes, but it is slow. Any resource or idea in this space would be appreciated?

»
9 лет назад, скрыть # |
Rev. 3  
Проголосовать: нравится 0 Проголосовать: не нравится

tgsdfgsdfv

»
6 лет назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

After log in with a referal, how much time I have before the referal get expired? Before sending a request command?

»
6 лет назад, скрыть # |
Rev. 2  
Проголосовать: нравится 0 Проголосовать: не нравится

Does Google still hire through Foobar? I wasn't able to find any new posts on this topic. So I'm just curious to know if this challenge is still active or not.

»
5 лет назад, скрыть # |
 
Проголосовать: нравится -25 Проголосовать: не нравится

I got an option to share my codes with recruiter after passing the third challenge of foobar..But I refreshed the page and it got lost..How can I get the option back?