Katkat

practice a little every day, paws crossed ♡

Software Engineer II Interview Questions

Practice 9403 coding, system design and machine learning questions from 546 companies, sorted by role, topic and interview round. Every question has step-by-step hints, a code runner that supports 8 languages and an AI mentor; members also get the full solution walkthrough.

9403
Questions
546
Companies
11
Topics
8
Languages

Showing 1–3 of 3 results

  • J.P. MorganMediumSoftware Engineer II
    Find the Maximum-Sum Contiguous Subarray

    Implement Kadane's algorithm to find the maximum sum of a non-empty contiguous subarray in linear time and constant auxiliary space, with proper handling for all-negative inputs and potential 64-bit integer overflow.

    Coding & AlgorithmsOnsitedynamic-programmingarrayskadanes-algorithm
  • J.P. MorganMediumSoftware Engineer II
    Implement Merge Sort

    This problem tests your ability to implement the Divide and Conquer paradigm, specifically the recursive merge sort algorithm, while maintaining stability and managing auxiliary space.

    Coding & AlgorithmsOnsiteSortingDivide and ConquerRecursion
  • J.P. MorganMediumSoftware Engineer II
    Return the K Largest Integers

    This problem tests the ability to efficiently find the k largest elements in an unsorted array using heap-based data structures to optimize for cases where k is significantly smaller than the input size.

    Coding & AlgorithmsOnsiteHeapSortingAlgorithms