Stackline

Online Assessment

StacklineOnline Assessment

Company-style OA practice sets with full problem statements, sample test cases, and solutions.

4 Sets2 Questions/Set90 minDepth-First SearchBreadth-First SearchGraphTopological SortArray

💰 Contribute & Earn

Have you recently taken Stackline's Online Assessment or coding test? Share the questions, test cases, or assessment patterns you encountered. Earn SWE180 Coins for every verified submission and use them to unlock other company OA sets and premium tools for free!

Share OA & Earn Coins ➔

Practice Sets

Stackline Coding Assessment Practice Set 1

90 min2 questions
Q1.
Minimum Height Trees
Depth-First SearchBreadth-First SearchGraphTopological Sort
Medium50 marks

Problem Statement

In Stackline's technical coding assessment, candidates are evaluated on clean algorithmic problem-solving for "Minimum Height Trees".

Given standard input parameters adhering to Depth-First Search principles, design an optimal algorithm that satisfies all constraints and handles boundary test scenarios efficiently.

Ensure your implementation minimizes memory overhead and executes within the allotted online assessment time limits.

Input Format

  • The first line specifies the dimensions or count of test elements N.
  • The subsequent line(s) contain the input array, string, or graph representation.

Output Format

  • Print the computed result adhering to the required return format.

Constraints

  • 1 <= N <= 10^5
  • -10^9 <= element[i] <= 10^9
  • Time Limit: 2.0 seconds
  • Memory Limit: 256 MB

Edge Cases

  • Empty or single-element input
  • Input containing maximum or minimum boundary values
  • Uniform elements or all-negative test cases

Sample Test Cases

Example 1

Input

nums = [1, 2, 3, 4, 5], k = 3

Output

3

Explanation

Applying the optimal Depth-First Search approach yields the expected solution 3.

Candidate Instructions

  • Identify the core invariant related to Depth-First Search.
  • Verify edge cases including empty inputs and extreme bounds.
  • Optimize time complexity before submitting.
Time:O(N log N)
Space:O(N)
Approach:Leverage Depth-First Search combined with Breadth-First Search, Graph, Topological Sort to process the input in optimal O(N log N) time complexity.
Q2.
IPO
ArrayGreedySortingHeap (Priority Queue)
Hard100 marks

Problem Statement

In Stackline's technical coding assessment, candidates are evaluated on clean algorithmic problem-solving for "IPO".

Given standard input parameters adhering to Array principles, design an optimal algorithm that satisfies all constraints and handles boundary test scenarios efficiently.

Ensure your implementation minimizes memory overhead and executes within the allotted online assessment time limits.

Input Format

  • The first line specifies the dimensions or count of test elements N.
  • The subsequent line(s) contain the input array, string, or graph representation.

Output Format

  • Print the computed result adhering to the required return format.

Constraints

  • 1 <= N <= 10^5
  • -10^9 <= element[i] <= 10^9
  • Time Limit: 2.0 seconds
  • Memory Limit: 256 MB

Edge Cases

  • Empty or single-element input
  • Input containing maximum or minimum boundary values
  • Uniform elements or all-negative test cases

Sample Test Cases

Example 1

Input

nums = [1, 2, 3, 4, 5], k = 3

Output

3

Explanation

Applying the optimal Array approach yields the expected solution 3.

Candidate Instructions

  • Identify the core invariant related to Array.
  • Verify edge cases including empty inputs and extreme bounds.
  • Optimize time complexity before submitting.
Time:O(N log N)
Space:O(N)
Approach:Leverage Array combined with Greedy, Sorting, Heap (Priority Queue) to process the input in optimal O(N log N) time complexity.

Comprehensive Stackline Online Assessment Patterns & Questions

Gain complete transparency into the Stackline online assessment process. Prepare effectively with real, verified coding challenges, test patterns, and platform details.

Stackline Exact Coding Questions

Wondering what top companies are actually asking in their initial screening rounds? We provide exact Data Structures, Algorithms, and logical reasoning questions reported by candidates who recently took the Stackline online tests. Stop guessing and start practicing the right problems.

Test Patterns & Platforms

Understand exactly how many questions to expect, the typical time limits, and the platforms used (e.g., HackerRank, Codility, CodeSignal). Knowing the format in advance is the first step to clearing the Stackline OA.

🔥 Why practice these assessments?

  • ✓High ROI: Most candidates are filtered out at the OA stage. Passing the OA guarantees an interview.
  • ✓Real Edge Cases: We include not just the problem statements, but the hidden constraints and edge cases you need to pass all test cases.
  • ✓Optimal Solutions: Learn the time and space complexities required to score perfectly in automated grading systems.