OBI
OBI — Olimpíada Brasileira de Informática (Brazil)
Full question bankEnglish
Exam overviewPractice session
In competitive programming problems requiring the Next Greater Element (NGE) for every element in an array of size N, which data structure and strategy achieves an optimal overall time complexity of O(N)?
Loading your practice session…