Link is also shared n attached to your calendar we will not allow anyone without registration in Google forms
Flowcharts
Backtracking
Variables & Data Types in Java
Time & Space Complexity
Operators
ArrayLists
if-else Statements
Linked Lists
Flow Control (Loops)
Stacks
Patterns
Queues
Functions & Methods
Greedy Algorithms
Arrays
Binary Trees
Sorting Algorithms
Binary Search Trees
2D Arrays
Heaps/Priority Queues
Strings
Hashing
Bit Manipulation
Tries
OOPs
Graphs
Recursion
Dynamic Programming
Divide & Conquer
Segment Trees
Backtracking
Variables & Data Types in Java
Time & Space Complexity
Operators
ArrayLists
if-else Statements
Linked Lists
Flow Control (Loops)
Stacks
Patterns
Queues
Functions & Methods
Greedy Algorithms
Arrays
Binary Trees
Sorting Algorithms
Binary Search Trees
2D Arrays
Heaps/Priority Queues
Strings
Hashing
Bit Manipulation
Tries
OOPs
Graphs
Recursion
Dynamic Programming
Divide & Conquer
Segment Trees
👍1
package com.Aman;public class Mainmeh { public static void main(Integer args){System.out.println("method 1");} public static void main(char args){ System.out.println("method 1"); } public static void main(String ... args){ System.out.println("method 1"); } public static void main(long args){System.out.println("method 1");} public static void main(double args){ System.out.println("method 1"); } public static void main(float ... args){ System.out.println("method 1"); }}public class SpecialCase1 { public static void main(String...args){ int k =1 ; for(int i = 1; i<=5;i++){ for(int j = 1; j<=5;j++){ System.out.print(k++%10); } System.out.println(); } }}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; }}