Warnermedia

Online Assessment

WarnermediaOnline Assessment

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

4 Sets2 Questions/Set90 minHash TableMathStringStackTree

💰 Contribute & Earn

Have you recently taken Warnermedia'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

Warnermedia Coding Assessment Practice Set 1

90 min2 questions
Q1.
Roman to Integer
Hash TableMathString
Easy50 marks

Problem Statement

In Warnermedia's technical coding assessment, candidates are evaluated on clean algorithmic problem-solving for "Roman to Integer".

Given standard input parameters adhering to Hash Table 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 = [2, 7, 11, 15], target = 9

Output

[0, 1]

Explanation

Applying the optimal Hash Table approach yields the expected solution [0, 1].

Candidate Instructions

  • Identify the core invariant related to Hash Table.
  • Verify edge cases including empty inputs and extreme bounds.
  • Optimize time complexity before submitting.
Time:O(N)
Space:O(N)
Approach:Leverage Hash Table combined with Math, String to process the input in optimal O(N) time complexity.
Q2.
Flatten Nested List Iterator
StackTreeDepth-First SearchDesign
Medium50 marks

Problem Statement

In Warnermedia's technical coding assessment, candidates are evaluated on clean algorithmic problem-solving for "Flatten Nested List Iterator".

Given standard input parameters adhering to Stack 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 Stack approach yields the expected solution 3.

Candidate Instructions

  • Identify the core invariant related to Stack.
  • Verify edge cases including empty inputs and extreme bounds.
  • Optimize time complexity before submitting.
Time:O(V + E)
Space:O(V + E)
Approach:Leverage Stack combined with Tree, Depth-First Search, Design, Queue, Iterator to process the input in optimal O(V + E) time complexity.

Comprehensive Warnermedia Online Assessment Patterns & Questions

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

Warnermedia 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 Warnermedia 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 Warnermedia 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.