hacker news who's hiring february 2018

Introduction：

1、All Tokyo jobs from Hacker News 'Who is hiring？ (February 2018)' post

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

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

　　Nexedi | Lille/Munich/Paris/Tokyo | ONSITE | FULL TIME and 4-12 months INTERNS

　　We are looking for new colleagues to help improve our Free Software solutions. Our stack is Free Software only (see https://stack.nexedi.com/) and we use it for custom industrial implementations. We offer neither fame nor fortune - you just need to be idealistic and passionate about Free Software to apply (http://www.nexedi.com/jobs). Candidates will do a programming challenge and 1 interview (2 for full time). We're hiring for:

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

　　Compass | Many Roles - Sr. Engineers, Product Managers, Marketing & More | New York City | Full-time, Onsite | https://www.compass.com

　　Compass is rethinking how real estate should be done; we value strong engineering practices, great user experience and beautiful design.

　　We are 5 years old, $2.2B Valuation ($550M in Dec ’17), $350M revenue, in 10 major cities; top 5 brokerage in several of those; expanding to 10 more. Current Engineering, Design, Product team is about 100 and expecting to grow to 170 by 2019. Real estate has some truly interesting engineering challenges - please reach out!

　　Here are some open roles in Engineering (18 current openings):

　　* Sr. Backend Engineer - http://grnh.se/voijs81 (Golang, Java, Python, Microservices, MongoDB)

　　* Sr. Data Engineer, BI - http://grnh.se/jgvs6u1 (Redshift, Looker)

　　* Sr. Fullstack Engineer - http://grnh.se/xrnbpd1

　　* Sr. Backend Engineer - Data Engineering - http://grnh.se/voijs81 (Spark, EMR, PostgreSQL)

　　* DevOps Engineer - http://grnh.se/w6smiy1 (AWS, Kubernetes)

　　* Sr. Frontend Engineer - http://grnh.se/y7tn181 (React, Angular, Webpack)

　　* Solutions Architect - http://grnh.se/1ty27n1

　　* Engineering Manager - http://grnh.se/2iwvta1

　　* Geospacial Analyst - http://grnh.se/1pmjno1

　　* All Engineering Roles https://goo.gl/xyoMTk

　　* Product & Design / UX Jobs - https://goo.gl/dLBy7n

　　* Marketing Jobs - - https://goo.gl/K8ZS2i

　　We are also hiring for various roles in the different regions we are in - Marketing Associates, Product Experts, Legal, Recruiters, Sales, Finance, Business Development. These are in New York City, Boston, Chicago, Miami, Atlanta, Los Angeles, Dallas, Hamptons, San Diego, San Francisco, Washington DC, Westchester, Seattle.

Related questions

To prepare effectively for the HackerRank OpenText Engineering hiring test, follow this structured approach:

1. Core Topics to Focus On

• Data Structures: Arrays, Strings, Linked Lists, Trees, Graphs, Hash Tables, Heaps, Stacks/Queues.
• Algorithms: Sorting, Searching, Dynamic Programming, Greedy Algorithms, Recursion, Graph Algorithms (BFS/DFS/Dijkstra), Sliding Window, Two Pointers.
• Problem Types: Expect medium-difficulty problems focusing on optimization and efficient code.
• SQL: Joins, Aggregations, Subqueries, Window Functions (e.g., RANK(), DENSE_RANK()).

2. Practice Strategy

• Daily Practice: Solve 2-3 problems daily on HackerRank/LeetCode, covering:
  • Arrays: Rotate Array, Two Sum, Product of Array Except Self.
  • Strings: Longest Substring Without Repeating Characters, Palindromes, Anagrams.
  • Linked Lists: Cycle Detection, Reversal, Merging.
  • Trees: Traversals, LCA, Serialization.
  • Graphs: Number of Islands, Shortest Path.
  • DP: Coin Change, Longest Increasing Subsequence.
  • SQL: Department Top Salaries, Complex Joins.
• Mock Tests: Simulate timed tests (e.g., 60鈥?90 minutes for 2鈥?3 problems) to build speed and accuracy.

3. Key Concepts & Examples

• Dynamic Programming:
  • Coin Change: Use a DP array to track minimum coins for each amount.
  • Longest Common Subsequence: Build a 2D table to compare strings.
• Graphs:
  • Number of Islands: DFS/BFS to mark visited cells.
• Trees:
  • Validate BST: Check node ranges recursively.
• SQL:
  • Top N Salaries: Use DENSE_RANK() with PARTITION BY.

4. Pro Tips

• Edge Cases: Test for empty inputs, duplicates, large values.
• Optimization: Aim for optimal time/space complexity (e.g., O(n) time for array problems).
• Code Readability: Write clean code with meaningful variable names.

5. Sample Problems

1. Arrays: Rotate an array in O(1) space using reversals.
2. Strings: Find the longest palindromic substring using expanding windows.
3. Graphs: Clone a graph using BFS and a hash map for nodes.
4. SQL: Find employees earning more than their managers with self-joins.

6. Resources

• HackerRank: Practice in "Problem Solving" and "SQL" sections.
• LeetCode: Explore company-specific questions for OpenText.
• Books: "Cracking the Coding Interview" for patterns.

By methodically covering these areas, you'll be well-prepared to tackle the HackerRank test and advance in the OpenText hiring process. Good luck! 馃殌