[Solved] Copy Arrays Contest Problem
![[Solved] Copy Arrays Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Copy-Arrays-Contest-Problem.png "[Solved] Copy Arrays Contest Problem")
Copy Arrays: Given an Array ‘Arr’ of size ‘N’, a subarray is called a copy array if it contains at least 1 element that occurs more than once. Find the maximum number of copy arrays that can be formed by…
RealCoder
Empowering coders, one solution at a time
RealCoder
Empowering coders, one solution at a time
Data Structure
[Solved] Gap Contest Problem
![[Solved] Gap Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Gap-Contest-Problem.png "[Solved] Gap Contest Problem")
Gap: Ninja is given an array ‘A’ of size ‘N’. Where the ‘ith’ element represents the marks of the ‘ith’ student. Ninja is a depressed boy who always secures the last position in his class. He always compares himself with…
[Solved] Equally Happy Contest Problem
![[Solved] Equally Happy Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Equally-Happy-Contest-Problem.png "[Solved] Equally Happy Contest Problem")
Equally Happy: Ninja has ‘N’ friends, and it’s the Ninjafest again. A person is ‘K’ units happy if he/she receives ‘K’ candy as a gift. Ninja has exactly ‘M’ candies. Your task is to tell if Ninja can make all…
[Solved] Searching Algorithms Problem
![[Solved] Searching Algorithms Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Searching-Algorithms-Problem.png "[Solved] Searching Algorithms Problem")
Searching Algorithms: Linear Search, Binary Search, and Ternary Search. 1. Search an Element in an array Given an integer array and another integer element. The task is to find if the given element is present in array or not. Example 1:…
[Solved] First and Last Position of an Element In Sorted Array
![[Solved] First and Last Position of an Element In Sorted Array](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-First-and-Last-Position-of-an-Element-In-Sorted-Array.png "[Solved] First and Last Position of an Element In Sorted Array")
First and Last Position of an Element In Sorted Array: You have been given a sorted array/list ARR consisting of ‘N’ elements. You are also given an integer ‘K’. Now, your task is to find the first and last occurrence…
[Solved] Peak Index in a Mountain Array LeetCode Problem in Java
![[Solved] Peak Index in a Mountain Array LeetCode Problem in Java](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Peak-Index-in-a-Mountain-Array-LeetCode-Problem-in-Java.png "[Solved] Peak Index in a Mountain Array LeetCode Problem in Java")
Peak Index in a Mountain Array: Let’s call an array arr a mountain if the following properties hold: arr.length >= 3 There exists some i with 0 < i < arr.length – 1 such that: arr[0] < arr[1] < … arr[i-1] < arr[i] arr[i] > arr[i+1] > … >…
[Solved] Average of String Contest Problem
![[Solved] Average of String Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Average-of-String-Contest-Problem.png "[Solved] Average of String Contest Problem")
Average of String: You are given a string S. You need to find the floor of average of the string.Average of string is given by AVG=(sum of ASCII values of all characters)/(length of string) Average of String Contest Input:The first…
[Solved] Doubly Linked List Conversion Contest Problem
![[Solved] Doubly Linked List Conversion Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Doubly-Linked-List-Conversion-Contest-Problem.png "[Solved] Doubly Linked List Conversion Contest Problem")
Doubly Linked List Conversion: Given a doubly linked with each of the previous pointer assigned to null. Your task is to assign previous pointer to each of previous nodes respectively. Doubly Linked List Conversion Contest Input Format :First line of…
MCQs Asymptotic Notations Worst, Average and Best Case Time Complexities
1. Let T(n) be defined by T(1) = 10 and T(n + 1) = 2n + T(n) and for all integers n ≥ 1 . Which of the following represents the order of growth of T(n) as a function of…
MCQs Asymptotic Notations Worst, Average and Best Case Time Complexities Analysis of Loops
1. What is the time complexity of fun()? int fun(int n) { int count = 0; for (int i = 0; i < n; i++) for (int j = i; j > 0; j–) count = count + 1; return…