Spark - https://amzn.to/3hOFakR
Thursday, 7 January 2021
Sunday, 3 January 2021
Free Udemy Course | Get Free Udemy Certified Premium Courses
Free Udemy Course | Get Free Udemy Certified Premium Courses
Courses:
1. Python MultiTrack- beginners and professionals- zero to hero:
couponCode=FF8F2D1F06D90181F055
2. MERN Stack E-Commerce Mobile App with React Native:
couponCode=3EF2F0C60B55F6B573D5
3. Web automation using uipath:
couponCode=HAPPYNEWYEAR2021
4. Fundamental of Electronics Engineering:
couponCode=QUIZLIVE
5. The Python MicroDegree 2021:
couponCode=FREEMICRODEGREE
6. Adobe Photoshop CC- Basic Photoshop training:
couponCode=75994F5741FDF4E485FE
7. Learn to Host Multiple Domains on one Virtual Server:
couponCode=YOUACCEL50394
8. Python Programming Complete Beginner Course Bootcamp 2021:
couponCode=PYTHONPREMIUM
9. Project Development Using JAVA for Beginners:
couponCode=FOR_MY_STUDENTS
10. The Complete Ethical Hacking Course:
couponCode=HAPPYNEWYEAR
Tuesday, 18 August 2020
Sunday, 8 March 2020
JAVA notes PDF Download - Handwritten Notes
Core Java
2- Core Java Notes Satya Technology- Download
3- Core Java Notes Ratan Sir- Download
AdvancedJava
2- JavaEE / J2EE Naresh Sir Notes- Download
3- JavaEE / J2EE Santosh Sir Notes- Download
Spring PDF
2- Spring Notes Natraj Sir- Download
3- Spring Notes DurgaSoft- Part-1 Download
4- Spring Notes DurgaSoft- Part-2 Download
Hibernate PDF
2- Hibernate Notes Santosh Sir- Download
3- Hibernate Notes Natraj Sir- Download
SCJP/OCJP Notes
Deadlock in Java and Solution
Deadlock in Java and Solution
Solution: To Avoid Deadlock, replace the sequence of resources
Saturday, 1 February 2020
Array Program 1 : Find Evenly Repeated number from an Array
Input: int[] a = {1,1,5,4,8,1,5,8,3,9,15,15,16,2,8,7,9,1};
Output : [1, 5, 9, 15]
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 | package JavaPractice; import java.util.ArrayList; import java.util.Arrays; import java.util.List; public class ArraysEvenOccurance { public static void main(String arg[]){ int[] input = {1, 1, 5, 4, 8, 1, 5, 8, 3, 9, 15, 15, 16, 2, 8, 7, 9, 1}; int[] output = new int[input.length]; // sort input array Arrays.sort(input); int counter = 1, k = 0, j=0; for (int i = 1; i < input.length; i++) { if (input[k] == input[i]) { // check for same number counter++; } else { // check even number of counter if (counter % 2 == 0) { output[j] = (input[k]); j++; } counter = 1; k = i; } } // Removing Extra appended element (sub array) output = Arrays.copyOfRange(output, 0, j); // Print Result array System.out.println(Arrays.toString(output)); } } |