Solve four data structure and algorithms tasks

Q: Solve four data structure and algorithms tasks

This set of tasks evaluates core algorithmic competencies such as tree traversal and level-order processing, data-structure design and counting maps, recursive subtree aggregation for statistical checks, and optimization/search techniques for partitioning problems, all within the Coding & Algorithms domain.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Print the numbers at each level of a binary tree. Given the root, output the values level-by-level (each level on a new line or as a list of lists). State the time and space complexity.
Implement a class that stores input strings and their occurrence counts with methods: add(s), count(s) -> current count, and remove(s). Follow-ups: compute the total count across all stored data efficiently; generalize to support arbitrary data types (not just strings) and interchangeable underlying data structures; discuss concurrency and complexity trade-offs.
Given a binary tree with integer values, determine for each node whether its value equals the average of all values in its subtree (including itself). Return the number of nodes that satisfy the condition. Design an O(n) solution.
Given an array of wood lengths and an integer k, find the maximum integer length L such that cutting the wood into pieces of length L yields at least k pieces (no joining allowed). If impossible, return 0. Explain and implement your algorithm.

Solve four data structure and algorithms tasks

Overview

Comments (0)