Cognizant GenC Pro OA | Data Compression Sequence Evaluator & Fleet Route Allocator

Problem 1 - Data Compression Sequence Evaluator Problem Statement You are building an optimized data parser for an asynchronous message broker queue. The system receives a compressed string called compressedStream. The stream consists of lowercase letters followed immediately by an integer representing that letter's consecutive recurrence count. For example: "a3b2" represents the decompressed text "aaabb". Your task is to determine the most frequent character that would appear in the fully decompressed text. If multiple characters have the same highest frequency, ...