diff --git a/.idea/.gitignore b/.idea/.gitignore
new file mode 100644
index 00000000..26d33521
--- /dev/null
+++ b/.idea/.gitignore
@@ -0,0 +1,3 @@
+# Default ignored files
+/shelf/
+/workspace.xml
diff --git a/.idea/Hacktoberfest.iml b/.idea/Hacktoberfest.iml
new file mode 100644
index 00000000..ba91ef50
--- /dev/null
+++ b/.idea/Hacktoberfest.iml
@@ -0,0 +1,12 @@
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/.idea/misc.xml b/.idea/misc.xml
new file mode 100644
index 00000000..e3a9e45a
--- /dev/null
+++ b/.idea/misc.xml
@@ -0,0 +1,6 @@
+
+
+
+
+
+
\ No newline at end of file
diff --git a/.idea/modules.xml b/.idea/modules.xml
new file mode 100644
index 00000000..076a2e03
--- /dev/null
+++ b/.idea/modules.xml
@@ -0,0 +1,8 @@
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/.idea/uiDesigner.xml b/.idea/uiDesigner.xml
new file mode 100644
index 00000000..2b63946d
--- /dev/null
+++ b/.idea/uiDesigner.xml
@@ -0,0 +1,124 @@
+
+
+
+
+ -
+
+
+ -
+
+
+ -
+
+
+ -
+
+
+ -
+
+
+
+
+
+ -
+
+
+
+
+
+ -
+
+
+
+
+
+ -
+
+
+
+
+
+ -
+
+
+
+
+ -
+
+
+
+
+ -
+
+
+
+
+ -
+
+
+
+
+ -
+
+
+
+
+ -
+
+
+
+
+ -
+
+
+ -
+
+
+
+
+ -
+
+
+
+
+ -
+
+
+
+
+ -
+
+
+
+
+ -
+
+
+
+
+ -
+
+
+ -
+
+
+ -
+
+
+ -
+
+
+ -
+
+
+
+
+ -
+
+
+ -
+
+
+
+
+
\ No newline at end of file
diff --git a/.idea/vcs.xml b/.idea/vcs.xml
new file mode 100644
index 00000000..94a25f7f
--- /dev/null
+++ b/.idea/vcs.xml
@@ -0,0 +1,6 @@
+
+
+
+
+
+
\ No newline at end of file
diff --git a/Hackerrank/Hackerrank/IF_ELSE.java b/Hackerrank/Hackerrank/IF_ELSE.java
new file mode 100644
index 00000000..a178a1d6
--- /dev/null
+++ b/Hackerrank/Hackerrank/IF_ELSE.java
@@ -0,0 +1,22 @@
+package Hackerrank;
+
+import java.util.*;
+
+public class IF_ELSE {
+
+ private static final Scanner scanner = new Scanner(System.in);
+
+ public static void main(String[] args) {
+ int N = scanner.nextInt();
+ scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
+
+ if(N%2!=0){
+ System.out.print("Weird");
+
+ }else if( N%2==0 && N>=2 && N<=5 ){System.out.println("Not Weird");}
+ else if(N%2==0 && N>=6 && N<=20 ){System.out.println("Weird");}
+ else if(N%2==0 && N>20){System.out.println("Not Weird");}
+ scanner.close();
+ }
+}
+
diff --git a/LeetCode/Solution.java b/LeetCode/Solution.java
new file mode 100644
index 00000000..0faba19b
--- /dev/null
+++ b/LeetCode/Solution.java
@@ -0,0 +1,28 @@
+package LeetCode;
+
+
+
+public class Solution {
+ public int[] twoSum(int[] nums, int target) {
+
+ int a=0;
+
+ for (int i = 0; i < nums.length-1; i++) {
+
+ if(nums[i]+nums[i+1]==target){
+ a=i;
+ break;
+ }
+ if(a==i) {
+ System.out.println("["+a + "," + (a + 1)+"]");
+ }
+ }
+ return new int[]{};
+
+ }
+
+ public static void main(String[] args) {
+Solution s=new Solution();
+//s.twoSum();
+ m }
+}
\ No newline at end of file
diff --git a/out/production/Hacktoberfest/Binary Search.cpp b/out/production/Hacktoberfest/Binary Search.cpp
new file mode 100644
index 00000000..2b6fc8cc
--- /dev/null
+++ b/out/production/Hacktoberfest/Binary Search.cpp
@@ -0,0 +1,44 @@
+#include
+using namespace std;
+//funtion for implementing binary search
+int binarySearch(int *input,int beg,int end,int number){
+ if(beg>end){
+ return -1;
+ }
+ int mid = (beg+end)/2;
+ if(number == input[mid]){
+ return mid;
+ }
+ //Search left sub array
+ if(number>n;
+ // Create An array Of size n Dynamically
+ int *input = new int[n];
+ //Take Input Array in Ascending Order
+ for(int i=0;i>input[i];
+ }
+ //Take number to be searched
+ cin>>number;
+ //call the recursive function
+ int index = binarySearch(input,0,n-1,number);
+ if(index!=-1){
+ cout<
+
+using namespace std;
+
+vector split_string(string);
+
+/*
+ * Complete the candlesCounting function below.
+ */
+int candlesCounting(int k, vector> candles) {
+ /*
+ * Write your code here.
+ */
+
+}
+
+int main()
+{
+ ofstream fout(getenv("OUTPUT_PATH"));
+
+ string nk_temp;
+ getline(cin, nk_temp);
+
+ vector nk = split_string(nk_temp);
+
+ int n = stoi(nk[0]);
+
+ int k = stoi(nk[1]);
+
+ vector> candles(n);
+ for (int candles_row_itr = 0; candles_row_itr < n; candles_row_itr++) {
+ candles[candles_row_itr].resize(2);
+
+ for (int candles_column_itr = 0; candles_column_itr < 2; candles_column_itr++) {
+ cin >> candles[candles_row_itr][candles_column_itr];
+ }
+
+ cin.ignore(numeric_limits::max(), '\n');
+ }
+
+ int result = candlesCounting(k, candles);
+
+ fout << result << "\n";
+
+ fout.close();
+
+ return 0;
+}
+
+vector split_string(string input_string) {
+ string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) {
+ return x == y and x == ' ';
+ });
+
+ input_string.erase(new_end, input_string.end());
+
+ while (input_string[input_string.length() - 1] == ' ') {
+ input_string.pop_back();
+ }
+
+ vector splits;
+ char delimiter = ' ';
+
+ size_t i = 0;
+ size_t pos = input_string.find(delimiter);
+
+ while (pos != string::npos) {
+ splits.push_back(input_string.substr(i, pos - i));
+
+ i = pos + 1;
+ pos = input_string.find(delimiter, i);
+ }
+
+ splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));
+
+ return splits;
+}
diff --git a/out/production/Hacktoberfest/DiscountFinder.cpp b/out/production/Hacktoberfest/DiscountFinder.cpp
new file mode 100644
index 00000000..d0877d20
--- /dev/null
+++ b/out/production/Hacktoberfest/DiscountFinder.cpp
@@ -0,0 +1,46 @@
+#include
+#include
+#include
+
+double off(float billPrice, float disc);
+
+int main()
+{
+ system("color 0A");
+ using namespace std;
+
+ float billPrice;
+
+ cout << "\nEnter the bill value\n";
+ cin >> billPrice;
+
+ if (billPrice >= 2000)
+ {
+ if (billPrice >= 5000)
+ {
+ if (billPrice >= 10000)
+ cout << "\nYou got a discount of 10%. \nYour net payment is " << off(billPrice, 10) << '\n';
+ else
+ cout << "\nYou got a discount of 5%. \nYour net payment is " << off(billPrice, 5) << '\n';
+ }
+ else
+ cout << "\nYou got a discount of 2%. \nYour net payment is " << off(billPrice, 2) << '\n';
+ }
+ else
+ cout << "\nSorry! You couldn't receive any discount on this bill. \nYour net payment is " << off(billPrice, 0) << '\n';
+
+ system("pause");
+
+ return 0;
+
+}
+
+double off(float billPrice, float disc)
+{
+ float netPrice;
+
+ netPrice = billPrice - ((billPrice / 100) * disc);
+
+ return (netPrice);
+
+}
diff --git a/out/production/Hacktoberfest/HelloWorld.py b/out/production/Hacktoberfest/HelloWorld.py
new file mode 100644
index 00000000..64521851
--- /dev/null
+++ b/out/production/Hacktoberfest/HelloWorld.py
@@ -0,0 +1,2 @@
+if __name__ == '__main__':
+ print("Hello, World!")
\ No newline at end of file
diff --git a/out/production/Hacktoberfest/MinMax.py b/out/production/Hacktoberfest/MinMax.py
new file mode 100644
index 00000000..e5163be6
--- /dev/null
+++ b/out/production/Hacktoberfest/MinMax.py
@@ -0,0 +1,7 @@
+m=input()
+arr=m.split(" ")
+arrInt=list(map(int,arr))
+sum=0
+for i in arrInt:
+ sum+=i
+print(sum-max(arrInt),sum-min(arrInt))
diff --git a/out/production/Hacktoberfest/SOLVE_ME_FIRST.javascript b/out/production/Hacktoberfest/SOLVE_ME_FIRST.javascript
new file mode 100644
index 00000000..32ffdf10
--- /dev/null
+++ b/out/production/Hacktoberfest/SOLVE_ME_FIRST.javascript
@@ -0,0 +1,32 @@
+process.stdin.resume();
+process.stdin.setEncoding('ascii');
+
+var input_stdin = "";
+var input_stdin_array = "";
+var input_currentline = 0;
+
+process.stdin.on('data', function (data) {
+ input_stdin += data;
+});
+
+process.stdin.on('end', function () {
+ input_stdin_array = input_stdin.split("\n");
+ main();
+});
+
+function readLine() {
+ return input_stdin_array[input_currentline++];
+}
+
+function solveMeFirst(a, b) {
+ return a + b;
+}
+
+
+function main() {
+ var a = parseInt(readLine());
+ var b = parseInt(readLine());;
+
+ var res = solveMeFirst(a, b);
+ console.log(res);
+}
diff --git a/out/production/Hacktoberfest/Smiley_pattern.cpp b/out/production/Hacktoberfest/Smiley_pattern.cpp
new file mode 100644
index 00000000..b33a281b
--- /dev/null
+++ b/out/production/Hacktoberfest/Smiley_pattern.cpp
@@ -0,0 +1,15 @@
+#include
+#include
+void main()
+{ clrscr();
+ int n;
+ cout<<"Enter the number of rows =";
+ cin>>n;
+ char ch=1;
+ for(int i=0,i
+
+using namespace std;
+
+vector split_string(string);
+
+// Complete the countApplesAndOranges function below.
+void countApplesAndOranges(int s, int t, int a, int b, vector apples, vector oranges,int m,int n) {
+ int apple=0,orange=0;
+ for(int i=0;i=s && (apples[i]+a)<=t)
+ {
+ apple++;
+ }
+
+ }
+
+ for(int i=0;i0)
+ continue;
+ if((b+oranges[i])>=s && (b+oranges[i])<=t)
+ {
+ orange++;
+ }
+
+ }
+ cout< st = split_string(st_temp);
+
+ int s = stoi(st[0]);
+
+ int t = stoi(st[1]);
+
+ string ab_temp;
+ getline(cin, ab_temp);
+
+ vector ab = split_string(ab_temp);
+
+ int a = stoi(ab[0]);
+
+ int b = stoi(ab[1]);
+
+ string mn_temp;
+ getline(cin, mn_temp);
+
+ vector mn = split_string(mn_temp);
+
+ int m = stoi(mn[0]);
+
+ int n = stoi(mn[1]);
+
+ string apples_temp_temp;
+ getline(cin, apples_temp_temp);
+
+ vector apples_temp = split_string(apples_temp_temp);
+
+ vector apples(m);
+
+ for (int i = 0; i < m; i++) {
+ int apples_item = stoi(apples_temp[i]);
+
+ apples[i] = apples_item;
+ }
+
+ string oranges_temp_temp;
+ getline(cin, oranges_temp_temp);
+
+ vector oranges_temp = split_string(oranges_temp_temp);
+
+ vector oranges(n);
+
+ for (int i = 0; i < n; i++) {
+ int oranges_item = stoi(oranges_temp[i]);
+
+ oranges[i] = oranges_item;
+ }
+
+ countApplesAndOranges(s, t, a, b, apples, oranges,m,n);
+
+ return 0;
+}
+
+vector split_string(string input_string) {
+ string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) {
+ return x == y and x == ' ';
+ });
+
+ input_string.erase(new_end, input_string.end());
+
+ while (input_string[input_string.length() - 1] == ' ') {
+ input_string.pop_back();
+ }
+
+ vector splits;
+ char delimiter = ' ';
+
+ size_t i = 0;
+ size_t pos = input_string.find(delimiter);
+
+ while (pos != string::npos) {
+ splits.push_back(input_string.substr(i, pos - i));
+
+ i = pos + 1;
+ pos = input_string.find(delimiter, i);
+ }
+
+ splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));
+
+ return splits;
+}
diff --git a/out/production/Hacktoberfest/array-left-rotation.cpp b/out/production/Hacktoberfest/array-left-rotation.cpp
new file mode 100644
index 00000000..ebbbc647
--- /dev/null
+++ b/out/production/Hacktoberfest/array-left-rotation.cpp
@@ -0,0 +1,20 @@
+#include
+
+using namespace std;
+
+int main() {
+ int n, k;
+ scanf("%d %d", &n, &k);
+
+ int arr[n];
+ for (int i = 0; i < n; i++)
+ cin >> arr[i];
+
+ for (int j = k; j < n; j++)
+ cout << arr[j] << " ";
+
+ for (int p = 0; p < k; p++)
+ cout << arr[p] << " ";
+
+ return 0;
+}
diff --git a/out/production/Hacktoberfest/arrays-ds.cpp b/out/production/Hacktoberfest/arrays-ds.cpp
new file mode 100644
index 00000000..cfb167cb
--- /dev/null
+++ b/out/production/Hacktoberfest/arrays-ds.cpp
@@ -0,0 +1,39 @@
+#include