hacker news who's hiring january 2018

Introduction：

1、The Hacker News ｜ #1 Trusted Cybersecurity News Site

2、All jobs from Hacker News 'Who is hiring？ (January 2018)' post

The Hacker News ｜ #1 Trusted Cybersecurity News Site ♂

　　Imagine receiving a penetration test report that leaves you with more questions than answers. Questions like, "Were all functionalities of the web app tested?" or " Were there any security issues that could have been identified during testing?" often go unresolved, raising concerns about the thoroughness of the security testing. This frustration is common among many security teams. Pentest reports, while crucial, frequently lack the depth and detail necessary to truly assess the success of the project. Even with years of experience working with cybersecurity teams and managing ethical hacking projects, we frequently encountered these same issues. Whether collaborating with external pentest providers or managing our own projects as founders of Hackrate , we often faced difficulties in ensuring that the testing was as comprehensive as it needed to be. This realization inspired us to create HackGATE , a managed gateway solution built to bring transparency and contro...

All jobs from Hacker News 'Who is hiring？ (January 2018)' post ♂

　　Head of Digital Product | NewsNow.co.uk | London, UK | Full-time, permanent Designer/Developer | NewsNow.co.uk | London, UK | Full-time, permanent Web Developers / Full Stack Developers / News Algorithm Developers / Back End Software Engineers | NewsNow.co.uk | 100% remote (UK residents only) | Full-time, permanent

　　We are a top ten UK media publisher, with a website loved by millions: a technology company at heart with industry-leading success metrics propelled by a highly experienced multi-disciplinary engineering team that can afford to run lean. Which means today, we offer all the excitement and agility of a start-up, but with the stability and benefits of an established business — we’re still a company where everyone gets to make a massive impact!

　　Our mission: to democratise and disrupt the market for news. Today, we have major plans for growth, both here in the UK and abroad, and to create even more social capital out of what has been an extremely successful platform: through increased editorial direction, curating credible but independent journalism, as well as through computational approaches to identifying the best news to show our users.

　　We currently have these opportunities:

　　- As a /Head of Digital Product/, you’ll take over from our CEO in keeping all our development efforts incredibly well organised and delivering the vision. You’ll grasp our strategic vision, consult with stakeholders to prioritise and specify desired developments, and co-ordinate the work of our agile development team to balance our editorial, development and commercial goals and deliver them with maximum efficiency.

　　- As a /Designer/Developer/, you’ll be responsible for designing all aspects of the website UI and brand, and work closely with Head of Digital Product and senior management on the biggest redesign of our homepage in 20 years. You will be working with Adobe Creative Suite, JavaScript, CSS3, SASS, HTML5, Responsive Web Design, progressive enhancement and feature detection.

　　- As a /Fully Remote Web Developer/, you’ll write the logic that drives the UI, and integrate new UI with back-end data. You’ll also work on a wide array of other UI/UX, SEO, and content integration challenges.

　　- As a /Fully Remote Full Stack Developer/, you’ll be expected to contribute authoritatively towards product development projects throughout the entire software stack: from database and infrastructure installation and configuration, through writing business logic and prototyping website presentation, to developing our bespoke programmatic advertising technologies.

　　- As a /Fully Remote News Algorithm Developer/, you’ll develop automated curation algorithms that will produce the content for a new homepage format.

　　- As a /Fully Remote Back End Software Engineer/, your projects will largely be server-side. You will bring a sophisticated approach to problem solving, finding ways to achieve objectives while addressing scalability challenges and security concerns.

　　All London positions are based at our centrally-located head office. All fully remote roles are open to UK residents only.

Related questions

To prepare effectively for the Soroco Hiring Challenge 2017 on HackerRank, focus on the following structured approach:

Key Topics to Cover

1. Data Structures

   • Arrays, Strings, Linked Lists
   • Stacks, Queues, Hash Tables
   • Trees (Binary, BST, Heaps), Graphs (Traversal, Shortest Paths)

2. Algorithms

   • Sorting & Searching: QuickSort, MergeSort, Binary Search
   • Dynamic Programming: Knapsack, LCS, Matrix Chain Multiplication
   • Greedy Algorithms: Activity Selection, Huffman Coding
   • Graph Algorithms: BFS/DFS, Dijkstra, Floyd-Warshall
   • String Manipulation: KMP, Palindrome Checks

3. Problem-Solving Techniques

   • Sliding Window, Two Pointers, Prefix Sums
   • Backtracking, Bit Manipulation, Combinatorics

Example Problems & Solutions

1. Longest Substring Without Repeating Characters

   • Approach: Sliding Window with Hash Set
   • Code:

     def longest_unique_substring(s):
     
         char_set = set()
     
         max_len = start = 0
     
         for end, char in enumerate(s):
     
             while char in char_set:
     
                 char_set.remove(s[start])
     
                 start += 1
     
             char_set.add(char)
     
             max_len = max(max_len, end - start + 1)
     
         return max_len
     
     

2. Maximum Square Submatrix of 1s

   • Approach: 2D Dynamic Programming
   • Code:

     def max_square(matrix):
     
         if not matrix: return 0
     
         rows, cols = len(matrix), len(matrix[0])
     
         dp = [[0]*cols for _ in range(rows)]
     
         max_size = 0
     
         for i in range(rows):
     
             for j in range(cols):
     
                 if matrix[i][j] == 1:
     
                     dp[i][j] = min(dp[i-1][j], dp[i][j-1], dp[i-1][j-1]) + 1 if i*j > 0 else 1
     
                     max_size = max(max_size, dp[i][j])
     
         return max_size  2
     
     

3. Validate BST

   • Approach: Recursion with Range Checks
   • Code:

     def is_valid_bst(root):
     
         def validate(node, low, high):
     
             if not node: return True
     
             if not (low < node.val < high): return False
     
             return validate(node.left, low, node.val) and validate(node.right, node.val, high)
     
         return validate(root, -float('inf'), float('inf'))
     
     

Preparation Strategy

• Practice Platforms: HackerRank, LeetCode (focus on Medium/Hard problems)
• Time Management: Simulate test conditions with timed sessions (30-45 mins/problem)
• Pattern Recognition: Identify common problem types (e.g., DP for optimization, BFS for shortest path)
• Edge Cases: Test solutions with small/large inputs, empty cases, and boundary values

By mastering these areas and practicing systematically, you'll enhance your problem-solving efficiency and readiness for the challenge.