JobsJob TrackerJob alerts

IIT Gandhinagar ยท 10 questions

All 10Coding 8Low-Level Design 2
  • Find the height of a binary treeCoding
  • Time complexity to find maximum in min heapCoding
  • Two elements with sum equal to xCoding
  • Two numbers whose sum equals the rest of n-2 elementsCoding
  • Transformer Architecture and Positional Embeddings in NLPLow-Level Design
  • Transformer Structure, Self-Attention, and Word EmbeddingsLow-Level Design
  • Second Minimum Spanning TreeCoding
  • Reverse a String and Check PalindromeCoding
  • Find Middle and Detect Circular Linked ListCoding
  • Dijkstra's Algorithm with BFS ModificationCoding
โ† IIT Gandhinagar questions
  1. Interview questions
  2. IIT Gandhinagar
  3. Two numbers whose sum equals the rest of n-2 elements
CodingHardReported in a candidate post, Jan 2020

Two numbers whose sum equals the rest of n-2 elements

Filed under IIT Gandhinagar

The question

Given an array of length n, find if there exist two numbers whose sum is equal to the sum of the remaining n-2 elements.

No write-up yet. Related questions below have one.

Related IIT Gandhinagar questions

  • Time complexity to find maximum in min heap
  • Two elements with sum equal to x
  • Second Minimum Spanning Tree
  • Reverse a String and Check Palindrome
  • Find Middle and Detect Circular Linked List
โ† Two elements with sum equal to xTransformer Architecture and Positional Embeddings in NLP โ†’

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