- Trending Categories
Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Kiran P has Published 123 Articles
![Kiran P](https://www.tutorialspoint.com/assets/profiles/270934/profile/60_284346-1604569411.jpg)
Kiran P
166 Views
Given an array of positive integers, the task is to erase a subarray containing all the unique elements. What you get by erasing the subarray is equal to the sum of its elements.Return the maximum sum of the current subarray by erasing the terms before or after it, we can ... Read More
![Kiran P](https://www.tutorialspoint.com/assets/profiles/270934/profile/60_284346-1604569411.jpg)
Kiran P
481 Views
ExamplesInput num = 5 => 101 & 1 = 001 => True, i.e., Odd; else num would be Even.Approach to solve this problemStep 1: Define a method that accepts a number.Step 2: Perform & operation with that number.Step 3: If the & operator returns a non-zero value, then that number would ... Read More
![Kiran P](https://www.tutorialspoint.com/assets/profiles/270934/profile/60_284346-1604569411.jpg)
Kiran P
264 Views
There are two methods in which we can solve this problem. Let’s check the first method.Method 1ExamplesInput Array = [1, 0, 1, 0, 1, 0, 0, 1] => [0, 0, 0, 0, 1, 1, 1, 1]Approach to solve this problemStep 1: Define a method that accepts an array.Step 2: Count number of ... Read More
![Kiran P](https://www.tutorialspoint.com/assets/profiles/270934/profile/60_284346-1604569411.jpg)
Kiran P
5K+ Views
ExamplesInput Array = [1, 3, 5, 6, 1] => Duplicate element is 1;Input Array = [1, 3, 5, 6, 7] => return -1Approach to solve this problemStep 1: Define a method that accepts an array.Step 2: Declare a visited map.Step 3: Iterate the given array. If the element exists in the visited ... Read More
![Kiran P](https://www.tutorialspoint.com/assets/profiles/270934/profile/60_284346-1604569411.jpg)
Kiran P
515 Views
We can solve this problem in two different ways. Let’s check the first method.Method 1: ExamplesInput Array = [1, 2, 3, 4, 4] => Range is from 1 to 5 but 4 is a duplicate element in this range.Approach to solve this problemStep 1: Define a method that accepts an array.Step 2: Declare ... Read More
![Kiran P](https://www.tutorialspoint.com/assets/profiles/270934/profile/60_284346-1604569411.jpg)
Kiran P
473 Views
ExamplesInput Array = [1, 3, 5, 7, 8, 9], sum = 11 => (3, 8)Approach to solve this problemStep 1: Define a method that accepts an array and sum.Step 2: Define a mapping variable, type map[int]int.Step 3: Iterate the given array as i.Step 4: If key in mapping sum-arr[i] is not present, ... Read More
![Kiran P](https://www.tutorialspoint.com/assets/profiles/270934/profile/60_284346-1604569411.jpg)
Kiran P
195 Views
ExamplesInput Array = [1, 3, 5, 7, 8, 9], sum = 11 => (3, 8)Approach to solve this problemStep 1: Define a method that accepts an array and sum.Step 2: Sort the given array, declare low:=0 and high:=size-1 variables.Step 3: Iterate a for loop until low sum, then high--.Step 5: At ... Read More
![Kiran P](https://www.tutorialspoint.com/assets/profiles/270934/profile/60_284346-1604569411.jpg)
Kiran P
414 Views
ExamplesInput Array = [4, 1, 6, 8, 7, 2, 3], sum = 11 => (4, 7) or (8, 3)Approach to solve this problemStep 1: Define a method that accepts an array and sum.Step 2: Iterate from 0 to n as i.Step 3: Again, iterate a for loop from i+1 to n-1 as ... Read More
![Kiran P](https://www.tutorialspoint.com/assets/profiles/270934/profile/60_284346-1604569411.jpg)
Kiran P
489 Views
ExamplesInput Array = [1, 3, 4, 3, 2, 3, 4, 0, 2]Element13420Frequency13221Approach to solve this problemStep 1: Define a method that accepts an array.Step 2: Define a map, where key would be the array’s elements and the starting value is 0.Step 3: Start iterating the input array. If an element is present ... Read More
Write a Golang program to check whether a given array is sorted or not (Using Bubble Sort Technique)
![Kiran P](https://www.tutorialspoint.com/assets/profiles/270934/profile/60_284346-1604569411.jpg)
Kiran P
291 Views
ExamplesInput arr = [7, 15, 21, 26, 33] => Array is already sorted.Input arr = [7, 5, 1, 6, 3] => Array is not sorted.Approach to solve this problemStep 1: Iterate the array from the 0th index to n-1.Step 2: Iterate the array from the 0th index to n-1-i, where ... Read More