chanthini
BAN USERint a[]= {1,2,3,4,5,6,2,6};
int n =2;
List<Integer> m = new ArrayList<Integer>();
int i =0;
while(i<a.length)
{
if(a[i]==n)
{
m.add(i);
i++;
}
i++;
}
m.sort(null);
System.out.println("First Occurance is:"+m.get(0));
System.out.println("Last Occurance is:"+m.get(m.size()-1));
String test ="(())()(())";
HashMap<Character, Integer> h= new HashMap<Character,Integer>();
for(int i=0;i<test.length();i++)
{
if(!h.containsKey(test.charAt(i)))
h.put(test.charAt(i), 1);
else
h.put(test.charAt(i), h.get(test.charAt(i))+1);
}
int firstcount=0,secondcount=0;
for(Map.Entry<Character,Integer> m : h.entrySet() )
{
if(m.getKey()=='(')
{
firstcount=m.getValue();
}
else if(m.getKey()==')')
secondcount=m.getValue();
}
if(firstcount==secondcount)
System.out.println("valid expression");
else
System.out.println("Invalid Expression");
String t="HELLO WORLD!";
HashMap<Character,Integer> m =new HashMap();
for(int i=0;i<t.length();i++)
{
if(!m.containsKey(t.charAt(i)))
m.put(t.charAt(i), 1);
else
m.put(t.charAt(i), m.get(t.charAt(i))+1);
}
int maxList = Collections.max(m.values());
for(Map.Entry<Character, Integer> d : m.entrySet())
{
if(d.getValue().equals(maxList))
{
System.out.println(d.getKey());
}
}
package Careercup;
import java.util.Arrays;
import java.util.Collections;
public class MaxCOnsecutiveOnes {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] a= {0,0,1,1,1,0,0,1,1,0};
Boolean isStart=false;
Boolean isEnd=false;
int[] c=new int[a.length];
int j=0;
int count=0;
for( int i=0;i<a.length;i++)
{
if(a[i]==1&& isStart==false)
{
isStart=true;
count++;
}
else if(a[i]==1 &&isStart==true &&isEnd==false)
{
count++;
}
else if(a[i]!=1 && isStart==true)
{
isEnd=true;isStart=false;
c[j]=count;
count=0;
j++;
}
else if(a[i]==1 && isEnd==true)
{
isStart=true;isEnd=false;
count++;
}
}
int k=0,max=0;
while(k<c.length)
{
if(c[k]>max)
{
max=c[k];
}
k++;
}
System.out.println(max);
}
}
package Careercup;
import java.util.Arrays;
public class SortAndMerge {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] a= {10,12,14,15};
int[] b= {2,3,1,4};
int[] c=new int[a.length+b.length];
Arrays.sort(a);
Arrays.sort(b);
int i=0,j=0,m=0;
while(i<a.length&&j<b.length)
{
if(a[i]>b[j])
{
c[m]=b[j];
j++;m++;
}
else if(a[i]<b[j])
{
c[m]=a[i];
m++;i++;
}
else if(a[i]==b[j])
{
c[m]=a[i];
m++;i++;j++;
}
}
while(i<a.length)
{
c[m]=a[i];
m++;i++;
}
while(j<b.length)
{
c[m]=b[j];
m++;j++;
}
for( int s=0;s<c.length;s++)
System.out.println(c[s]);
}
}
int[] a= {-1,-2,-3,4,3,-4,5,6,7,9,-9};
- chanthini March 31, 2020int count=0;
Boolean isstart=false,isend=false;
List<Integer> m = new ArrayList<Integer>();
for(int i=0;i<a.length;i++)
{
if(a[i]>0 )
{
isstart=true;
count++;
}
if(a[i]<0 && isstart==true )
{
isend=true;
isstart=false;
m.add(count);
count=0;
}
//count=0;
}
m.sort(null);
System.out.println(m.get(m.size()-1));
}