← Accenture questions
CodingEasy-Medium

Find Kth Smallest Element Using Min-Heap

Filed under Accenture

Given an unsorted array of integers and an integer k, find the kth smallest element in the array. You must use a min-heap or priority queue approach.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Accenture questions

Collected from public candidate posts and coding forums. Updated Nov 2026.