Posts

First & Last X Digits

Java code: import java.util.*; public class Hello {     public static void main(String[] args) {         //Your Code Here Scanner s=new Scanner(System.in); String st; int x,l,m=0,f=0; st=s.next(); char ch[]=st.toCharArray(); x=s.nextInt(); l=ch.length-x; for(int i=0;i<ch.length;i++) {     if(ch[i]!='0'||f==1)     {         if(m<x)         {             f=1;             System.out.print(ch[i]);             m++;         }     } } System.out.println(); for(int i=l;i<ch.length;i++) System.out.print(ch[i]);     } }

Odd Numbers - Reversed Order

C Code: #include<stdio.h> #include <stdlib.h> int main() { int n; scanf("%d",&n); int a[n],i,j; for(i=0;i<n;i++) {     scanf("%d",&a[i]); } for(i=n-1;i>=0;i--) {     if(a[i]%2!=0)     {         printf("%d ",a[i]);     } } } Java code: import java.util.*; public class Hello {     public static void main(String[] args) {         //Your Code Here Scanner s=new Scanner(System.in); int n=s.nextInt(); int a[]=new int [n]; for(int i=0;i<n;i++) a[i]=s.nextInt(); for(int i=n-1;i>=0;i--) {     if(a[i]%2!=0)     System.out.print(a[i]+" "); }     } } C++ code: #include <iostream> using namespace std; int main() { int n,i; cin>>n; int a[n]; for(i=0;i<n;i++) {     cin>>a[i]; } for(i=n-1;i>=0;i--) { ...

Sum Of First and Last Alternate Elements

Image
  Java code: import java.util.*; public class Hello {     public static void main(String[] args) {         //Your Code Here Scanner s=new Scanner(System.in); int n,l=1; n=s.nextInt(); int a[]=new int[n]; for(int i=0;i<n;i++) a[i]=s.nextInt(); for(int i=0;i<n/2;i++) { System.out.print(a[i]+a[n-l]+" "); l++; }     } }

Digits Printer

Image
Java Code: import java.util.*; public class Hello {     public static void main(String[] args) { Scanner sc=new Scanner(System.in); String s=sc.next(); char ch[]=s.toCharArray(); int i,j,k,l=s.length(); Arrays.sort(ch); for(i=l-1;i>0;i--)     System.out.print(ch[i]); if(ch[0]!='0'&&ch[1]!='0')     System.out.print(ch[0]); else if(ch[0]=='0'&&ch[1]!='0') System.out.print(ch[0]); } }

Username Domain Extension

Image
Java Code: Method I: import java.util.*; public class Hello {     public static void main(String[] args) { String s; Scanner sc=new Scanner(System.in); s=sc.next(); int a=0,b=0,l=s.length(),i; for(i=0;i<l;i++) {     if(s.charAt(i)=='@')     {         a=i;     }     if(s.charAt(i)=='.')     b=i; } for(i=b+1;i<l;i++) System.out.print(s.charAt(i)); System.out.println(); for(i=a+1;i<b;i++) System.out.print(s.charAt(i)); System.out.println(); for(i=0;i<a;i++) System.out.print(s.charAt(i)); } } Method II: import java.util.*; public class Hello {     public static void main(String[] args) { Scanner s=new Scanner(System.in);         String str=s.nextLine();         String ch[]=str.split("@|\\.");         for...

Maximum Product

Image
C code: #include<stdio.h> #include <stdlib.h> int main() { int n,i,j,temp; scanf("%d",&n); int a[n]; for(i=0;i<n;i++) {     scanf("%d ",&a[i]); } for(i=0;i<n;i++) {     for(j=i+1;j<n;j++)     {         if(a[i]>a[j])         {             temp=a[i];             a[i]=a[j];             a[j]=temp;         }     } } if(a[0]*a[1]>a[n-1]*a[n-2]) {     printf("%d %d",a[0],a[1]); } else printf("%d %d",a[n-2],a[n-1]); } Java Code: import java.util.*; public class Hello {     public static void main(String[] args) {         Scanner s...

Two Strings - L Joint

Image
Java Code: import java.util.*; public class Hello {     public static void main(String[] args) {         //Your Code Here Scanner s=new Scanner(System.in); String str,st; str=s.next(); st=s.next(); char ch[]=str.toCharArray(); char c[]=st.toCharArray(); int a=ch.length,b=c.length,n=0,n1=0,count=0,q,w; char c1[]=new char[a+b]; for(int i=0;i<a;i++) {     c1[i]=ch[i];     count++; } for(int i=0;i<b;i++) {     c1[count]=c[i];     count++; } if(ch[a-1]==c[0]) {     n=a;     n1=b;     q=0;     w=1; } else {     n=b;     n1=a;     q=a;     w=0; } for(int i=0;i<n-1;i++) {     for(int j=0;j<n1;j++)     {         if(j==0)         System.out.print(c1[q]); ...