---
title: "Discussion on \"Rules for Solving a Coding Question in an Interview\" | Hashnode"
description: "Discussion on \"Rules for Solving a Coding Question in an Interview\". If we are dealing with top/maximum/minimum/closest 'K' elements among 'N' elements, we will be using a Heap.\n\nIf the given input is a sorted array or a list, we will either be using Binary Search or the Two Pointers strategy.\n\nIf we need to try all c..."
url: "https://hashnode.com/posts/rules-for-solving-a-coding-question-in-an-interview/6456a3f4306ab0b5ca0de768"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Rules for Solving a Coding Question in an Interview](https://blogs.sravanth.co.uk/rules-for-solving-a-coding-question-in-an-interview?utm_source=hashnode&utm_medium=feed)

If we are dealing with top/maximum/minimum/closest 'K' elements among 'N' elements, we will be using a Heap. If the given input is a sorted array or a list, we will either be using Binary Search or the Two Pointers strategy. If we need to try all c...

May 6, 2023 · 1 min read · blogs.sravanth.co.uk  
Read the article

## Written by

[Sravanth](https://hashnode.com/@sravanth-baratam)

@sravanth-baratam · Ilford, United Kingdom

  
[View profile](https://hashnode.com/@sravanth-baratam)

Full Stack Developer

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
