Skip to main content

May-8 2020 Challenge

8. Check If It Is a Straight Line


You are given an array coordinates, coordinates[i] = [x, y], where [x, y] represents the coordinate of a point. Check if these points make a straight line in the XY plane.

Example 1:leetcode funding leetcode free premium leetcode friend circle 

A linear grap

Input: coordinates = [[1,2],[2,3],[3,4],[4,5],[5,6],[6,7]]
Output: true

view experience leetcode java leetcode javascript leetcode jump game leetcode java solutions leetcode jump game ii leetcode javascript solutions leetcode java questions leetcode jobs leetcode knapsack leetcode knapsack problem leetcode kth smallest element leetcode kmp leetcode k closest points leetcode kth smallest element in a bst leetcode kadane leetcode keys and ro

Example 2:
Graph consists of sequence of points
Input: coordinates = [[1,1],[2,2],[3,4],[4,5],[5,6],[7,7]]
Output: false

Constraints:
  • 2 <= coordinates.length <= 1000
  • coordinates[i].length == 2
  • -10^4 <= coordinates[i][0], coordinates[i][1] <= 10^4
  • coordinates contains no duplicate point.


 Solution: 

class Solution {
public:
    bool checkStraightLine(vector<vector<int>>& cs) {
        size_t n = cs.size(); 
        int x1 = cs[0][0], y1 = cs[0][1], x = cs[1][0] - x1, y = cs[1][1] - y1;
        for (int i = 2; i < n; i ++) 
            if (x * (cs[i][1] - y1) != y * (cs[i][0] - x1)) 
                return false; 
        return true; 
    }
};


leetcode leetcode may challenge leetcode premium leetcode premium for free leetcode problems leetcode 200 leetcode dynamic programming leetcode login leetcode array leetcode amazon leetcode anagrams leetcode app leetcode api leetcode april challenge leetcode asteroid collision leetcode atoi leetcode binary search leetcode backtracking leetcode burst balloons leetcode bfs leetcode biweekly contest leetcode bst leetcode binary tree camera leetcodebipartite grap

leetcode leetcode may challenge leetcode premium leetcode premium for free leetcode problems leetcode 200 leetcode dynamic programming leetcode login leetcode array leetcode amazon leetcode anagrams leetcode app leetcode api leetcode april challenge leetcode asteroid collision leetcode atoi leetcode binary search leetcode backtracking leetcode burst balloons leetcode bfs leetcode biweekly contest leetcode bst leetcode binary tree camera leetcode bipartite graph leetcode contest leetcode course schedule leetcode coin change leetcode company wise questions leetcode counting bits leetcode container with most water leetcode compensation leetcode challenge leetcode decode ways leetcode dark theme leetcode dfs leetcode data structures leetcode decode ways ii leetcode discuss leetcode daily temperatures leetcode edit distance leetcode explore leetcode easy problems leetcode errichto leetcode editor leetcode extension leetcode egg drop leetcode editorial leetcode flood fill leetcode find the town judge leetcode free leetcode founder leetcode for beginners leetcode funding leetcode free premium leetcode friend circle leetcode graph leetcode google leetcode group anagrams leetcode github leetcode google interview questions lis leetcode google interview leetcode greedy leetcode gas station leetcode house robber leetcode happy number leetcode hashmap leetcode help center leetcode heap leetcode hard problems leetcode history leetcode happy number solution leetcode ide leetcode interview questions leetcode internship leetcode island perimeter leetcode india leetcode intersection of two linked lists leetcode implement trie leetcode interview experience leetcode java leetcode javascript leetcode jump game leetcode java solutions leetcode jump game ii leetcode javascript solutions leetcode java questions leetcode jobs leetcode knapsack leetcode knapsack problem leetcode kth smallest element leetcode kmp leetcode k closest points leetcode kth smallest element in a bst leetcode kadane leetcode keys and rooms
Labels:

Comments

Post a Comment

Popular posts from this blog

May-6 2020 Challenge

  6.   Majority Element Given an array of size  n , find the majority element. The majority element is the element that appears  more than   ⌊ n/2 ⌋  times. You may assume that the array is non-empty and the majority element always exist in the array. Example 1: Input: [3,2,3] Output: 3 Example 2: Input: [2,2,1,1,1,2,2] Output: 2 Solution in Java  class Solution {     public int majorityElement(int[] num) {         int m = num[0], cnt= 1;     for (int i = 1; i < num.length; i++) {         if (cnt == 0) {             m= num[i];             cnt = 1;         } else if (num[i] == m) {             cnt++;         } else              cnt--;    }      return m;...
Post a Comment
Read more

Leetcode 190. Reverse Bits. Python. Bit Manipulation

  190 .  Reverse Bits Reverse bits of a given 32 bits unsigned integer. Note: Note that in some languages, such as Java, there is no unsigned integer type. In this case, both input and output will be given as a signed integer type. They should not affect your implementation, as the integer's internal binary representation is the same, whether it is signed or unsigned. In Java, the compiler represents the signed integers using  2's complement notation . Therefore, in  Example 2  above, the input represents the signed integer  -3  and the output represents the signed integer  -1073741825 .   Example 1: Input: n = 00000010100101000001111010011100 Output: 964176192 (00111001011110000010100101000000) Explanation: The input binary string 00000010100101000001111010011100 represents the unsigned integer 43261596, so return 964176192 which its binary representation is 00111001011110000010100101000000 . Example 2: Input: n = 11111111111111111111...
Post a Comment
Read more

Longest Substring Without Repeating Characters - Leetcode 3 - Python

Given a string s, find the length of the longest substring without repeating characters. class Solution:     def lengthOfLongestSubstring(self, s: str) -> int:         charSet = set()         left = 0         ans = 0         for right in range(len(s)):             while s[right] in charSet:                 charSet.remove(s[left])                 left+=1             charSet.add(s[right])             ans = max(ans, right-left+1)         return ans                  Explained :
Post a Comment
Read more