title: Form all possible unique 3 digit number combinations from given elements in Python,
body: <p>Consider a non-empty array <strong>inarr</strong> containing non-zero positive single digit integers, separated by ','</p>
  
  <p>Print a string based on the following conditions:</p>
  
  <ol>
  <li>Form all possible unique 3 digit number combinations with the elements of inarr</li>
  <li>Identify the maximum number among the three-digit combinations formed</li>
  <li>Print maximum number along with the total number of unique three-digit combinations formed, separating them with a ','.</li>
  </ol>
  
  <p><strong>Assumption:</strong> inarr contains at least 3 elements</p>
  
  <p><strong>Note:</strong> An element present at a particular index should not be considered more than once while forming a combination.</p>
  
  <p><strong>Input:</strong> Read inarr from standard input stream</p>
  
  <p><strong>Explanation:</strong> Sample Input <code>1,2,1,4</code> for the input inarr all possible unique 3 digit number combinations are: <code>121,411,124,214,114,142,141,211,421,112,241,412</code> The maximum number is <code>421</code> and total unique combinations are <code>12</code>, therefore output will be <code>421,12</code></p>