Nodejs Array Unique uniq()

Here you can find the source of uniq()

Method Source Code

Array.prototype.uniq = function() {
  let i;/*  w w  w.j a  v a  2 s. c  om*/
  let uniqArr = [];

  for (i = 0; i < this.length; i++) {
    if (!uniqArr.includes(this[i])) {
      uniqArr.push(this[i]);
    }
  }

  return uniqArr;
};

let arr = [1,2,3,3,5,5,5,1];

console.log(arr.uniq());
//======================================================================
Array.prototype.twoSum = function() {
  let i, j;
  let twoSumArr = [];
  for(i = 0; i < this.length - 1; i++) {
    for(j = i + 1; j < this.length; j++) {
      if (this[i] + this[j] === 0) {
        twoSumArr.push([i,j]);
      }
    }
  }
  return twoSumArr;
};

console.log([-1, 0, 2, -2, 1].twoSum());
//======================================================================

Array.prototype.transpose = function () {
  let i, j;
  let transposeArr = [];
  for(i = 0; i < this.length; i++) {
    let row = [];
    for(j = 0; j < this.length; j++) {
      row.push(this[j][i]);
    }
    transposeArr.push(row);
  }
  return transposeArr;
};
let rows = [
    [0, 1, 2],
    [3, 4, 5],
    [6, 7, 8]
  ];
  console.log(rows.transpose());
//======================================================================

Related

  1. uniq()
    "use strict";
    Array.prototype.uniq = function () {
      let uniqueArray = [];
      for (let i = 0; i < this.length; i++) {
        if (uniqueArray.indexOf(this[i]) === -1) {
          uniqueArray.push(this[i]);
      return uniqueArray;
    ...
    
  2. uniq()
    Array.prototype.uniq = function () {
      var newArray = [];
      for (var i = 0; i < this.length; i++) {
        var el = this[i];
        if (newArray.indexOf(el) === -1) {
          newArray.push(el);
      return newArray;
    ...
    
  3. uniq()
    Array.prototype.uniq = function() {
      var dups = {},
          cleanArray = [];
          array = this,
          i = 0,
          len = array.length;
      if(this.constructor !== Array) {
        throw new TypeError ('Can only call this method on an array');
      for(i; i < len; i++) {
        if(!dups[array[i]]) {
          cleanArray.push(array[i]);
          dups[array[i]] = true;
      return cleanArray;
    
  4. uniq()
    Array.prototype.uniq = function (){
      let result = [];
      for (let i = 0; i < this.length; i++) {
        if (result.includes(this[i])) {
          continue;
        } else {
          result.push(this[i]);
      return result;
    };
    console.log([1, 2, 1, 3, 3].uniq());
    console.log([1, 2, 3, 4].uniq());
    
  5. uniq()
    var bubbleSort = function (array)
      var sorted = false;
      while (!sorted)
        sorted = true;
        for (i = 0; i < array.length - 1; i++)
          if (array[i] > array[i + 1])
    ...
    
  6. uniq()
    function uniq(array) {
      let newArray = [];
      for (let i = 0; i < array.length; i++) {
        if (!newArray.includes(array[i])) {
          newArray.push(array[i]);
      return newArray;
    Array.prototype.uniq = function () {
      let newArray = [];
      for (let i = 0; i < this.length; i++) {
        if (!newArray.includes(this[i])) {
          newArray.push(this[i]);
      return newArray;
    };
    Array.prototype.twoSum = function () {
      let positions = [];
      for (let i = 0; i < this.length; i++) {
        for (let j = i + 1; j < this.length; j++) {
          if (this[i] + this[j] === 0) {
            positions.push([i, j]);
      return positions;
    };
    function myTranspose (array) {
      let transposed = [];
      for (let i = 0; i < array.length; i++) {
        let row = [];
        for (let j = 0; j < array.length; j++) {
          row.push(array[j][i]);
        transposed.push(row);
      return transposed;
    console.log(myTranspose([
        [0, 1, 2],
        [3, 4, 5],
        [6, 7, 8]
      ]));
    
  7. uniq()
    function uniq(array) {
      const beenSeen = [];
      for (let i = 0; i < array.length; i++) {
        if (!(beenSeen.includes(array[i]))) {
          beenSeen.push(array[i]);
      return beenSeen;
    Array.prototype.uniq = function() {
      const beenSeen = [];
      for (let i = 0; i < this.length; i++) {
        if (!(beenSeen.includes(this[i]))) {
          beenSeen.push(this[i]);
      return beenSeen;
    };
    Array.prototype.two_sum = function() {
      const twoSum = [];
      for (let i = 0; i < this.length - 1 ; i++) {
        for (let j = i + 1; j < this.length; j++) {
          if (this[i] + this[j] === 0) {
            twoSum.push([i , j]);
      return twoSum;
    };
    function myTranspose(matrix) {
      const outLength = matrix[0].length;
      const outWidth = matrix.length;
      const outArray = [];
      for (let i = 0; i < outLength; i++) {
        const row = [];
        for (let j = 0; j < outWidth; j++) {
          row.push(matrix[j][i]);
        outArray.push(row);
      return outArray;
    console.log(myTranspose([
        [0, 1, 2],
        [3, 4, 5],
        [6, 7, 8]
      ]));
    
  8. uniq()
    Array.prototype.uniq = function() {
      var uniqArray = [];
      for (var i = 0; i < this.length; i++) {
        if (uniqArray.indexOf(this[i]) === -1) {
          uniqArray.push(this[i]);
      return uniqArray;
    };
    ...
    
  9. unique
    Array.prototype.unique =
      function() {
        var a = [];
        var l = this.length;
        for(var i=0; i<l; i++) {
          for(var j=i+1; j<l; j++) {
            if (this[i] === this[j])
              j = ++i;
          a.push(this[i]);
        return a;
      };