Hudson River Trading Interview Questions — 9 DSA Problems

9 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Hudson River Trading LeetCode questions for software engineering interviews.

• Detect Pattern of Length M Repeated K or More Times (EASY) — Array, Enumeration
• Add Edges to Make Degrees of All Nodes Even (HARD) — Hash Table, Graph
• Longest Path With Different Adjacent Characters (HARD) — Array, String, Tree, Depth-First Search, Graph, Topological Sort
• Maximum Total Importance of Roads (MEDIUM) — Greedy, Graph, Sorting, Heap (Priority Queue)
• Convert Integer to the Sum of Two No-Zero Integers (EASY) — Math
• Number of Steps to Reduce a Number to Zero (EASY) — Math, Bit Manipulation
• Maximum 69 Number (EASY) — Math, Greedy
• Maximum Score From Grid Operations (HARD) — Array, Dynamic Programming, Matrix, Prefix Sum
• Remove Comments (MEDIUM) — Array, String