Day - 39

Assalamu alaykum, everyone! How are you, dears? It is the 39th day of my coding challenge! I am trying to solve at least one problem per day. So, in today's challenge, I will share 2 solutions for LeetCode problems.

Let's go!!!

1. Problem 414. Third Maximum Number

/*
 * @param {number[]} nums
 * @return {number}
 */

var thirdMax = function (nums) {
  nums.sort((a, b) => b - a);
  let counted = 1,
    prev = nums[0],
    len = nums.length;
  for (let i = 1; i < len; ++i) {
    if (nums[i] != prev) {
      counted += 1;
      prev = nums[i];
    }

    if (counted == 3) {
      return nums[i];
    }
  }
  return nums[0];
};        

2. Problem 1037. Valid Boomerang

/*
 * @param {number[][]} points
 * @return {boolean}
 */

var isBoomerang = function (points) {
  const [[x1, y1], [x2, y2], [x3, y3]] = points;
  return (y1 - y2) * (x1 - x3) != (y1 - y3) * (x1 - x2);
};        

That's all, I am gonna share with you today! Thanks for your attention! I will come back with more solutions in the upcoming days!

#coding #challenges #problems #solutions #leetcode #javascript #typescript #algorithms