<p><p><b>Role Overview : </b></p><p><p><b><br/></b></p>The Code Reasoning / Code Benchmarks role involves designing algorithmically rich coding problems and evaluation systems that test reasoning, correctness, and performance.<br/><br/></p><p>You will develop robust code, clear technical specifications, and comprehensive test suites across areas like data structures, graph algorithms, and number theory.
The role requires strong software engineering skills, a deep understanding of algorithmic complexity, and experience with benchmarking or test automation.
Ideal candidates are detail-oriented, creative problem solvers with 5+ years of engineering experience.</p><p><br/></p><p><b>What does day-to-day look like : </b></p><p><p><b><br/></b></p>- Design algorithmically rich coding problems and systems that challenge reasoning, planning, and correctness in real-world software scenarios.<br/><br/></p><p>- Develop high-quality software solutions and comprehensive test suites, ensuring code robustness, correctness, and coverage across edge cases.<br/><br/></p><p>- Craft clear, unambiguous technical specifications and problem statements, balancing creativity and engineering precision.<br/><br/></p><p>- Ensure thorough coverage across algorithmic and systems domains, including classical data structures, performance engineering, mathematical logic, and constraint-based design.<br/><br/></p><p>- Apply structured metadata and documentation to development tasks, capturing taxonomy, difficulty, domain relevance, and reliability metrics.<br/><br/></p><p>- Participate in peer reviews and quality assurance processes to uphold rigorous engineering standards and system consistency.<br/><br/></p><p>- Deliver work in a maintainable, modular, and scalable format ready for production integration or downstream application : </b></p><p><b><br/></b></p>- 5+ years of experience in software engineering, algorithm design, or systems-level programming.<br/><br/></p><p>- Strong proficiency in TypeScript with at least 4+ years of experience.<br/><br/></p><p>- Proven ability to write clear, concise, and technically challenging algorithmic code.<br/><br/></p><p>- Strong understanding of algorithmic complexity, performance optimization, and computational constraints.<br/><br/></p><p>- Experience with test automation, benchmark creation, or complex systems evaluation is a strong plus.<br/><br/></p><p>- Familiarity with modern software data formats (e.g., JSON, YAML) and version-controlled of Expertise : </b> </p><p><br/></p><p>- Successful candidates will demonstrate deep fluency in at least four of the following areas : </p><p><br/></p>- Core Data Structures : Trie, Segment Tree, Union Find.<br/><br/></p><p>- Algorithmic Paradigms : Dynamic Programming, Greedy Algorithms, Bitmasking.<br/><br/></p><p>- Graph Algorithms : Shortest Paths, Network Flow, Topological Sorting.<br/><br/></p><p>- Mathematics & Number Theory : Geometry, Probability, Modular Arithmetic.<br/><br/></p><p>- String Processing : Suffix Trees, Rolling Hashing, Pattern Matching.<br/><br/></p><p>- Advanced Topics : 2-SAT, Fast Fourier Transform (FFT), Linear Programming.</p><br/></p> (ref:hirist.tech)