Java Hyd Team – Telegram

Java Hyd Team

746 subscribers

986 photos

39 videos

670 files

690 links

https://teamhydteam.my.canva.site/

Can visit us on our website 😊
Still working on it 😊

Download Telegram

About

Blog

Apps

Platform

746 subscribers

public class ArmstrongNo1 {
public static void main(String[] arg) {
int i = 1, arm;
System.out.println("Armstrong numbers between 100 to 999");
while (i < 1000) {
arm = armstrongOrNot(i);
if (arm == i)
System.out.println(i);
i++;
}
}
static int armstrongOrNot(int num) {
int x, a = 0;
while (num != 0) {
x = num % 10;
a = a + (x * x * x);
num /= 10;
}
return a;
}
}

129 views14:05

import java.util.*;
public class ArmstrongNo2 {
public static void main(String[] arg) {
int a, arm = 0, n, temp;
Scanner sc = new Scanner(System.in);
System.out.println("Enter a number");
n = sc.nextInt();
temp = n;
for (; n != 0; n /= 10) {
a = n % 10;
arm = arm + (a * a * a);
}
if (arm == temp)
System.out.println(temp + " is a armstrong number ");
else
System.out.println(temp + " is not a armstrong number ");
}
}

128 views14:05

//import java.util.*;
//import static java.awt.font.NumericShaper.search;
public class Q24_1 {
public static void main(String[] args) {
// Scanner x = new Scanner(System.in);
//System.out.println(" enter 10 Digits ");
// int[] arr = new int[10];
// for (int i : arr) {
// arr[i] = x.nextInt();
int[] arr = {5, 6, 8, 9, 2, 4, 6, 1};
int toFind = 5;
boolean found = search(arr, toFind);
if (found)
System.out.println(toFind + " is found");
else
System.out.println(toFind + " is not found");
}
/*
* A method to search toFind in arr
* arr: the array to search
* toFind: the element to search
*/
public static boolean search(int[] arr, int toFind) {
int left = 0;
int right = arr.length - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (arr[mid] == toFind) {
return true;
} else if (arr[mid] < toFind) {
left = mid + 1;
} else {
right = mid - 1;
}
}
return false;
}
}

133 views14:07

public class Q25_1 {
public static void main(String[] args) {
int[] arr = {5, 6, 8, 9, 2, 4, 6, 1};
int left = 0, right = arr.length - 1;
while (left < right) {
while (arr[left] % 2 == 0 && left < right)
left++;
while (arr[right] % 2 == 1 && left < right)
right--;
if (left < right) {
int temp = arr[left];
arr[left] = arr[right];
arr[right] = temp;
left++;
right--;
}
}
System.out.println("Even numbers on left side and Odd numbers on right side: ");
for (int j : arr) System.out.print(j + " ");
// for (int i = 0; i < arr.length; i++)
// System.out.print(arr[i] + " ");
}
}

140 views14:08

public class Q26_1 {
public static void main(String[] args) {
int[]arr = {5,6,8,9,2,4,6,1};
int largest = arr[0];
int secondLargest = arr[0];
System.out.println("The given array is:");
for (int k : arr) {
System.out.print(k + "\t");
}
for (int j : arr) {
if (j > largest) {
secondLargest = largest;
largest = j;
} else if (j > secondLargest) {
secondLargest = j;
}
}
System.out.print("Second largest number is:" + secondLargest);
}
}

147 views14:08

public class Q29_1 {
static void printAllSubsets(int[] A, int K) {
int N = A.length;
for (int i = 0; i < (1 << N); i++) {
int sum = 0;
for (int j = 0; j < N; j++) {
if ((i & (1 << j)) > 0)
sum += A[j];
}
if (sum == K) {
for (int j = 0; j < N; j++) {
if ((i & (1 << j)) > 0)
System.out.print(A[j] + " ");
}
System.out.println();
}
}
}
public static void main(String[] args) {
int[] A = {0, 1, 2, 3, 5, 6, 7, 11, 12, 14, 20};
int K = 5;
printAllSubsets(A, K);
}
}

154 views14:09

public class Q29_2 {
public static void main(String[] args) {
int[] a = {0, 1, 2, 3, 5, 6, 7, 11, 12, 14, 20};
int n = 5;
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a.length; j++) {
if ((a[i] + a[j]) == n) {
System.out.println("[" + i + "," + j + "]");
}
}
}
}
}

158 views14:13

package com.Aman;
public class Q27_1 {
static int maxConsecutiveOnes(int x){
int count = 0;
while (x!=0) {
x = (x & (x << 1));
count++;
}
return count;
}
public static void main(String[] args) {
int x = 10000;
System.out.println(maxConsecutiveOnes(x));
}
}

173 views14:14

https://forms.gle/h4bqyzQtGqUk3LR6A FILL THIS FORM FOR TOMMORROWS MASTERCLASS TIMINGS 10AM-3PM WE WILL COVER EVERYTHING FROM SCRATCH TO ADVANCE LEVEL

Next week will be QUESTIONS and answer from basic to advanced level don't miss to be part of it

175 views18:28

December 11 😊😊

186 views18:29

Java Hyd Team pinned «December 11 😊😊»

18:29

import java.util.Scanner;

public class SwapSmallestLargestElement {

public static void main(String[] args) {

Scanner scanner = new Scanner(System.in);

int i, n;

System.out.println("Enter the size of array : ");
n = scanner.nextInt();

int arr[] = new int[n];

System.out.println("Enter the elements to be entered : ");
for(i=0;i<n;i++){
arr[i] = scanner.nextInt();
}

//Call a function Find maximum element of array
int maxElementPos = findMaxElement(arr,n);
System.out.println("The maximum element : "+ arr[maxElementPos]);

//Call a function Find minimum element of array
int minElementPos = findMinElement(arr,n);
System.out.println("The minimum element : "+ arr[minElementPos]);

//Call a function swap maximum and minimum element
swapMaxMinElement(arr, maxElementPos, minElementPos);

// Finally print array after swap
System.out.println("The array after swap is : ");
for(i=0;i<n;i++){
System.out.print(arr[i]+ " ");
}
}

//Find maximum element of array
public static int findMaxElement(int arr[],int n){
int i, pos=0;
int maxVal = arr[0];
for(i=0;i<n;i++){
if(arr[i]>maxVal){
maxVal = arr[i];
pos=i;
}
}
return pos;
}

//Find minimum element of array
public static int findMinElement(int arr[],int n){
int i, pos=0;
int minVal = arr[0];
for(i=0;i<n;i++){
if(arr[i] < minVal){
minVal = arr[i];
pos=i;
}
}
return pos;
}

//Swap maximum and minimum element
public static void swapMaxMinElement(int arr[], int maxElementPos, int minElementPos){

/*To swap max and min numbers, take a temporary variable, and follow the below step,
1) assign maximum number to temporary vaiable.
2) assign minimum number to maximum number.
3) asign temporary vaiable to minimum number*/

int temp;
temp = arr[maxElementPos];
arr[maxElementPos] = arr[minElementPos];
arr[minElementPos] = temp;
}
}

171 views08:51

import java.util.Scanner;

public class SwapSmallestLargestElement {

public static void main(String[] args) {

Scanner scanner = new Scanner(System.in);

int i, n;

System.out.println("Enter the size of array : ");
n = scanner.nextInt();

int arr[] = new int[n];

System.out.println("Enter the elements to be entered : ");
for(i=0;i<n;i++){
arr[i] = scanner.nextInt();
}

//Call a function Find maximum element of array
int maxElementPos = findMaxElement(arr,n);
System.out.println("The maximum element : "+ arr[maxElementPos]);

//Call a function Find minimum element of array
int minElementPos = findMinElement(arr,n);
System.out.println("The minimum element : "+ arr[minElementPos]);

//Call a function swap maximum and minimum element
swapMaxMinElement(arr, maxElementPos, minElementPos);

// Finally print array after swap
System.out.println("The array after swap is : ");
for(i=0;i<n;i++){
System.out.print(arr[i]+ " ");
}
}

//Find maximum element of array
public static int findMaxElement(int arr[],int n){
int i, pos=0;
int maxVal = arr[0];
for(i=0;i<n;i++){
if(arr[i]>maxVal){
maxVal = arr[i];
pos=i;
}
}
return pos;
}

//Find minimum element of array
public static int findMinElement(int arr[],int n){
int i, pos=0;
int minVal = arr[0];
for(i=0;i<n;i++){
if(arr[i] < minVal){
minVal = arr[i];
pos=i;
}
}
return pos;
}

//Swap maximum and minimum element
public static void swapMaxMinElement(int arr[], int maxElementPos, int minElementPos){

/*To swap max and min numbers, take a temporary variable, and follow the below step,
1) assign maximum number to temporary vaiable.
2) assign minimum number to maximum number.
3) asign temporary vaiable to minimum number*/

int temp;
temp = arr[maxElementPos];
arr[maxElementPos] = arr[minElementPos];
arr[minElementPos] = temp;
}
}

165 views09:35

Forwarded from Yakub Sir

103 views10:36

Forwarded from SathyaReact

Convert same example to react single page applications

104 views10:36

Take all data in form of Strings

167 views11:46

public class Main {
public static void main(String[] args) {
int a ;
a= 1;
while(a-->=1){
while(a-->=0){}

}System.out.println(a);
}
}

153 views04:15

//****" Special type programs"

public class Main {
public static void main(String[] args) {
int a = 1;
for(a++;a++<=2;a++){
for(a++;a++<=7;a++){
a++;
}
}
System.out.println(a);
}

}

157 viewsedited 04:15

public class Main {
public static void main(String[] args) {
int i=1;
while (i<=20){
if (i>4&&i<17)
continue;
System.out.println (i);
i++;
}
}
}

O/p 1,2,3,4

148 views04:16

package com.Aman; //add in package public class Q1_A1 { //create class (class doesn't allocates space public static void main(String[] args) { //main method allocates space for the project in heap String inputString = "malayalam";…

Question 1 ( Strings )

137 views04:23