title: Given an array, you have to find the max possible two equal sum
body: <p>Given an array, you have to find the max possible two equal sum, you can exclude elements.</p>
  
  <p>i.e <code>1,2,3,4,6</code> is given array
  we can have max two equal sum as 6+2 = 4+3+1</p>
  
  <p>i.e 4,10,18, 22,
  we can get two equal sum as 18+4 =  22</p>
  
  <p>what would be your approach to solve this problem apart from brute force to find all computation and checking two possible equal sum?</p>
  
  <p>edit 1: max no of array elements are N &lt;= 50 and each element can be up to 1&lt;= K &lt;=1000</p>
  
  <p>edit 2: Here is my solution <a href="https://ideone.com/cAbe4g" rel="noreferrer">https://ideone.com/cAbe4g</a>, it takes too much time where given time limit is 5 seconds say for each case.</p>
  
  <p>edit 3:- Total elements sum cannot be greater than 1000.</p>