Java follows which principle?
Anonymous Quiz
20%
A) Write Once Compile Everywhere
61%
B) Write Once Run Anywhere
4%
C) Run Once Write Anywhere
15%
D) Compile Once Run Everywhere
❤1
What is the extension of a compiled Java file?
Anonymous Quiz
56%
A) .java
36%
B) .class
6%
C) .exe
2%
D) .byte
Which method is the entry point of a Java program?
Anonymous Quiz
10%
A) start()
3%
B) run()
85%
C) main()
2%
D) execute()
⚡ Variables & Data Types in Java ⭐
After understanding Java basics, the next important concept is Variables and Data Types. Every Java program stores and manipulates data, and this is done using variables. Let’s understand everything step by step.
✅ 1️⃣ What is a Variable?
A variable is a container that stores data. Think of it like a box that holds values.
Example:
Here:
- int → data type
- age → variable name
- 25 → value stored in variable
Simple Structure:
Example:
✅ 2️⃣ Rules for Naming Variables
Java has some rules for variable names.
✔ Must start with letter,
✔ Cannot start with a number
✔ Cannot use Java keywords
Valid examples:
-
-
-
Invalid examples:
-
-
✅ 3️⃣ Data Types in Java
Java has two main types of data types.
1️⃣ Primitive Data Types
2️⃣ Non-Primitive Data Types
🔹 4️⃣ Primitive Data Types
Primitive types store simple values directly in memory. Java has 8 primitive data types.
- byte: 1 byte (e.g.,
- short: 2 bytes (e.g.,
- int: 4 bytes (e.g.,
- long: 8 bytes (e.g.,
- float: 4 bytes (e.g.,
- double: 8 bytes (e.g.,
- char: 2 bytes (e.g.,
- boolean: 1 bit (e.g.,
🔹 5️⃣ Non-Primitive Data Types
Non-primitive types store references to objects.
Examples: String, Arrays, Classes, Objects, Interfaces
Example:
Difference:
- Primitive: Stores value, fixed size, faster.
- Non-Primitive: Stores reference, dynamic size, slightly slower.
🔹 6️⃣ Type Casting
Type casting means converting one data type to another. There are two types.
⭐ 1. Implicit Casting (Automatic): Smaller type → Larger type.
Example:
⭐ 2. Explicit Casting (Manual): Larger type → Smaller type.
Example:
🔹 7️⃣ Constants in Java (final keyword)
A constant is a variable whose value cannot change. Java uses the final keyword.
Example:
Constants are usually written in UPPERCASE.
🔥 Example Program (Variables in Java)
Output:
⭐ Common Interview Questions
1️⃣ What are the 8 primitive data types in Java?
2️⃣ What is the difference between primitive and non-primitive data types?
3️⃣ What is type casting in Java?
4️⃣ What is the difference between implicit and explicit casting?
5️⃣ What is the purpose of the final keyword?
🔥 Quick Revision
- Variables → containers for storing data.
- Primitive types: byte, short, int, long, float, double, char, boolean.
- Non-primitive types: String, Arrays, Objects, Classes.
- Type casting: Implicit → automatic; Explicit → manual.
- Constant: Created using the final keyword.
Double Tap ♥️ For More
After understanding Java basics, the next important concept is Variables and Data Types. Every Java program stores and manipulates data, and this is done using variables. Let’s understand everything step by step.
✅ 1️⃣ What is a Variable?
A variable is a container that stores data. Think of it like a box that holds values.
Example:
int age = 25;Here:
- int → data type
- age → variable name
- 25 → value stored in variable
Simple Structure:
data_type variable_name = value;Example:
int number = 10;
double salary = 50000.50;
char grade = 'A';
✅ 2️⃣ Rules for Naming Variables
Java has some rules for variable names.
✔ Must start with letter,
_ or $✔ Cannot start with a number
✔ Cannot use Java keywords
Valid examples:
-
int age;-
double salary;-
String studentName;Invalid examples:
-
int 1age;-
double student-name;✅ 3️⃣ Data Types in Java
Java has two main types of data types.
1️⃣ Primitive Data Types
2️⃣ Non-Primitive Data Types
🔹 4️⃣ Primitive Data Types
Primitive types store simple values directly in memory. Java has 8 primitive data types.
- byte: 1 byte (e.g.,
byte a = 10;)- short: 2 bytes (e.g.,
short b = 100;)- int: 4 bytes (e.g.,
int age = 25;)- long: 8 bytes (e.g.,
long population = 8000000000L;)- float: 4 bytes (e.g.,
float price = 12.5f;)- double: 8 bytes (e.g.,
double salary = 50000.75;)- char: 2 bytes (e.g.,
char grade = 'A';)- boolean: 1 bit (e.g.,
boolean isTrue = true;)🔹 5️⃣ Non-Primitive Data Types
Non-primitive types store references to objects.
Examples: String, Arrays, Classes, Objects, Interfaces
Example:
String name = "Java";
int[] numbers = {1, 2, 3, 4};
Difference:
- Primitive: Stores value, fixed size, faster.
- Non-Primitive: Stores reference, dynamic size, slightly slower.
🔹 6️⃣ Type Casting
Type casting means converting one data type to another. There are two types.
⭐ 1. Implicit Casting (Automatic): Smaller type → Larger type.
Example:
int number = 10;
double value = number;
⭐ 2. Explicit Casting (Manual): Larger type → Smaller type.
Example:
double price = 99.99;
int value = (int) price; // Output: 99
🔹 7️⃣ Constants in Java (final keyword)
A constant is a variable whose value cannot change. Java uses the final keyword.
Example:
final double PI = 3.14159;
Constants are usually written in UPPERCASE.
🔥 Example Program (Variables in Java)
class VariablesDemo {
public static void main(String[] args) {
int age = 25;
double salary = 50000.75;
char grade = 'A';
boolean isWorking = true;
System.out.println("Age: " + age);
System.out.println("Salary: " + salary);
System.out.println("Grade: " + grade);
System.out.println("Working: " + isWorking);
}
}Output:
Age: 25
Salary: 50000.75
Grade: A
Working: true
⭐ Common Interview Questions
1️⃣ What are the 8 primitive data types in Java?
2️⃣ What is the difference between primitive and non-primitive data types?
3️⃣ What is type casting in Java?
4️⃣ What is the difference between implicit and explicit casting?
5️⃣ What is the purpose of the final keyword?
🔥 Quick Revision
- Variables → containers for storing data.
- Primitive types: byte, short, int, long, float, double, char, boolean.
- Non-primitive types: String, Arrays, Objects, Classes.
- Type casting: Implicit → automatic; Explicit → manual.
- Constant: Created using the final keyword.
Double Tap ♥️ For More
❤32👌2
Which of the following is a valid declaration of a variable in Java?
Anonymous Quiz
3%
A) int 1age = 25;
93%
B) int age = 25;
3%
C) int age-1 = 25;
1%
D) int age# = 25;
Which of the following is NOT a primitive data type in Java?
Anonymous Quiz
5%
A) int
14%
B) double
66%
C) String
15%
D) boolean
👍1
Which keyword is used to create a constant in Java?
Anonymous Quiz
19%
A) static
46%
B) const
32%
C) final
3%
D) immutable
❤9
Which primitive data type is used to store true or false values?
Anonymous Quiz
5%
A) char
90%
B) boolean
4%
C) int
2%
D) float
❤7
⚡ Methods in Java (Functions) ⭐
Now you’ve reached a very important concept — Methods.
This is where your code becomes clean, reusable, and interview-ready.
✅ 1️⃣ What is a Method?
👉 A method is a block of code that performs a task.
Instead of writing the same code again and again → you reuse it.
🔹 Example Without Method:
System.out.println("Hello");
System.out.println("Hello");
System.out.println("Hello");
🔹 With Method:
void sayHello() {
System.out.println("Hello");
}
👉 Now you can call it multiple times.
✅ 2️⃣ Method Syntax
returnType methodName(parameters) {
// code
}
Example:
void greet() {
System.out.println("Hello Java");
}
✅ 3️⃣ Calling a Method
class Test {
static void greet() {
System.out.println("Hello");
}
public static void main(String[] args) {
greet(); // method call
}
}
🔹 4️⃣ Types of Methods
1️⃣ Without parameters, no return
2️⃣ With parameters
3️⃣ With return value
4️⃣ With parameters + return
⭐ 1. No Parameters, No Return
static void show() {
System.out.println("Java");
}
⭐ 2. With Parameters
static void add(int a, int b) {
System.out.println(a + b);
}
Call:
add(5, 3);
⭐ 3. With Return Value
static int square(int x) {
return x x;
}
Call:
int result = square(4);
⭐ 4. Parameters + Return
static int add(int a, int b) {
return a + b;
}
🔹 5️⃣ Method Overloading (Important ⭐)
👉 Same method name, different parameters
Example:
static int add(int a, int b) {
return a + b;
}
static double add(double a, double b) {
return a + b;
}
👉 Java decides method based on arguments
🔹 6️⃣ Recursion (Interview Favorite ⭐)
👉 Method calling itself
Example:
static void printNumbers(int n) {
if (n == 0) return;
System.out.println(n);
printNumbers(n - 1);
}
Call:
printNumbers(5);
Output:
5
4
3
2
1
🔥 7️⃣ Important Keywords
- return: sends value back
- void: no return value
- static: no object needed
- parameters: input values
🔥 Example Program
class MethodDemo {
static int add(int a, int b) {
return a + b;
}
public static void main(String[] args) {
int result = add(10, 5);
System.out.println(result);
}
}
⭐ Common Interview Questions
- What is a method?
- Difference between function and method?
- What is method overloading?
- What is recursion?
- Difference between void and return?
🔥 Quick Revision
- Method → reusable code
- Parameters → input
- Return → output
- Overloading → same name, different args
- Recursion → method calls itself
Double Tap ❤️ For More
Now you’ve reached a very important concept — Methods.
This is where your code becomes clean, reusable, and interview-ready.
✅ 1️⃣ What is a Method?
👉 A method is a block of code that performs a task.
Instead of writing the same code again and again → you reuse it.
🔹 Example Without Method:
System.out.println("Hello");
System.out.println("Hello");
System.out.println("Hello");
🔹 With Method:
void sayHello() {
System.out.println("Hello");
}
👉 Now you can call it multiple times.
✅ 2️⃣ Method Syntax
returnType methodName(parameters) {
// code
}
Example:
void greet() {
System.out.println("Hello Java");
}
✅ 3️⃣ Calling a Method
class Test {
static void greet() {
System.out.println("Hello");
}
public static void main(String[] args) {
greet(); // method call
}
}
🔹 4️⃣ Types of Methods
1️⃣ Without parameters, no return
2️⃣ With parameters
3️⃣ With return value
4️⃣ With parameters + return
⭐ 1. No Parameters, No Return
static void show() {
System.out.println("Java");
}
⭐ 2. With Parameters
static void add(int a, int b) {
System.out.println(a + b);
}
Call:
add(5, 3);
⭐ 3. With Return Value
static int square(int x) {
return x x;
}
Call:
int result = square(4);
⭐ 4. Parameters + Return
static int add(int a, int b) {
return a + b;
}
🔹 5️⃣ Method Overloading (Important ⭐)
👉 Same method name, different parameters
Example:
static int add(int a, int b) {
return a + b;
}
static double add(double a, double b) {
return a + b;
}
👉 Java decides method based on arguments
🔹 6️⃣ Recursion (Interview Favorite ⭐)
👉 Method calling itself
Example:
static void printNumbers(int n) {
if (n == 0) return;
System.out.println(n);
printNumbers(n - 1);
}
Call:
printNumbers(5);
Output:
5
4
3
2
1
🔥 7️⃣ Important Keywords
- return: sends value back
- void: no return value
- static: no object needed
- parameters: input values
🔥 Example Program
class MethodDemo {
static int add(int a, int b) {
return a + b;
}
public static void main(String[] args) {
int result = add(10, 5);
System.out.println(result);
}
}
⭐ Common Interview Questions
- What is a method?
- Difference between function and method?
- What is method overloading?
- What is recursion?
- Difference between void and return?
🔥 Quick Revision
- Method → reusable code
- Parameters → input
- Return → output
- Overloading → same name, different args
- Recursion → method calls itself
Double Tap ❤️ For More
❤23😁1
Practice Set (ep2).pdf
66.8 KB
Java practice set
DO 👍 IF YOU WANT MORE CONTENT LIKE THIS FOR FREE 🆓
DO 👍 IF YOU WANT MORE CONTENT LIKE THIS FOR FREE 🆓
👍20❤16
🚀 Data Structures & Algorithms (DSA) 👨💻🔥
Once you understand programming basics and core concepts, the next step is DSA:
This is where you become a strong problem solver. 🧠
DSA helps you:
✔ Write efficient code
✔ Solve complex problems
✔ Crack coding interviews
✔ Improve logical thinking
✔ Build optimized applications
Big tech companies like:
✔ Google
✔ Amazon
✔ Microsoft
✔ Meta
…heavily focus on DSA in interviews.
🧠 1. What are Data Structures?
Data Structures are ways to organize and store data efficiently.
Different problems require different ways of storing data.
📦 Common Data Structures
Data Structure : Use
Array : Store multiple values
Linked List : Dynamic data storage
Stack : Undo operations
Queue : Task scheduling
Tree : Hierarchical data
Graph : Networks & maps
Hash Table : Fast searching
🔢 2. Arrays
Arrays store multiple values in sequence.
🔹 Example
numbers = [10, 20, 30, 40]
print(numbers[1])
Output:
20
🧠 Real Use Cases
✔ Storing products in e-commerce apps
✔ Managing student records
✔ AI datasets
✔ Game scores
🔗 3. Linked Lists
Linked Lists store data using connected nodes.
Unlike arrays, linked lists can grow dynamically.
🧠 Why Linked Lists Matter
Arrays:
❌ Fixed size
❌ Slow insertions in middle
Linked Lists:
✔ Dynamic size
✔ Efficient insertions/deletions
🔹 Simple Visualization
10 → 20 → 30 → 40
Each node points to the next node.
📚 4. Stacks
Stacks follow:
LIFO = Last In First Out
Like a stack of plates 🍽
🔹 Stack Operations
✔ Push → Add item
✔ Pop → Remove item
🔹 Example
stack = []
stack.append(10)
stack.append(20)
print(stack.pop())
Output:
20
🧠 Real Use Cases
✔ Undo feature in editors
✔ Browser history
✔ Expression evaluation
✔ Function calls
🚶 5. Queues
Queues follow:
FIFO = First In First Out
Like people standing in a line.
🔹 Example
from collections import deque
queue = deque()
queue.append(10)
queue.append(20)
print(queue.popleft())
Output:
10
🧠 Real Use Cases
✔ Task scheduling
✔ Printer queues
✔ Customer service systems
✔ Messaging apps
🌳 6. Trees
Trees store hierarchical data.
🔹 Example Structure
A
/ \
B C
🧠 Real Use Cases
✔ File systems
✔ Website DOM structure
✔ AI decision trees
✔ Database indexing
🌐 7. Graphs
Graphs represent networks and connections.
🔹 Example
A — B — C
| |
D ——— E
🧠 Real Use Cases
✔ Google Maps
✔ Social networks
✔ Recommendation systems
✔ Internet routing
🔍 8. Searching Algorithms
Searching means finding data efficiently.
🔹 Linear Search
Checks elements one by one.
numbers = [10, 20, 30]
target = 20
for i in numbers:
if i == target:
print("Found")
🔹 Binary Search
Much faster than linear search.
Works only on sorted data.
Divide → Search → Repeat
📊 9. Sorting Algorithms
Sorting arranges data in order.
🔹 Common Sorting Algorithms
✔ Bubble Sort
✔ Selection Sort
✔ Merge Sort
✔ Quick Sort
🔹 Example
numbers = [4, 2, 1, 3]
numbers.sort()
print(numbers)
Output:
[1, 2, 3, 4]
⏱ 10. Time Complexity Big-O
Big-O measures how efficient an algorithm is.
This is one of the MOST important concepts in DSA.
Once you understand programming basics and core concepts, the next step is DSA:
This is where you become a strong problem solver. 🧠
DSA helps you:
✔ Write efficient code
✔ Solve complex problems
✔ Crack coding interviews
✔ Improve logical thinking
✔ Build optimized applications
Big tech companies like:
✔ Amazon
✔ Microsoft
✔ Meta
…heavily focus on DSA in interviews.
🧠 1. What are Data Structures?
Data Structures are ways to organize and store data efficiently.
Different problems require different ways of storing data.
📦 Common Data Structures
Data Structure : Use
Array : Store multiple values
Linked List : Dynamic data storage
Stack : Undo operations
Queue : Task scheduling
Tree : Hierarchical data
Graph : Networks & maps
Hash Table : Fast searching
🔢 2. Arrays
Arrays store multiple values in sequence.
🔹 Example
numbers = [10, 20, 30, 40]
print(numbers[1])
Output:
20
🧠 Real Use Cases
✔ Storing products in e-commerce apps
✔ Managing student records
✔ AI datasets
✔ Game scores
🔗 3. Linked Lists
Linked Lists store data using connected nodes.
Unlike arrays, linked lists can grow dynamically.
🧠 Why Linked Lists Matter
Arrays:
❌ Fixed size
❌ Slow insertions in middle
Linked Lists:
✔ Dynamic size
✔ Efficient insertions/deletions
🔹 Simple Visualization
10 → 20 → 30 → 40
Each node points to the next node.
📚 4. Stacks
Stacks follow:
LIFO = Last In First Out
Like a stack of plates 🍽
🔹 Stack Operations
✔ Push → Add item
✔ Pop → Remove item
🔹 Example
stack = []
stack.append(10)
stack.append(20)
print(stack.pop())
Output:
20
🧠 Real Use Cases
✔ Undo feature in editors
✔ Browser history
✔ Expression evaluation
✔ Function calls
🚶 5. Queues
Queues follow:
FIFO = First In First Out
Like people standing in a line.
🔹 Example
from collections import deque
queue = deque()
queue.append(10)
queue.append(20)
print(queue.popleft())
Output:
10
🧠 Real Use Cases
✔ Task scheduling
✔ Printer queues
✔ Customer service systems
✔ Messaging apps
🌳 6. Trees
Trees store hierarchical data.
🔹 Example Structure
A
/ \
B C
🧠 Real Use Cases
✔ File systems
✔ Website DOM structure
✔ AI decision trees
✔ Database indexing
🌐 7. Graphs
Graphs represent networks and connections.
🔹 Example
A — B — C
| |
D ——— E
🧠 Real Use Cases
✔ Google Maps
✔ Social networks
✔ Recommendation systems
✔ Internet routing
🔍 8. Searching Algorithms
Searching means finding data efficiently.
🔹 Linear Search
Checks elements one by one.
numbers = [10, 20, 30]
target = 20
for i in numbers:
if i == target:
print("Found")
🔹 Binary Search
Much faster than linear search.
Works only on sorted data.
Divide → Search → Repeat
📊 9. Sorting Algorithms
Sorting arranges data in order.
🔹 Common Sorting Algorithms
✔ Bubble Sort
✔ Selection Sort
✔ Merge Sort
✔ Quick Sort
🔹 Example
numbers = [4, 2, 1, 3]
numbers.sort()
print(numbers)
Output:
[1, 2, 3, 4]
⏱ 10. Time Complexity Big-O
Big-O measures how efficient an algorithm is.
This is one of the MOST important concepts in DSA.
❤1👍1
🔹 Why Big-O Matters
Two programs may give the same output…
…but one may take:
✔ 1 second
✔ another may take 1 hour 😵
Big-O helps measure performance.
📊 Common Complexities
Complexity : Speed
O(1) : Very Fast
O(log n) : Fast
O(n) : Good
O(n²) : Slow
🔹 Example
Linear Search: $O(n)$
Binary Search: O(logn)
🧠 11. Why DSA is Important
DSA improves:
✔ Problem-solving skills
✔ Logical thinking
✔ Coding efficiency
✔ Interview performance
Without DSA:
❌ Code becomes slow
❌ Apps become inefficient
❌ Complex problems become difficult
🔥 Best Platforms to Practice DSA
• LeetCode
• HackerRank
• Codeforces
• GeeksforGeeks
🚀 Beginner DSA Roadmap
Phase 1
✔ Arrays
✔ Strings
✔ Loops
✔ Functions
Phase 2
✔ Linked Lists
✔ Stacks
✔ Queues
Phase 3
✔ Trees
✔ Graphs
✔ Recursion
✔ Backtracking
Phase 4
✔ Dynamic Programming
✔ Advanced Algorithms
✔ Competitive Programming
⚠️ Common Beginner Mistakes
❌ Memorizing solutions
❌ Ignoring Big-O
❌ Jumping to advanced topics too early
❌ Practicing inconsistently
💡 Best Way to Learn DSA
Learn Concept → Visualize → Code → Practice Problems
Consistency matters more than speed.
Even solving:
1–2 problems daily
can completely change your coding skills over time.
🚀 DSA may feel difficult initially…
…but this is the stage where programmers become real problem solvers. 🧠🔥
The more problems you solve:
✔ The stronger your logic becomes
✔ The faster your coding improves
✔ The easier interviews feel
That’s why DSA is considered the backbone of programming. 👨💻
👉 Double Tap ❤️ For More
Two programs may give the same output…
…but one may take:
✔ 1 second
✔ another may take 1 hour 😵
Big-O helps measure performance.
📊 Common Complexities
Complexity : Speed
O(1) : Very Fast
O(log n) : Fast
O(n) : Good
O(n²) : Slow
🔹 Example
Linear Search: $O(n)$
Binary Search: O(logn)
🧠 11. Why DSA is Important
DSA improves:
✔ Problem-solving skills
✔ Logical thinking
✔ Coding efficiency
✔ Interview performance
Without DSA:
❌ Code becomes slow
❌ Apps become inefficient
❌ Complex problems become difficult
🔥 Best Platforms to Practice DSA
• LeetCode
• HackerRank
• Codeforces
• GeeksforGeeks
🚀 Beginner DSA Roadmap
Phase 1
✔ Arrays
✔ Strings
✔ Loops
✔ Functions
Phase 2
✔ Linked Lists
✔ Stacks
✔ Queues
Phase 3
✔ Trees
✔ Graphs
✔ Recursion
✔ Backtracking
Phase 4
✔ Dynamic Programming
✔ Advanced Algorithms
✔ Competitive Programming
⚠️ Common Beginner Mistakes
❌ Memorizing solutions
❌ Ignoring Big-O
❌ Jumping to advanced topics too early
❌ Practicing inconsistently
💡 Best Way to Learn DSA
Learn Concept → Visualize → Code → Practice Problems
Consistency matters more than speed.
Even solving:
1–2 problems daily
can completely change your coding skills over time.
🚀 DSA may feel difficult initially…
…but this is the stage where programmers become real problem solvers. 🧠🔥
The more problems you solve:
✔ The stronger your logic becomes
✔ The faster your coding improves
✔ The easier interviews feel
That’s why DSA is considered the backbone of programming. 👨💻
👉 Double Tap ❤️ For More
❤17🖕1
This media is not supported in your browser
VIEW IN TELEGRAM
18 Most common used Java List methods
1. add(E element) - Adds the specified element to the end of the list.
2. addAll(Collection<? extends E> c) - Adds all elements of the specified collection to the end of the list.
3. remove(Object o) - Removes the first occurrence of the specified element from the list.
4. remove(int index) - Removes the element at the specified position in the list.
5. get(int index) - Returns the element at the specified position in the list.
6. set(int index, E element) - Replaces the element at the specified position in the list with the specified element.
7. indexOf(Object o) - Returns the index of the first occurrence of the specified element in the list.
8. contains(Object o) - Returns true if the list contains the specified element.
9. size() - Returns the number of elements in the list.
10. isEmpty() - Returns true if the list contains no elements.
11. clear() - Removes all elements from the list.
12. toArray() - Returns an array containing all the elements in the list.
13. subList(int fromIndex, int toIndex) - Returns a view of the portion of the list between the specified fromIndex, inclusive, and toIndex, exclusive.
14. addAll(int index, Collection<? extends E> c) - Inserts all elements of the specified collection into the list, starting at the specified position.
15. iterator() - Returns an iterator over the elements in the list.
16. sort(Comparator<? super E> c) - Sorts the elements of the list according to the specified comparator.
17. replaceAll(UnaryOperator<E> operator) - Replaces each element of the list with the result of applying the given operator.
18. forEach(Consumer<? super E> action) - Performs the given action for each element of the list until all elements have been processed or the action throws an exception.
1. add(E element) - Adds the specified element to the end of the list.
2. addAll(Collection<? extends E> c) - Adds all elements of the specified collection to the end of the list.
3. remove(Object o) - Removes the first occurrence of the specified element from the list.
4. remove(int index) - Removes the element at the specified position in the list.
5. get(int index) - Returns the element at the specified position in the list.
6. set(int index, E element) - Replaces the element at the specified position in the list with the specified element.
7. indexOf(Object o) - Returns the index of the first occurrence of the specified element in the list.
8. contains(Object o) - Returns true if the list contains the specified element.
9. size() - Returns the number of elements in the list.
10. isEmpty() - Returns true if the list contains no elements.
11. clear() - Removes all elements from the list.
12. toArray() - Returns an array containing all the elements in the list.
13. subList(int fromIndex, int toIndex) - Returns a view of the portion of the list between the specified fromIndex, inclusive, and toIndex, exclusive.
14. addAll(int index, Collection<? extends E> c) - Inserts all elements of the specified collection into the list, starting at the specified position.
15. iterator() - Returns an iterator over the elements in the list.
16. sort(Comparator<? super E> c) - Sorts the elements of the list according to the specified comparator.
17. replaceAll(UnaryOperator<E> operator) - Replaces each element of the list with the result of applying the given operator.
18. forEach(Consumer<? super E> action) - Performs the given action for each element of the list until all elements have been processed or the action throws an exception.
❤8👍1
😱 6 Coding websites that feel illegal to know 👇
1/ overapi.com: Collection of all programming languages cheat sheets
https://overapi.com/
2/ Roadmap.sh: Provides roadmaps for learning technologies
https://roadmap.sh/
3/ replit.com: Code from anywhere
https://replit.com/
4/ resumeworded.com: Improve your resume
https://resumeworded.com/
5/ Ray.so: Turn code into beautiful images
https://ray.so/
6/ codepen.io: The best place to build, test, and discover front-end code.
https://codepen.io/
1/ overapi.com: Collection of all programming languages cheat sheets
https://overapi.com/
2/ Roadmap.sh: Provides roadmaps for learning technologies
https://roadmap.sh/
3/ replit.com: Code from anywhere
https://replit.com/
4/ resumeworded.com: Improve your resume
https://resumeworded.com/
5/ Ray.so: Turn code into beautiful images
https://ray.so/
6/ codepen.io: The best place to build, test, and discover front-end code.
https://codepen.io/
❤16
🔤 A–Z of Web Development 🌐
A – API
Set of rules allowing different apps to communicate, like fetching data from servers.
B – Bootstrap
Popular CSS framework for responsive, mobile-first front-end development.
C – CSS
Styles web pages with layouts, colors, fonts, and animations for visual appeal.
D – DOM
Document Object Model; tree structure representing HTML for dynamic manipulation.
E – ES6+
Modern JavaScript features like arrows, promises, and async/await for cleaner code.
F – Flexbox
CSS layout module for one-dimensional designs, aligning items efficiently.
G – GitHub
Platform for version control and collaboration using Git repositories.
H – HTML
Markup language structuring content with tags for headings, links, and media.
I – IDE
Integrated Development Environment like VS Code for coding, debugging, tools.
J – JavaScript
Language adding interactivity, from form validation to full-stack apps.
K – Kubernetes
Orchestration tool managing containers for scalable web app deployment.
L – Local Storage
Browser API storing key-value data client-side, persisting across sessions.
M – MongoDB
NoSQL database for flexible, JSON-like document storage in MEAN stack.
N – Node.js
JavaScript runtime for server-side; powers back-end with npm ecosystem.
O – OAuth
Authorization protocol letting apps access user data without passwords.
P – Progressive Web App
Web apps behaving like natives: offline, push notifications, installable.
Q – Query Selector
JavaScript/DOM method targeting elements with CSS selectors for manipulation.
R – React
JavaScript library for building reusable UI components and single-page apps.
S – SEO
Search Engine Optimization improving site visibility via keywords, speed.
T – TypeScript
Superset of JS adding types for scalable, error-free large apps.
U – UI/UX
User Interface design and User Experience focusing on usability, accessibility.
V – Vue.js
Progressive JS framework for reactive, component-based UIs.
W – Webpack
Module bundler processing JS, assets into optimized static files.
X – XSS
Cross-Site Scripting vulnerability injecting malicious scripts into web pages.
Y – YAML
Human-readable format for configs like Docker Compose or GitHub Actions.
Z – Zustand
Lightweight state management for React apps, simpler than Redux.
Double Tap ♥️ For More
A – API
Set of rules allowing different apps to communicate, like fetching data from servers.
B – Bootstrap
Popular CSS framework for responsive, mobile-first front-end development.
C – CSS
Styles web pages with layouts, colors, fonts, and animations for visual appeal.
D – DOM
Document Object Model; tree structure representing HTML for dynamic manipulation.
E – ES6+
Modern JavaScript features like arrows, promises, and async/await for cleaner code.
F – Flexbox
CSS layout module for one-dimensional designs, aligning items efficiently.
G – GitHub
Platform for version control and collaboration using Git repositories.
H – HTML
Markup language structuring content with tags for headings, links, and media.
I – IDE
Integrated Development Environment like VS Code for coding, debugging, tools.
J – JavaScript
Language adding interactivity, from form validation to full-stack apps.
K – Kubernetes
Orchestration tool managing containers for scalable web app deployment.
L – Local Storage
Browser API storing key-value data client-side, persisting across sessions.
M – MongoDB
NoSQL database for flexible, JSON-like document storage in MEAN stack.
N – Node.js
JavaScript runtime for server-side; powers back-end with npm ecosystem.
O – OAuth
Authorization protocol letting apps access user data without passwords.
P – Progressive Web App
Web apps behaving like natives: offline, push notifications, installable.
Q – Query Selector
JavaScript/DOM method targeting elements with CSS selectors for manipulation.
R – React
JavaScript library for building reusable UI components and single-page apps.
S – SEO
Search Engine Optimization improving site visibility via keywords, speed.
T – TypeScript
Superset of JS adding types for scalable, error-free large apps.
U – UI/UX
User Interface design and User Experience focusing on usability, accessibility.
V – Vue.js
Progressive JS framework for reactive, component-based UIs.
W – Webpack
Module bundler processing JS, assets into optimized static files.
X – XSS
Cross-Site Scripting vulnerability injecting malicious scripts into web pages.
Y – YAML
Human-readable format for configs like Docker Compose or GitHub Actions.
Z – Zustand
Lightweight state management for React apps, simpler than Redux.
Double Tap ♥️ For More
❤9
Java Basics every beginner should learn to build a strong foundation:
1. Hello World & Setup
Install JDK and an IDE (like IntelliJ or Eclipse)
Write your first program: public class HelloWorld
2. Data Types & Variables
Primitive types: int, double, char, boolean
Non-primitive types: String, Arrays, Objects
Type casting (implicit & explicit)
3. Operators
Arithmetic: + - * / %
Comparison: == != > < >= <=
Logical: && || !
4. Control Flow
If, else if, else
Switch-case
Loops: for, while, do-while
break and continue
5. Functions (Methods)
Syntax: public static returnType methodName(params)
Method overloading
Return types & parameter passing
6. Object-Oriented Programming (OOP)
Classes & Objects
this keyword
Constructors (default & parameterized)
7. OOP Concepts
Encapsulation (private variables + getters/setters)
Inheritance (extends keyword)
Polymorphism (method overriding)
Abstraction (abstract classes & interfaces)
8. Arrays & ArrayList
Declaring and iterating arrays
ArrayList methods: add, remove, get, size
Multidimensional arrays
9. Exception Handling
Try-catch-finally blocks
throw and throws
Custom exceptions
10. Basic Input/Output
Scanner class for user input
System.out.println() for output
Free Java Resources: https://whatsapp.com/channel/0029VamdH5mHAdNMHMSBwg1s
ENJOY LEARNING 👍👍
1. Hello World & Setup
Install JDK and an IDE (like IntelliJ or Eclipse)
Write your first program: public class HelloWorld
2. Data Types & Variables
Primitive types: int, double, char, boolean
Non-primitive types: String, Arrays, Objects
Type casting (implicit & explicit)
3. Operators
Arithmetic: + - * / %
Comparison: == != > < >= <=
Logical: && || !
4. Control Flow
If, else if, else
Switch-case
Loops: for, while, do-while
break and continue
5. Functions (Methods)
Syntax: public static returnType methodName(params)
Method overloading
Return types & parameter passing
6. Object-Oriented Programming (OOP)
Classes & Objects
this keyword
Constructors (default & parameterized)
7. OOP Concepts
Encapsulation (private variables + getters/setters)
Inheritance (extends keyword)
Polymorphism (method overriding)
Abstraction (abstract classes & interfaces)
8. Arrays & ArrayList
Declaring and iterating arrays
ArrayList methods: add, remove, get, size
Multidimensional arrays
9. Exception Handling
Try-catch-finally blocks
throw and throws
Custom exceptions
10. Basic Input/Output
Scanner class for user input
System.out.println() for output
Free Java Resources: https://whatsapp.com/channel/0029VamdH5mHAdNMHMSBwg1s
ENJOY LEARNING 👍👍
❤7