Apr 8, 2022 · Apr 7, 2022 · Apr 7, 2022 · Apr 7, 2022 · Apr 7, 2022 · Apr 7, 2022
diff --git a/...02. Binary-Tree-Level-Order-Traversal.cpp → ...102-Binary-Tree-Level-Order-Traversal.cpp b/...02. Binary-Tree-Level-Order-Traversal.cpp → ...102-Binary-Tree-Level-Order-Traversal.cpp
diff --git a/cpp/1046-Last-Stone-Weight.cpp b/cpp/1046-Last-Stone-Weight.cpp
 class Solution {
 public:
    int lastStoneWeight(vector<int>& stones) {
        priority_queue<int, vector<int>> pq(stones.begin(), stones.end());
        pq.push(0);

        while (pq.size()>=1) {
            int t1 = pq.top();
            pq.pop();
            if(pq.empty()) break;
            int t2 = pq.top();
            pq.pop();
            pq.push(abs(t1-t2));
        }

        return pq.top();
    }
 };
diff --git a/cpp/11- Container with most water.cpp → cpp/11-Container-with-most-water.cpp b/cpp/11- Container with most water.cpp → cpp/11-Container-with-most-water.cpp
diff --git a/cpp/215-Kth-Largest-Element-in-an-Array.cpp b/cpp/215-Kth-Largest-Element-in-an-Array.cpp
 class Solution {
 public:
    int findKthLargest(vector<int>& nums, int k) {
        priority_queue<int, vector<int>, greater<int>> pq(nums.begin(), nums.end());
        while (pq.size() > k)pq.pop();
        return pq.top();
    }
 };
diff --git a/...ubstring Without Repeating Characters.cpp → ...ubstring-Without-Repeating-Characters.cpp b/...ubstring Without Repeating Characters.cpp → ...ubstring-Without-Repeating-Characters.cpp
diff --git a/cpp/36- Valid-Sudoku.cpp → cpp/36-Valid-Sudoku.cpp b/cpp/36- Valid-Sudoku.cpp → cpp/36-Valid-Sudoku.cpp
diff --git a/cpp/42. Trapping Rain Water.cpp → cpp/42-Trapping-Rain-Water.cpp b/cpp/42. Trapping Rain Water.cpp → cpp/42-Trapping-Rain-Water.cpp
diff --git a/cpp/543-Diameter-of-Binary-Tree.cpp b/cpp/543-Diameter-of-Binary-Tree.cpp
 /**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
 class Solution {
 public:

    int MaxHeight(TreeNode* root, int& res) {
        if (root == NULL) return 0;
        int l = MaxHeight(root->left, res);
        int r = MaxHeight(root->right, res);
        res = max(res, max(max(l, r), l + r));
        return 1 + max(l, r);
    }

    int diameterOfBinaryTree(TreeNode* root) {
        int breadth = 0;
        MaxHeight(root, breadth);
        return breadth;
    }
 };
diff --git a/cpp/70. Climbing_Stairs.cpp → cpp/70-Climbing-Stairs.cpp b/cpp/70. Climbing_Stairs.cpp → cpp/70-Climbing-Stairs.cpp
diff --git a/cpp/703-Kth-Largest-Element-in-a-Stream.cpp b/cpp/703-Kth-Largest-Element-in-a-Stream.cpp
 class KthLargest {
 public:
    priority_queue<int, vector<int>, greater<int>> pq;
    int k;
    KthLargest(int k, vector<int>& nums) {
        this->k = k;
        for (auto a: nums) pq.push(a);
        while(pq.size()>k){
            pq.pop();
        }
    }

    int add(int val) {
        pq.push(val);
        while(pq.size()>k){
            pq.pop();
        }
        return pq.top();
    }
 };

 /**
 * Your KthLargest object will be instantiated and called as such:
 * KthLargest* obj = new KthLargest(k, nums);
 * int param_1 = obj->add(val);
 */
diff --git a/cpp/74-Search a 2d matrix.cpp → cpp/74-Search-a-2d-matrix.cpp b/cpp/74-Search a 2d matrix.cpp → cpp/74-Search-a-2d-matrix.cpp
diff --git a/cpp/746.Min-Cost-Climbing-Stairs.cpp → cpp/746-Min-Cost-Climbing-Stairs.cpp b/cpp/746.Min-Cost-Climbing-Stairs.cpp → cpp/746-Min-Cost-Climbing-Stairs.cpp
diff --git a/cpp/973-K-Closest-Points-to-Origin.cpp b/cpp/973-K-Closest-Points-to-Origin.cpp
 class Solution {
 public:
    struct cords {
        int x, y;
        cords(vector<int> a) {
            this -> x = a[0];
            this -> y = a[1];
        }
        cords(int x, int y){
            this -> x = x;
            this -> y = y;
        }
        int dist(){
            return x*x+y*y;
        }
    };

    struct compare {
        bool operator()(cords a, cords b) {
            return a.dist() < b.dist();
        }
    };

    vector<vector<int>> kClosest(vector<vector<int>>& points, int k) {
        priority_queue<cords, vector<cords>, compare> pq;
        for (auto a: points) {
            pq.push(cords(a));
        }

        while (pq.size() > k) pq.pop();

        vector<vector<int>> res;
        while (!pq.empty()) {
            res.push_back({pq.top().x, pq.top().y});
            pq.pop();
        }
        return res;
    }
 };
diff --git a/java/208-Implement-Trie(Prefix Tree).java → java/208-Implement-Trie-Prefix-Tree.java b/java/208-Implement-Trie(Prefix Tree).java → java/208-Implement-Trie-Prefix-Tree.java
diff --git a/java/42. Trapping Rain Water.java → java/42-Trapping-Rain-Water.java b/java/42. Trapping Rain Water.java → java/42-Trapping-Rain-Water.java
diff --git a/javascript/49. Group Anagrams.js → javascript/49-Group-Anagrams.js b/javascript/49. Group Anagrams.js → javascript/49-Group-Anagrams.js
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,18 @@
		class Solution {
		public:
		int lastStoneWeight(vector<int>& stones) {
		priority_queue<int, vector<int>> pq(stones.begin(), stones.end());
		pq.push(0);

		while (pq.size()>=1) {
		int t1 = pq.top();
		pq.pop();
		if(pq.empty()) break;
		int t2 = pq.top();
		pq.pop();
		pq.push(abs(t1-t2));
		}

		return pq.top();
		}
		};
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,8 @@
		class Solution {
		public:
		int findKthLargest(vector<int>& nums, int k) {
		priority_queue<int, vector<int>, greater<int>> pq(nums.begin(), nums.end());
		while (pq.size() > k)pq.pop();
		return pq.top();
		}
		};
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,28 @@
		/**
		* Definition for a binary tree node.
		* struct TreeNode {
		* int val;
		* TreeNode *left;
		* TreeNode *right;
		* TreeNode() : val(0), left(nullptr), right(nullptr) {}
		* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
		* TreeNode(int x, TreeNode left, TreeNode right) : val(x), left(left), right(right) {}
		* };
		*/
		class Solution {
		public:

		int MaxHeight(TreeNode* root, int& res) {
		if (root == NULL) return 0;
		int l = MaxHeight(root->left, res);
		int r = MaxHeight(root->right, res);
		res = max(res, max(max(l, r), l + r));
		return 1 + max(l, r);
		}

		int diameterOfBinaryTree(TreeNode* root) {
		int breadth = 0;
		MaxHeight(root, breadth);
		return breadth;
		}
		};
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,26 @@
		class KthLargest {
		public:
		priority_queue<int, vector<int>, greater<int>> pq;
		int k;
		KthLargest(int k, vector<int>& nums) {
		this->k = k;
		for (auto a: nums) pq.push(a);
		while(pq.size()>k){
		pq.pop();
		}
		}

		int add(int val) {
		pq.push(val);
		while(pq.size()>k){
		pq.pop();
		}
		return pq.top();
		}
		};

		/**
		* Your KthLargest object will be instantiated and called as such:
		* KthLargest* obj = new KthLargest(k, nums);
		* int param_1 = obj->add(val);
		*/
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,39 @@
		class Solution {
		public:
		struct cords {
		int x, y;
		cords(vector<int> a) {
		this -> x = a[0];
		this -> y = a[1];
		}
		cords(int x, int y){
		this -> x = x;
		this -> y = y;
		}
		int dist(){
		return xx+yy;
		}
		};

		struct compare {
		bool operator()(cords a, cords b) {
		return a.dist() < b.dist();
		}
		};

		vector<vector<int>> kClosest(vector<vector<int>>& points, int k) {
		priority_queue<cords, vector<cords>, compare> pq;
		for (auto a: points) {
		pq.push(cords(a));
		}

		while (pq.size() > k) pq.pop();

		vector<vector<int>> res;
		while (!pq.empty()) {
		res.push_back({pq.top().x, pq.top().y});
		pq.pop();
		}
		return res;
		}
		};