Java Program
Java Program
// WAP to collect all negative elements at left and all positive at rh+ side of
array
e.g.
Input Array:
34 -4 23 9 -2 201 -11 85 -34 -1
Processed array:
-4 -2 -11 -34 -1 34 23 9 201 85
===================================================================================
=====
x
{ 23,-5,89,12,9 }
y
{ 9,-34,12,100,-5 }
Intersection:
{ -5, 12, 9 }
===================================================================================
========
// WAP to merge the two different arrays in a such way that there should not be
// any duplicate element.
===================================================================================
==================
Enter the array of +ve and -ve elements, and find series of elements
having summation zero.
2 5 -3 -4 9 -3 -5 1 4
2 5 -3 -4
5 -3 -4 9 -3 -5 1
-5 1 4
===================================================================================
===============
// WAP to find the contiguous increasing subsequnce in array
2 7 23 89
90 190 255
===================================================================================
==================
// WAP to store the runs scored by 3 player in 5 matches and display all runs
with total
===================================================================================
==================
// WAP to convert the string into uppercase
===================================================================================
======================
// reverse copy, reverse at same location
===================================================================================
==============
WAP to display the starting character of each word from entered string.
WAP to display the starting character of each word from entered string and word
count.
===================================================================================
==============
// WAP to convert the string in to title case
// WAP to interchanger first and last character of each word from string.
===================================================================================
================
// WAP to find the all lowercase missing alphabets from lowercase string.
===================================================================================
=================
e.g.
// Enter any number and count the even digits in that number
e.g.
no=34562, Even Digit Count: 3
===================================================================================
=
===================================================================================
========
// Enter any no and add the even and odd digits from it separately
24385 ==> 5 + 3 = 8
8 + 4 + 2 = 14
===================================================================================
========
// Enter the number and add the alternate digit from it.
================================================================================
// WAP to find the rep of each digit 188311 --> - 1 rep 3 times
- 8 rep 2 times
==================================================================================
===================================================================================
// WAP to generate the max number using the digits of entered number
===================================================================================
============