« first day (822 days earlier)      last day (4182 days later) » 

3:57 PM
Alex Miller on December 03, 2012

Welcome to Stack Exchange podcast #38 with Joel, Jay, David, and new special guest Will Cole, PM on the Careers team.  We’re doing a deep dive into Careers today, as we have the launch of Careers in German coming up!

Stack Overflow Careers 2.0 is launching in Germany! (Much has happened since the last time we talked about Careers 2.0 on the podcast.)

So Will, tell us about Careers 2.0! Will gives us an overview about what it is and why it’s awesome. It has two products: job listings and CV search. They are both neato. …

 
 
7 hours later…
user55340
10:30 PM
Ohh! Palindromic question count. 22122. And only 100 away from the next one that is also only makes use of a single digit.
 
user55340
That, and its too quiet in here.
 
Do you know Dijkstra's Shortest Path Algorithm?
 
user55340
10:57 PM
@JimmyHoffa If I refreshed my mind on it, I could explain it.
 
11:32 PM
My few attempts at reading up on it, it looked simple but the explanations were always really complex and confusing. That said I think I finally get it if it solves one of the questions asked on Friday.

Is this it?
8
2 10
7 5 7 20
3 4 -> 3 13 -> 3 -> 23
4 9 4 19
6 15
3
haha that did not work. it optimized away all my extra spaces.
 
11:44 PM
I think I get it now. neat.
It was my first guess to solve this question:
5
Q: algorithm for project euler problem no 18

Valentino RuProblem number 18 from Project Euler's site is as follows: By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23. 3 7 4 2 4 6 8 5 9 3 That is, 3 + 7 + 4 + 9 = 23. Find the maximum total from top to bottom of th...

 
user20683
@jimmy-hoffa I figured it was something like that
 
But when I thought up to do it, I didn't recognize the technique or know how to use it so threw it out and started looking at other approaches
goes back to the importance of recognition I suppose
 
user20683
yeah
 
I was recognizing it as a fold from haskell but didn't know how it helped me heh
Am I correct to believe it has O(n) runtime?
 
user20683
you are
 
user20683
11:59 PM
MST's run in O(n) typically
 

« first day (822 days earlier)      last day (4182 days later) »