Katkat

Company

New Relic interview questions

3 practice questions in the style of New Relic's interviews, covering Coding & Algorithms, System Design.

Questions3

0 easy3 medium0 hard

Your progress0/3

New Relic interview questions by the numbers

Last updated

Katkat has 3 New Relic interview questions. The largest topics are Coding & Algorithms (67%) and System Design (33%). By difficulty: 100% medium. The most common round is Onsite (100%).

Topics

Difficulty

  • Medium100% · 3

Interview rounds

  • Onsite100% · 3

Roles

  • Backend Engineer100% · 3

Most mentioned in interview experiences

  1. 1.Compress a String by Run-Length Counts, Keeping the Original When Not Shorter1 report
  2. 2.Design a Kafka Consumer Service That Groups Trace Events by Trace ID1 report
  3. 3.Longest Strictly Increasing Path in a Grid with Four-Directional Moves1 report

Counted from 1 candidate interview experiences on Katkat. How we collect and count

Showing 1–3 of 3 results

  • Compress a String by Run-Length Counts, Keeping the Original When Not ShorterMedium

    Implement run-length string compression that replaces each run of repeated characters with the character and its count, returning the original string when the compressed form is not strictly shorter. Tests careful run handling, multi-digit counts, the tie rule, and complexity and edge-case discussion.

    New RelicBackend EngineerCoding & AlgorithmsOnsite
  • Design a Kafka Consumer Service That Groups Trace Events by Trace IDMedium

    Design a distributed service that consumes trace events from Kafka, groups every event sharing a trace ID, and hands each complete trace to an existing processing function. Covers partitioning, in-memory versus external state, deciding when a trace is complete, and traces that stay open for hours.

    New RelicBackend EngineerSystem DesignOnsite
  • Longest Strictly Increasing Path in a Grid with Four-Directional MovesMedium

    Given an integer matrix, find the number of cells on the longest path whose values strictly increase, moving only up, down, left, or right with no diagonal steps and no wrap-around at the edges. Tests grid search and the ability to turn a working first solution into an efficient one.

    New RelicBackend EngineerCoding & AlgorithmsOnsite

More companies