Merge remote-tracking branch 'codeprob/master'

Author: ojasvikhurana

CODE_OF_CONDUCT.md

@@ -0,0 +1,76 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+In the interest of fostering an open and welcoming environment, we as
+contributors and maintainers pledge to making participation in our project and
+our community a harassment-free experience for everyone, regardless of age, body
+size, disability, ethnicity, sex characteristics, gender identity and expression,
+level of experience, education, socio-economic status, nationality, personal
+appearance, race, religion, or sexual identity and orientation.
+
+## Our Standards
+
+Examples of behavior that contributes to creating a positive environment
+include:
+
+* Using welcoming and inclusive language
+* Being respectful of differing viewpoints and experiences
+* Gracefully accepting constructive criticism
+* Focusing on what is best for the community
+* Showing empathy towards other community members
+
+Examples of unacceptable behavior by participants include:
+
+* The use of sexualized language or imagery and unwelcome sexual attention or
+ advances
+* Trolling, insulting/derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or electronic
+ address, without explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+ professional setting
+
+## Our Responsibilities
+
+Project maintainers are responsible for clarifying the standards of acceptable
+behavior and are expected to take appropriate and fair corrective action in
+response to any instances of unacceptable behavior.
+
+Project maintainers have the right and responsibility to remove, edit, or
+reject comments, commits, code, wiki edits, issues, and other contributions
+that are not aligned to this Code of Conduct, or to ban temporarily or
+permanently any contributor for other behaviors that they deem inappropriate,
+threatening, offensive, or harmful.
+
+## Scope
+
+This Code of Conduct applies both within project spaces and in public spaces
+when an individual is representing the project or its community. Examples of
+representing a project or community include using an official project e-mail
+address, posting via an official social media account, or acting as an appointed
+representative at an online or offline event. Representation of a project may be
+further defined and clarified by project maintainers.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported by contacting the project team at larissalages7@gmail.com. All
+complaints will be reviewed and investigated and will result in a response that
+is deemed necessary and appropriate to the circumstances. The project team is
+obligated to maintain confidentiality with regard to the reporter of an incident.
+Further details of specific enforcement policies may be posted separately.
+
+Project maintainers who do not follow or enforce the Code of Conduct in good
+faith may face temporary or permanent repercussions as determined by other
+members of the project's leadership.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,
+available at https://www.contributor-covenant.org/version/1/4/code-of-conduct.html
+
+[homepage]: https://www.contributor-covenant.org
+
+For answers to common questions about this code of conduct, see
+https://www.contributor-covenant.org/faq

classical_algorithms/python/Heap Sort.py renamed to classical_algorithms/python/heapsort.py

@@ -23,18 +23,30 @@ def heapify(arr, n, i):
 def heapSort(arr): 
 	n = len(arr) 
 
+	# empty list returns sorted empty list
+	if n == 0:
+		return []
+
+	# list of size one, returns same list
+	if n == 1:
+		return arr
+
 	# Build a maxheap. 
 	for i in range(n//2 - 1, -1, -1): 
 		heapify(arr, n, i) 
 
 	# One by one extract elements 
 	for i in range(n-1, 0, -1): 
 		arr[i], arr[0] = arr[0], arr[i] # swap 
-		heapify(arr, i, 0) 
-
-print('Enter a list of numbers')
-arr = list(map(int,input().split()))
-heapSort(arr) 
-print('After performing heap sort')
-for i in arr:
-    print(i,end =' ')
+		heapify(arr, i, 0)
+	return arr
+
+
+# not execute the code when imported
+if __name__ == "__main__":
+	print('Enter a list of numbers')
+	arr = list(map(int,input().split()))
+	heapSort(arr) 
+	print('After performing heap sort')
+	for i in arr:
+	    print(i,end =' ')

classical_algorithms/python/tests/test_heap_sort.py

@@ -0,0 +1,26 @@
+import unittest
+from classical_algorithms.python.heapsort import heapSort
+
+class TestHeapSort(unittest.TestCase):
+  def test_heap_sort(self):
+
+    print('None Input')
+    self.assertRaises(TypeError, heapSort, None)
+
+    print('Empty Input')
+    self.assertEqual(heapSort([]), [])
+
+    print('One Element')
+    self.assertEqual(heapSort([13]), [13])
+
+    print('Multipe nElements')
+    test_array = [-23,-1,0,1,10,-10,1000, 2]
+    solution_array = [-23,-10,-1,0,1,2,10,1000]
+
+    self.assertEqual(heapSort(test_array), solution_array)
+
+    print('Successful test_heap_sort\n')
+
+
+if __name__=='__main__':
+  unittest.main()

data_structures/C++/ternary_search.cpp

@@ -0,0 +1,55 @@
+#include <iostream>
+using namespace std;
+int ternarySearch(int l, int r, int key, int ar[])
+
+{
+    while (r >= l) {
+
+        int mid1 = l + (r - l) / 3;
+        int mid2 = r - (r - l) / 3;
+
+        if (ar[mid1] == key) {
+            return mid1;
+        }
+        if (ar[mid2] == key) {
+            return mid2;
+        }
+
+
+        if (key < ar[mid1]) {
+
+            // The key lies in between l and mid1 
+            r = mid1 - 1;
+        }
+        else if (key > ar[mid2]) {
+
+            // The key lies in between mid2 and r 
+            l = mid2 + 1;
+        }
+        else {
+
+            // The key lies in between mid1 and mid2 
+            l = mid1 + 1;
+            r = mid2 - 1;
+        }
+    }
+    return -1;
+}
+int main()
+{
+ int len;
+cin>>len;
+int ar[len];
+for(int i=0;i<len;i++){
+        cin>>ar[i];
+}
+int key;
+cin>>key;
+int l=0;
+int r=len-1;
+int p=0;
+     p = ternarySearch(l, r, key, ar);
+
+    cout << "Index of "<<key<<" is " << p << endl;
+}
+

leetcode/cpp/Stacks/20.cpp

@@ -0,0 +1,24 @@
+class Solution {
+    bool checkingOpen(char ch) {
+    return ch == '(' || ch == '[' || ch == '{';
+    }
+    char checkBracket(char ch){
+        if(ch == ']') return '[';
+        else if(ch == '}') return '{';
+        else return '(';
+    }
+public:
+    bool isValid(string s) {
+        stack <char> st;
+       for(int i = 0 ; i < s.length() ; i++){
+           if(checkingOpen(s[i])) st.push(s[i]);
+           else{
+              if(st.empty()) return false;
+              if(checkBracket(s[i]) == st.top()) st.pop();
+              else return false;
+           }
+       } 
+        if(st.empty()) return true;
+        else return false;
+    }
+};

pull_request_template.md

@@ -0,0 +1,12 @@
+### Your checklist for this pull request
+🚨Please review the [guidelines for contributing](https://github.com/larissalages/code_problems/blob/master/CONTRIBUTING.md) to this repository.
+
+- [ ] Make sure your files are in the right folder!
+- [ ] Make sure you add the extension of the file (.cpp, .python, .java, etc).
+- [ ] If your code is a solution for a code problem, please tell which one.
+- [ ] Make sure your code is working, test for a lot of cases.
+
+### Description
+Please describe your pull request.
+
+:heart: Thank you!