Question Details
Given an integer array nums, your task is to count the number of distinct triplets (i, j, k) such that i < j < k and nums[i] + nums[j] + nums[k] == 0. Present the algorithm complexity and provide the
Full Details
🔒
Unlock all Citadel questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →About This Question
This is a reported interview question from a citadel interview for a swe role during the coding round.
It covers the following topics: Arrays .
Difficulty rating: Medium