From d25ffcdf26154fd42702d9814e7f3e0afa0f7db5 Mon Sep 17 00:00:00 2001 From: puru-vishnoi <84972298+puru-vishnoi@users.noreply.github.com> Date: Thu, 28 Oct 2021 00:30:07 +0530 Subject: [PATCH 1/6] Create gcd of two numbres --- Maths/gcd of two numbres | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 Maths/gcd of two numbres diff --git a/Maths/gcd of two numbres b/Maths/gcd of two numbres new file mode 100644 index 00000000..24da8918 --- /dev/null +++ b/Maths/gcd of two numbres @@ -0,0 +1,29 @@ +// Java program to find GCD of two numbers +class Test +{ + // Recursive function to return gcd of a and b + static int gcd(int a, int b) + { + // Everything divides 0 + if (a == 0) + return b; + if (b == 0) + return a; + + // base case + if (a == b) + return a; + + // a is greater + if (a > b) + return gcd(a-b, b); + return gcd(a, b-a); + } + + // Driver method + public static void main(String[] args) + { + int a = 98, b = 56; + System.out.println("GCD of " + a +" and " + b + " is " + gcd(a, b)); + } +} From fc5d99f36e9320c7298029714fc94cf1063507cd Mon Sep 17 00:00:00 2001 From: puru-vishnoi <84972298+puru-vishnoi@users.noreply.github.com> Date: Thu, 28 Oct 2021 00:34:23 +0530 Subject: [PATCH 2/6] Create fibonacci numbers.js --- fibonacci numbers.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 fibonacci numbers.js diff --git a/fibonacci numbers.js b/fibonacci numbers.js new file mode 100644 index 00000000..77df17e0 --- /dev/null +++ b/fibonacci numbers.js @@ -0,0 +1,15 @@ + From 5eab3970c04d8e8c026987291f6dd415077f91a2 Mon Sep 17 00:00:00 2001 From: puru-vishnoi <84972298+puru-vishnoi@users.noreply.github.com> Date: Thu, 28 Oct 2021 00:40:49 +0530 Subject: [PATCH 3/6] Create Largest Rectangle in Histogram.java --- Largest Rectangle in Histogram.java | 65 +++++++++++++++++++++++++++++ 1 file changed, 65 insertions(+) create mode 100644 Largest Rectangle in Histogram.java diff --git a/Largest Rectangle in Histogram.java b/Largest Rectangle in Histogram.java new file mode 100644 index 00000000..90e08920 --- /dev/null +++ b/Largest Rectangle in Histogram.java @@ -0,0 +1,65 @@ +class Solution { + public int largestRectangleArea(int[] arr) { + int n= arr.length; + int l[] = new int[n]; +int r[] = new int[n]; + +// int n = sc.nextInt(); +for(int i=0; i st = new Stack(); +for(int i=0; i=0; i-- ) { + + +if(st.empty()){ + st.push(i); + +} +else{ +while(!st.empty() && arr[i] Date: Thu, 28 Oct 2021 00:43:05 +0530 Subject: [PATCH 4/6] Create Remove Linked List Elements.java --- Remove Linked List Elements.java | 36 ++++++++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 Remove Linked List Elements.java diff --git a/Remove Linked List Elements.java b/Remove Linked List Elements.java new file mode 100644 index 00000000..946db400 --- /dev/null +++ b/Remove Linked List Elements.java @@ -0,0 +1,36 @@ +/** + * Definition for singly-linked list. + * public class ListNode { + * int val; + * ListNode next; + * ListNode() {} + * ListNode(int val) { this.val = val; } + * ListNode(int val, ListNode next) { this.val = val; this.next = next; } + * } + */ +class Solution { + public ListNode removeElements(ListNode head, int val) { + if(head== null) return head; + ListNode prev= null; + ListNode curr= head; + while(curr!= null){ + if(curr.val==val){ + if(curr==head){ + head= curr.next; + curr= head; + } + else{ + prev.next= curr.next; + curr= curr.next; + + } + } + else{ + prev= curr; + curr= curr.next; + + } + } + return head; + } +} From ed106ba50423428cd5d78231f15735e5953c38bc Mon Sep 17 00:00:00 2001 From: puru-vishnoi <84972298+puru-vishnoi@users.noreply.github.com> Date: Thu, 28 Oct 2021 00:46:53 +0530 Subject: [PATCH 5/6] Create Find First and Last Position of Element in Sorted Array --- ...d Last Position of Element in Sorted Array | 41 +++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 Find First and Last Position of Element in Sorted Array diff --git a/Find First and Last Position of Element in Sorted Array b/Find First and Last Position of Element in Sorted Array new file mode 100644 index 00000000..03511349 --- /dev/null +++ b/Find First and Last Position of Element in Sorted Array @@ -0,0 +1,41 @@ +class Solution { + public int[] searchRange(int[] nums, int target) { + int ans[] = new int[2]; + ans[0] = firstOcc(nums, target); + ans[1] = lastOcc(nums, target); + return ans; + } + int firstOcc(int arr[], int target){ + int index = -1; + int l = 0, r = arr.length - 1; + int mid; + while(l <= r){ + mid = (l + r)/2; + if(target == arr[mid]) + index = mid; + if(target <= arr[mid]) + r = mid - 1; + else + l = mid + 1; + + } + return index; + } + + int lastOcc(int arr[], int target){ + int index = -1; + int l = 0, r = arr.length - 1; + int mid; + while(l <= r){ + mid = (l + r)/2; + if(target == arr[mid]) + index = mid; + if(target >= arr[mid]) + l = mid + 1; + else + r = mid - 1; + + } + return index; + } +} From 47d90a11b53125dd326c2990db4a63797b639d98 Mon Sep 17 00:00:00 2001 From: puru-vishnoi <84972298+puru-vishnoi@users.noreply.github.com> Date: Thu, 28 Oct 2021 00:49:15 +0530 Subject: [PATCH 6/6] Create Maximum Profit of Operating a Centennial Wheel --- ...mum Profit of Operating a Centennial Wheel | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 Maximum Profit of Operating a Centennial Wheel diff --git a/Maximum Profit of Operating a Centennial Wheel b/Maximum Profit of Operating a Centennial Wheel new file mode 100644 index 00000000..0ad40e7f --- /dev/null +++ b/Maximum Profit of Operating a Centennial Wheel @@ -0,0 +1,32 @@ +lass Solution { +public: + int minOperationsMaxProfit(vector& customers, int boardingCost, int runningCost) { + int c=0; + int rem=0; + int r=0; + int ans=0; + int p_max=-1; + for(int i=0;ip_max){ + p_max=p; + ans=r; + } + } + if(customers.size()==1) + return -1; + + return p_max<0?-1:ans; + } +};