Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number of elements in nums which are not equal to val. Consider the number of elements in nums which are not equal to val be k, to get accepted, you need to do the following things: Custom Judge: The judge will test your …
You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Merge nums1 and nums2 into a single array sorted in non-decreasing order. The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the …
A string to be valid if all characters of the string appear the same number of times Input : aabbcc Output: valid Code
Rearrange array in alternating positive & negative items Input: arr[] = {1, 2, 3, -4, -1, 4} Output : // Output: arr[] = {-4, 1, -1, 2, 3, 4} Code
1. Implement the stack 2. Get Min value in stack with o(1) 3. Improve space complexity as well Code
Find the non-distinct value in a given array Input : {1,1,2,2,3,4,4} Output : 3 Code
If the given input is a palindrome, Print it as it is, if not reverse the string and print. Input : abcd Output: dcba The question is hidden with the meaning of not doing complex things and understanding them clearly. Answer: whatever the input, just need to reverse the string. Code:
Given an array of input, print the value based on the sequence of occurrence Input : [0,1,2,3,0,0,2,2,3,0] Output: [0,0,0,0,1,2,2,2,3,3] Code:
Find a pair that match to the given value x from the input array. Input : [1,5,10,3,4] X=15 Output: [5,10] Code:
Given a array of input, sort it based on the number of occurrence count Input : [8,0,1,5,5,3,3,3] Output : [0,1,8,5,5,3,3,3] Code:
