hacker news who's hiring october 2017

Introduction：

1、Analyzing Hacker News with Cohere

2、An October bounce, React extends its streak

Analyzing Hacker News with Cohere ♂

　　titleurltextdeadbyscoretimetimestamptypeidparentdescendantsrankingdeleted0I’m a software engineer going blind, how should I prepare?NaNI'm a 24 y/o full stack engineer (I know some of you are rolling your eyes right now, just highlighting that I have experience on frontend apps as well as backend architecture). I've been working professionally for ~7 years building mostly javascript projects but also some PHP. Two years ago I was diagnosed with a condition called "Usher's Syndrome" - characterized by hearing loss, balance issues, and progressive vision loss.

I know there are blind software engineers out there. My main questions are:

- Are there blind frontend engineers?

- What kinds of software engineering lend themselves to someone with limited vision? Backend only?

- Besides a screen reader, what are some of the best tools for building software with limited vision?

- Does your company employ blind engineers? How well does it work? What kind of engineer are they?

I'm really trying to get ahead of this thing and prepare myself as my vision is degrading rather quickly. I'm not sure what I can do if I can't do SE as I don't have any formal education in anything. I've worked really hard to get to where I am and don't want it to go to waste.

Thank you for any input, and stay safe out there!

Edit:

Thank you all for your links, suggestions, and moral support, I really appreciate it. Since my diagnosis I've slowly developed a crippling anxiety centered around a feeling that I need to figure out the rest of my life before it's too late. I know I shouldn't think this way but it is hard not to. I'm very independent and I feel a pressure to "show up." I will look into these opportunities mentioned and try to get in touch with some more members of the blind engineering community.NaNzachrip3270020-04-19 21:33:46+00:00story22918980NaN473.0NaNNaN1Am I the longest-serving programmer – 57 years and counting?NaNIn May of 1963, I started my first full-time job as a computer programmer for Mitchell Engineering Company, a supplier of steel buildings. At Mitchell, I developed programs in Fortran II on an IBM 1620 mostly to improve the efficiency of order processing and fulfillment. Since then, all my jobs for the past 57 years have involved computer programming. I am now a data scientist developing cloud-based big data fraud detection algorithms using machine learning and other advanced analytical technologies. Along the way, I earned a Master’s in Operations Research and a Master’s in Management Science, studied artificial intelligence for 3 years in a Ph.D. program for engineering, and just two years ago I received Graduate Certificates in Big Data Analytics from the schools of business and computer science at a local university (FAU). In addition, I currently hold the designation of Certified Analytics Professional (CAP). At 74, I still have no plans to retire or to stop programming.NaNgenedangelo2634020-05-31 01:53:44+00:00story23366546NaN531.0NaNNaN2Is S3 down?NaNI'm getting

{

　　"errorCode" : "InternalError"

An October bounce, React extends its streak ♂

　　Postings in October's "Ask HN: Who is Hiring" thread

　　were up over 12% from September as fall hiring kicked into high gear.

　　In fact, this was the 2nd highest posting month of all time, behind

　　only this past Februrary. In previous years, November usually surpasses

　　October, so it will be worth watching next week to see if hiring can

　　remain hot.

　　React took the top spot for the fifth straight month, approaching 25%

　　of all postings and opening up a larger lead over Python. The top 10

　　only saw a little shuffling with Node.js re-entering the Top 5 for the

　　first time since January and Docker sliding down to #13. Ruby swapped

　　with Docker with a jump to #10.

　　Programming Languages

　　Compare JavaScript, Python, Ruby and Java

　　Compare C++, Scala, Clojure and Go

　　Server-side Frameworks

　　Compare Rails, Node.js, PHP and Django

　　JavaScript Frameworks

　　Compare React, Angular 2, AngularJS and Vue.js

　　SQL Databases

　　Compare Postgresql, MySQL, SQL Server and Oracle

　　NoSQL Databases

　　Compare Mongodb, Elasticsearch, Cassandra and Riak

　　Big Data

　　Compare Storm, Hadoop and Spark

　　Messaging

　　Compare Kafka, RabbitMQ and ActiveMQ

　　DevOps Tools

　　Compare Chef, Puppet, Ansible and the DevOps term itself

　　Virtualization and Container Tools

Related questions

To solve the problem of finding the maximum sum of a contiguous subarray allowing at most one deletion, we can use a dynamic programming approach to efficiently track two states: the maximum sum without any deletions and the maximum sum with exactly one deletion. This ensures an optimal solution with linear time complexity.

Approach

1. Dynamic Programming States:

   • max_no_delete: Tracks the maximum sum of a subarray ending at the current position without any deletions.
   • max_one_delete: Tracks the maximum sum of a subarray ending at the current position with exactly one deletion.

2. State Transitions:

   • For max_no_delete, the maximum sum is either the current element itself or the sum of the current element and the maximum sum ending at the previous position without any deletions.
   • For max_one_delete, the maximum sum is either the sum obtained by deleting the current element (taking the maximum sum without deletion up to the previous position) or adding the current element to the maximum sum with one deletion up to the previous position.

3. Edge Cases:

   • Handle arrays with all negative numbers by ensuring the result is the maximum element.
   • Handle single-element arrays correctly by returning the element itself.

Solution Code

def max_sum_with_one_deletion(arr):

    if not arr:

        return 0

    max_no_delete = arr[0]

    max_one_delete = float('-inf')

    max_sum = arr[0]

    

    for i in range(1, len(arr)):

        current = arr[i]

        new_max_no_delete = max(current, max_no_delete + current)

        new_max_one_delete = max(max_no_delete, max_one_delete + current)

        max_no_delete, max_one_delete = new_max_no_delete, new_max_one_delete

        current_max = max(max_no_delete, max_one_delete)

        if current_max > max_sum:

            max_sum = current_max

    

    return max_sum



# Example usage:

# arr = [1, -2, 3, 4]

# print(max_sum_with_one_deletion(arr))  # Output: 8

Explanation

• Initialization: Start with the first element as max_no_delete and initialize max_one_delete to negative infinity to handle cases where deletion is not possible initially.
• Iterate through the array: For each element, update the two states based on the transitions described. Track the maximum sum encountered so far.
• Result: The maximum value between the two states at each step gives the desired result.

This approach efficiently computes the solution in O(n) time with O(1) additional space, making it suitable for large input sizes typical in competitive programming challenges.