skysight-inc/HackerNews huggingface dataset:
What did you exactly prove during this interview?
That you know to write readable code?
That you are know to code in team?
Did you write any test case during this inteview?
Any docs?
If you drop DNA patents would you recommend it be covered by copyright? Tough if there is bothing preventing direct copying.
If Digital means Digital Equipment Corporation, there was a biography of Ken Olsen that came out years ago, The Ultimate Entrepreneur. (I've never read it.) There is a badly formatted interview with Gordon Bell at http://americanhistory.si.edu/comphist/bell.htm, which has a lot about DEC in it.
When you ask a "what is better" question, you have to provide your personal metrics : money, happiness, mobility, weekly hours, technical challenge, industry, purpose, etc. An universal "better" does not really exist.
I do not think an "update" is needed. All of the functionality for a room bug is in all baseband processors: control of alerting on an offering call, control over LEDs and display lighting (or telling an application processor about an offering call), connecting, speakerphone, etc. All that is needed is knowledge of what is probably an extension of the GSM call control messages, and the ability to inject that message into the telephone network.
Both ?... litigate knowledgeably in software-related cases?
The article seems to imply that the turtle and hare algorithm is only valid solution for this problem, which is certainly not the case.

This problem can be also solved by building big set of already seen list nodes or adding bit to list nodes themselves. Whis is both something that everybody should be able to come up with and implement.

I think that this is in fact quite good interview question because while there is one non-obvious perfect answer, it also has some sub-optimal solutions that are pretty obvious and simple to implement.
List of GitHub lists
And $25 to revoke. Miskey the CN? Cough it up. A bug in openSSL gets your private key owned? Pay up. Want a different type of cert for the same domain? Pay the man.
The "Winning Probabilities" chart is calculated "starting from the round of 16". But the "chance-to-reach/chance-of-knockout" graphs below seem to have been calculated at an earlier time - it shows the probability of reaching the round of 16 as less than 1 for each team.

I think the US lost their last group match, but Belgium won theirs, so maybe something like shifted the model probabilities between the time of the 2 graphs.
> manage certificate passwords and enter them whenever you (re)start a web frontend

People do this? First I've ever heard of it. In fact most of the software I've ever used doesn't even support PKI passwords and instead will just tell you the certificate store is corrupted.
I remember at the peak of the Steve Jobs dynasty, I noticed several classmates who would try and act just like him while speaking in front of people (black sweaters and all), and they started being complete jerks to people who didn't have the same perceived creativity or vision that they had. They thought if they acted in the ways Jobs was famour for, maybe they'd inherit his brilliance...
This is not storing information. You'll just send some BTC to some address. The address is the information.
I've used stow to manage installs under /use/local before, which seems like a slightly easier approach. It does something similar but manages the install as a series of symlinks from /usr/local/bin to /usr/local/stow/<packagename>/bin.

It's pretty easy to setup and works the same on any distro.
Come on over for a drink
"it is a O(N) time complexity sort in all cases"

The OS needs to pick which thread to run from a pool of N threads - absolute best case an O(log N) operation, either when the thread is queued or when it's being selected. This happens N times, so the runtime seems like it would actually scale as O(N log N).

On the other hand, if you've got a scheduler that can pick the thread with the smallest sleep time from a list in O(1) time, you could just use whatever algorithm that's using to make an O(N) insertion sort...
Sure! With what?
This post literally does not make any sense.
Didn't think I needed to! Seemed self-evident enough. How's this:

Java is a high-level language designed for heavy usage of dynamic allocation and related features (like GC). Remote controls, being very simple devices that benefit strongly from low power consumption, tend to be designed with low-resource microcontrollers. These devices are not generally capable of managing the entire java feature set. Therefore, to use java on a remote control, you must either use an unnecessarily complex microcontroller, or a crippled subset of Java, in which case you might as well use C or something.
I think an unreasonable question (ie, of a practical situation in which no one will ever find themselves) deserves an equally unreasonable answer:

Write a program that starts at the head of the list and in a loop follows the "next" pointer on the current list entry, halting when the pointer is null. Run the program and wait. If the program never ends, there's a cycle in the list.
About the community reaction, I can really recommend this video:

https://fosdem.org/2014/schedule/event/gnome3_outreach/

It clarifies a lot of thing and is a bit of a post-mortem of all major switches that Gnome has ever done from a community perspective.
#HamOnt Wins: Innovation Night Summer Showdown
For people who know about it, yes. But probably the biggest win from pulling it into core is that, here on in, a newbie will be told to get migrating stuff from the first tutorial they do, and thus get working with this particular best practice up front. Yes, it's always been pretty hard to do django for more than 5 minutes without finding someone urging you to use South, but you never know...
The cheapest wildcard certificate on that page is $94.
Or until said player is not turned away from the match, which would have changed at least 15minutes' worth of it.
> In this case, the generally “correct” answer is a tortoise-and-hare algorithm, where you have two pointers at the head of your linked list, one traverses the list two nodes at a time, and one traverses the list one node at a time; if ever the pointers point to the same node, you have a cycle somewhere.

I'm an extreme novice to programming. I don't fully understand this.

1) How can you traverse a linked list two nodes at a time? Is this just short-hand for "go to the next node, then go to the node after that, and call that one operation"?

2) If you can detect when two pointers are pointing to the same address, couldn't you solve the problem by traversing the list one node at a time, storing the addresses of each node in an array, and checking to see if the array contains any duplicate values at intervals?
I with Django would add the south project to their core. It seems like an enormous oversight that you can't change data models after you sync them to the DB for the first time without deleting all the data or using a 3rd party app (south).

EDIT: I need to read things more carefully. My bad. Good job Django.
Actually, when you're working at Facebook scale, the range is quite small. One of the reasons Facebook started moving to IPv6 was that they were running out of RFC1918 addresses.
Links to the release notes in the article are broken for me, these seem to work:

https://download.gnome.org/core/3.13/3.13.3/NEWS

https://download.gnome.org/apps/3.13/3.13.3/NEWS
The problem is that they meet (if at all) before the final, so the probabilities of Germany go down very fast if you assume they will lose against Brazil more probably.
It's a bad question if you expect a quick, explicit answer. It's somewhat less bad if you're looking to have a conversation about how to solve problems the candidate hasn't seen before.

I've used an arguably "puzzle" question that was presented to me in an interview with some success -- the missionaries and cannibals problem. There are three missionaries and three cannibals that you must get across a river. The boat holds only you and one other person. The cannibals on either bank must never outnumber the missionaries on that bank. It's a good question to see if a candidate understands how to apply some basic computer science concepts. It can easily lead to a 30 minute discussion at the white board, with no need to get working code.

My favorite question is completely different. "What do you like best about your favorite programming language and what would you change about it if you could?" Anyone who doesn't see any flaws in their favorite language, particularly if it's Java, gets politely shown the door.
They made an update for an IE-on-XP bug, probably because IE is an important brand for them right now and they didn't want a disaster in they news with IE all over it, even if it was an "unsupported" version.
What happened to the pkgr.io name/domain? Was it too hip after all?
SQLAlchemy is designed for people who know SQL already and want a safe and convenient way to use it from Python.

The Django ORM is designed for people that want their Python data objects to be persisted to a back-end data store.

Both of these things have their place. The problem with the Django ORM is sometimes you need to do something slightly more complicated than what it supports and your back to raw SQL. These scenarios are really common, 90% of Django project have raw SQL in them.
Yeah - the article built it up and built it up, but when the question finally came up my thought was "wait, that's it?!"

If the interviewer asked the question and rejected anyone that didn't immediately answer with the tortoise/hare approach that's the fault of the interviewer, not the question.
Rarely. They want it to get through the European statutory warranty and that is it.

I have an oscilloscope built in 1976 by HP and it's showing no sign of any problems yet. I'd like to see more stuff like that on the shelves.
I used to have a math puzzler that I'd ask. Almost nobody got it right. One guy got close, and we ultimately hired him. He asked for the full answer, and I gave it to him. He told me I was wrong. I pointed out that I had asked this question at least 50 times, and knew it in and out, and that he should reconsider. Then he sent me a spreadsheet proving that I was wrong. Whoops.
Belgium probably has a better chance to beat the last two teams given that they make it to the quarterfinals. The US might have a better chance of getting to the quarterfinals but a high chance of being knocked out after that.
That is one of the big things Django 1.7. "There's a new built-in schema-migration framework."
One thing that still bothers me about Adwaita is the huge amounts of blank/white space around some widgets like list items and enormous padding on buttons. I wish for a way to easily customize this.
I still have the one I got for high school chemistry.

A bit of trivia: slide rules survived into the 1980s and maybe beyond as "proportion wheels" used by graphic artists to calculate the reductions needed on images. I'm sure that most of these folks had no idea that these were essentially circular slide rules.
Eliminating the major tornado threat in Tornado Alley
>sort of questions you can prepare for.

The point is why do you need to prepare for and regurgitate these silly answers that you will almost assuredly never ever ever use in your day to day job?
1) One loop, two pointers. Each iteration increments each pointer by a different margin.

2) Yes you can do this but not in all languages.
As others noted you can't know how many elements there are supposed to be in the list. But you can guesstimate.

1. Take a guess about how much memory the program has allocated so far. If you can't, go with 2^48 = 281474976710656 bytes - the maximum you can do on a 64bit pc today.

2. Divide by the minimum size of a list entry.

3. Traverse the list until the end or until you traverse more elements than there ever could be.

In general though, as noted, you'll know if you're making a list that could possibly contain cycles due to exposing an interface that allows the creation of cycles. In that case, given that you want to be able to efficiently detect cycles, you'd make a special linked list implementation that does keep internal count of its size.
Migrations are one of the major additions with this release, and I believe it's based on South in some way.
The "tortoise" pointer does a standard traversal - one at a time. The "hare" pointer goes from one node to the next _and then the next_ - i.e. two at a time. If the hare hits a null node, there's no loop. If the hare hits a cycle, it will eventually run back into the tortoise and there's a loop.
If that's the result of the ruling then it was fairly pointless. That's the same as saying that leaving your front door unlocked means the police do not require a warrant to enter and search.

You could leave the door wide open and the police cannot enter under normal circumstances. If accessing a phone requires a warrant then it would seem the same standard applies.
Two clicks? I don't even have time for one click! The thing is, in the front-end world, people really can't afford to spider the website of every new framework that comes out. I don't call that "lazy"; I call it having a limited amount of time to allocate to researching cutting edge stuff.

A few inline fragments to contrast with Backbone would be super helpful.
A self-signed certificate still has the revocation problem, though.
That's true, however that was because the component they were updating also happened to exist on operating systems they are still currently supporting.

I doubt you'll see too many more XP security updates, that literally might be the last official one (unless you count packages which aren't intrinsically linked to the OS, like the .Net framework for one example).
Actually, have you had a chance to read this: https://docs.djangoproject.com/en/dev/releases/1.7/#schema-m...
Why do you think those schemes don't make a lot of sense?
With regards to (2), this is one way of solving the problem. However, your solution uses O(n) memory (where n is the size of the linked list), and the tortoise-and-hare algorithm uses only O(1) memory. Here's how it works: http://en.wikipedia.org/wiki/Cycle_detection#Tortoise_and_ha...
You could make the agents self-employed on a bounty basis rather like the old Lloyd's Names

http://moneyweek.com/how-to-become-a-lloyds-name-42723/

However, the inevitable Black Swann event caused changes even in that very high risk system...

"Historically, Names had unlimited liability to the risks they were underwriting. In the late 1980s/early 1990s, Lloyd’s entered the most traumatic time in its history. Unexpectedly large legal awards in US courts on asbestos, pollution and health hazard policies (APH) served up huge losses to many Names, a large number of whom lost their shirts. Names’ numbers dropped from over 30,000 to below 10,000."

I think just giving patent examiners enough time and resources to actually verify the claims would probably cut down a lot of the problem. That and a specialised court like

http://www.justice.gov.uk/courts/rcj-rolls-building/patents-...

instead of a general purpose district court sitting with a lay jury
We should really work towards eliminating the need for CAs (or any central authority for that matter).

http://convergence.io/ is (was?) a great idea and technical implementation of it, I installed two notaries on two different servers I own, and it worked great. It seems dead now. Don't know why.
You're right, though I think he's talking about the weird type of interviewer who expects candidates to know obscure, non-intuitive optimal solutions to these problems.

I once met an interviewer who liked to use the "reverse a string" question, except he was expecting candidates to know the XOR trick. Suffice to say few, if anyone, ever got past his "filter".

Primadonna interviewers who use interviews as ego-strokes are a problem in our industry. It's where the stupid "why are manhole covers round" questions came from, and it's where these hyper-optimized algorithms questions come from.
Is it just me or does OS X Yosemite's new header bars look surprisingly familiar?
Glad you remember it ;) I figured it would be an easier name to remember (and use in writing).
Yo+Tinder=Yoder
It doesn't change the fact that they basically took a dump on people's heads for daring to dislike being forced into a radical interface change.
I upvoted it on the odd hope that one of my coworkers sees it and actually considers following some of it. ;)
This was my first thought about how to solve it. It provably works in finite time. This ought to be a satisfactory answer in an interview, particularly if the candidate points out that it's unlikely to be The Optimal Solution. After which point, the appropriate follow-up question from the interviewers would be to ask what the time complexity of the algorithm would be in the worst case.
Here are some ideas:

-QUANTUMINSERT -> SS7

-CANDYMAN -> GOPHERSET

-WAP push

-Vuln. via specially-crafted SMS/MMS

-APN update
1) yes.
2) is ok (with a hash table instead of an array to have linear execution time), but doesn't run in constant space unlike 1), or you could mark the nodes when you visit them.
Passive monitoring? Sure. Impossible to detect active monitoring? Also yes.

There are literally governments which have used a fake certificate to monitor SSL connections. It wasn't detected for quite a few months.
Wow, thanks for that....what a terrible UI presentation.
+1 to this. The objective is not to see the person solve the question immediately, but to observe their problem solving process.
>_<'
If I remember correctly, this book not only goes into technical details (skim the TOC in the Internet Archive's copy), but included higher level stuff, particularly a superb and universally useful insight into what distinguished the successful '70s minicomputer vendors: they all did an adequate job of everything essential, from hardware to documentation. E.g. I don't think anyone every bought a DEC computer for the quality and/or price/performance of their disk drives (the RK-05 might be an exception), but their disk offerings were at least adequate (modulo a few goofs when they made their own, long after this book was published).

Computer Engineering: A DEC View of Hardware Systems Design by C. Gordon Bell, J. Craig Mudge, John E. McNamara, and Kenneth H. Olson

(If you're not familiar with the first and last authors, your study of DEC history should fill you in, as cafard notes elsewhere in this thread.)

http://www.amazon.com/Computer-Engineering-Hardware-Systems-...

https://archive.org/details/ComputerEngineeringADecViewOfHar...
Or, you know, the government. Any critical infrastructure should be publicly owned.
Very good resources link. Thank you for sharing and keeping this thread alive on top. But all of them are not integrated to sort of interoperate leveraging each other's resources.
Is there any project that integrates these different projects? Is there sufficient interest in the group to use sort of selected items as distro?
Are there any takers for such an initiative? May be just focusing on Management and monitoring part to start with?
Ask HN: Good way to recognize and reward team members?
I am a product manager in a startup and we are about to release our MVP. Our team has worked hard and I want to recognize some individuals that worked hard to get it out on schedule. For obvious reasons I need to keep it simple & cheap but also want to make it something that our guys would take pride in receiving. The only thing that comes to mind are stickers like those seen on helmets that college football teams give to players that made big contributions. I know Ohio State & Florida State are two examples the come to mind. I would love any suggestions you all have.

Edit: Would love to give raises and days off but given 1) we are in a startup and 2) I am their peer not their boss, neither of those are options at the moment. Also, I should have added this to my original question, I have tried to be steadfast with my verbal encouragement & praise as we have been picking up momentum. Therefore I was looking for anything that would be meaningful in addition to that.
Telecharger
Telecharger les derniers Films,jeux,logiciels,musique,e-books, series, en telechargement direct et rapide avec des hebergeurs gratuit sans attendre ............
Even though we know that national intelligence agencies are coordinating with, at least, national LEAs, the smaller fights are important too. Fighting the encroachment is important at all levels, even when the starting position is bad to begin with.
I had the same issue. There is another solution for postgres.

Install postgresql-common first. Edit /etc/postresql-common/createcluster.conf to disable creation of the cluster on install (or change the options used to create the cluster) and then install postgresql-x.y
Fighter jet loses front landing gear, lands vertically on padded stool
Ask HN: Best book or material for a newbie to RDBMSs?
I'm about to start teaching a course on data warehousing (dimensional modeling) with a textbook that presumes prior knowledge of relational databases and SQL. I've been using SQL since the 1990s so it's hard for me to remember the way new learners approach it. Can anyone recommend a good, cheap book or other material (online tutorial?) that could get someone up to speed on ER diagrams, SQL, and basic normalization, without lots of chapters on requirements gathering, project management, etc? I'm looking for something brief to supplement the course, not to replace the dimensional modeling textbook.
THis will be funny if they continue the standard of closing everything based on "too subjective".
Q&A With Mt. Gox’s Karpelès: What Went Wrong?
no, they arent a solution, but they arent a problem either. think ssh/know_hosts - file.

convergence might have been an interesting approach, but i did not heard much of it lately http://convergence.io/
but now anyone who's watched Fargo (tv) will be able to work it out
Seriously.

They even made a t-shirt[1] punning on it.

[1] http://teespring.com/django17-v2
It absolutely does protect you from MitM. Does it offer full proof protection? No. But it adds a barrier between you and being trivially hit with a MitM.

To use an analogy: One could make the statement that a kevlar vest doesn't protect you from bullets, then cite an example when a military grade round went through one and killed a cop. However this statement would be equally misleading to yours, as we all know a kevlar vest is better than nothing and that it will stop a typical street bullet (e.g. handgun round).
again?!

This is wikipedia mobile with a new typo isn't it?

http://en.m.wikipedia.org/wiki/Hacker_news
The Case for Message Passing in Swift
It's best practices, not new practices, and a very clear concise write up at that. I wish if read this 6 months ago, rather than learning it the hard way.
Hey big congratulations on getting your app released!

Looks really clean & minimalistic which user's love! I'm working on a similar app for achieving your goals, setting rewards & basically motivating you to success. I'm even using the app myself.. I would love to share ideas with you, maybe even a partnership of some sort.

Please contact me at joeytawadrous@gmail.com if you would like that.

Strive: https://itunes.apple.com/app/id877308957
Yea that's fair enough. This is an initial release so I'm sure they are reading these comments and working to improve their site/docs/etc.

You're right that it's basically for Backbone users:

> We <3 Backbone.js at &yet. It’s brilliantly simple and solves many common problems in developing clientside applications.

> But we missed the focused simplicity of tiny modules in node-land.

Read as: "This is like Backbone.js (almost a forked Backbone.js) but better." (better from some perspective, at least)