├── .classpath
├── .project
├── Algorithms
    ├── birthday-cake-candles.java
    ├── compare-the-triplets.java
    ├── mini-max-sum.java
    ├── plus-minus.java
    ├── roadsandlibraries.java
    ├── simple-array-sum.java
    └── solve-me-first.java
├── CODE_OF_CONDUCT.md
├── CONTRIBUTING.md
├── Data-Structures
    ├── compare-two-linked-lists.java
    ├── insertAtEndOfLinkedList.java
    ├── insertAtHeadOfLinkedList.java
    ├── insertAtPositionOfLinkedList.java
    └── traverse-linkedlist.java
├── Java-Strings
    ├── java-string-reverse.java
    ├── java-strings-introduction.java
    └── java-substring.java
├── Java
    ├── java-end-of-file.java
    ├── java-if-else.java
    ├── java-int-to-string.java
    ├── java-loops-i.java
    ├── java-loops-ii.java
    ├── java-output-formatting.java
    ├── java-static-initializer-block.java
    ├── java_stdin_stdout_ii.java
    ├── scanner.java
    └── welcome-to-java.java
├── LICENSE
├── PULL_REQUEST_TEMPLATE
├── README.md
├── _config.yml
└── codedecks.jpg


/.classpath:
--------------------------------------------------------------------------------
1 | <?xml version="1.0" encoding="UTF-8"?>
2 | <classpath>
3 | 	<classpathentry kind="output" path="bin"/>
4 | </classpath>
5 | 


--------------------------------------------------------------------------------
/.project:
--------------------------------------------------------------------------------
 1 | <?xml version="1.0" encoding="UTF-8"?>
 2 | <projectDescription>
 3 | 	<name>HackerRank-Solutions</name>
 4 | 	<comment></comment>
 5 | 	<projects>
 6 | 	</projects>
 7 | 	<buildSpec>
 8 | 		<buildCommand>
 9 | 			<name>org.eclipse.jdt.core.javabuilder</name>
10 | 			<arguments>
11 | 			</arguments>
12 | 		</buildCommand>
13 | 	</buildSpec>
14 | 	<natures>
15 | 		<nature>org.eclipse.jdt.core.javanature</nature>
16 | 	</natures>
17 | </projectDescription>
18 | 


--------------------------------------------------------------------------------
/Algorithms/birthday-cake-candles.java:
--------------------------------------------------------------------------------
 1 | import java.io.*;
 2 | import java.math.*;
 3 | import java.security.*;
 4 | import java.text.*;
 5 | import java.util.*;
 6 | import java.util.concurrent.*;
 7 | import java.util.regex.*;
 8 | 
 9 | public class Solution {
10 | 
11 |     // Complete the birthdayCakeCandles function below.
12 |     static int birthdayCakeCandles(int[] ar) {
13 |         int len = ar.length;
14 | 
15 |         // edge test case
16 |         if (len == 0){
17 |             return 0;
18 |         }
19 | 
20 |         // find max element
21 |         int max = ar[0];
22 | 
23 |         // count of max element
24 |         int count = 0;
25 | 
26 |         for(int i=0; i<len; i++){
27 | 
28 |             if(ar[i] > max){
29 |                 max = ar[i];
30 |                 count = 0;
31 |             }
32 | 
33 |             if(max == ar[i]){
34 |                 count++;
35 |             }
36 |         }
37 | 
38 |         // now we get max element, find how many times the max element occurs in ar
39 |         
40 |         /*for(int i=0; i<len; i++){
41 |             if(max == ar[i]){
42 |                 count++;
43 |             }
44 |         }*/
45 | 
46 |         return count;
47 |     }
48 | 
49 |     private static final Scanner scanner = new Scanner(System.in);
50 | 
51 |     public static void main(String[] args) throws IOException {
52 |         BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
53 | 
54 |         int arCount = scanner.nextInt();
55 |         scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
56 | 
57 |         int[] ar = new int[arCount];
58 | 
59 |         String[] arItems = scanner.nextLine().split(" ");
60 |         scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
61 | 
62 |         for (int i = 0; i < arCount; i++) {
63 |             int arItem = Integer.parseInt(arItems[i]);
64 |             ar[i] = arItem;
65 |         }
66 | 
67 |         int result = birthdayCakeCandles(ar);
68 | 
69 |         bufferedWriter.write(String.valueOf(result));
70 |         bufferedWriter.newLine();
71 | 
72 |         bufferedWriter.close();
73 | 
74 |         scanner.close();
75 |     }
76 | }
77 | 


--------------------------------------------------------------------------------
/Algorithms/compare-the-triplets.java:
--------------------------------------------------------------------------------
 1 | import java.io.*;
 2 | import java.math.*;
 3 | import java.security.*;
 4 | import java.text.*;
 5 | import java.util.*;
 6 | import java.util.concurrent.*;
 7 | import java.util.function.*;
 8 | import java.util.regex.*;
 9 | import java.util.stream.*;
10 | import static java.util.stream.Collectors.joining;
11 | import static java.util.stream.Collectors.toList;
12 | 
13 | public class Solution {
14 | 
15 |     // Complete the compareTriplets function below.
16 |     static List<Integer> compareTriplets(List<Integer> a, List<Integer> b) {
17 | 
18 |         // resultant List which will store alice & bob scores
19 |         List<Integer> scores = new ArrayList<>();
20 | 
21 |         // intialize both alice's & bob's score to 0
22 |         int aliceScore = 0;
23 |         int bobScore = 0;
24 | 
25 |         // iterate both the lists a, b
26 |         // can take any of the sizes as compare condition since both sizes are 3
27 |         for (int i=0; i<a.size(); i++){
28 |             if(a.get(i) > b.get(i)){
29 |                 aliceScore += 1;
30 |             }
31 |             else if(b.get(i) > a.get(i)) {
32 |                 bobScore += 1;
33 |             }
34 |         }
35 | 
36 |         // first we will add alice's score to scores list
37 |         scores.add(aliceScore);
38 | 
39 |         // now add bob's score to scores list
40 |         scores.add(bobScore);
41 | 
42 |         // scores = [alicesScore, bobScore]
43 |         return scores;
44 |     }
45 | 
46 |     public static void main(String[] args) throws IOException {
47 |         BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
48 |         BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
49 | 
50 |         List<Integer> a = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
51 |             .map(Integer::parseInt)
52 |             .collect(toList());
53 | 
54 |         List<Integer> b = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
55 |             .map(Integer::parseInt)
56 |             .collect(toList());
57 | 
58 |         List<Integer> result = compareTriplets(a, b);
59 | 
60 |         bufferedWriter.write(
61 |             result.stream()
62 |                 .map(Object::toString)
63 |                 .collect(joining(" "))
64 |             + "\n"
65 |         );
66 | 
67 |         bufferedReader.close();
68 |         bufferedWriter.close();
69 |     }
70 | }


--------------------------------------------------------------------------------
/Algorithms/mini-max-sum.java:
--------------------------------------------------------------------------------
 1 | import java.io.*;
 2 | import java.math.*;
 3 | import java.security.*;
 4 | import java.text.*;
 5 | import java.util.*;
 6 | import java.util.concurrent.*;
 7 | import java.util.regex.*;
 8 | 
 9 | public class Solution {
10 | 
11 |     // Complete the miniMaxSum function below.
12 |     static void miniMaxSum(int[] arr) {
13 |         
14 |         // 1. simple array sum
15 |         long sum = arr[0];
16 | 
17 |         // 2. find min & max element
18 |         int min = arr[0];
19 |         int max = arr[0];
20 |         
21 |         for (int i=1; i<arr.length;i++){
22 |             sum += arr[i];
23 |             if (arr[i] < min){
24 |                 min = arr[i];
25 |             }
26 | 
27 |             if(arr[i] > max){
28 |                 max = arr[i];
29 |             }
30 |         }
31 | 
32 |         System.out.println((sum-max) + " " + (sum-min));
33 |     }
34 | 
35 |     private static final Scanner scanner = new Scanner(System.in);
36 | 
37 |     public static void main(String[] args) {
38 |         int[] arr = new int[5];
39 | 
40 |         String[] arrItems = scanner.nextLine().split(" ");
41 |         scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
42 | 
43 |         for (int i = 0; i < 5; i++) {
44 |             int arrItem = Integer.parseInt(arrItems[i]);
45 |             arr[i] = arrItem;
46 |         }
47 | 
48 |         miniMaxSum(arr);
49 | 
50 |         scanner.close();
51 |     }
52 | }
53 | 


--------------------------------------------------------------------------------
/Algorithms/plus-minus.java:
--------------------------------------------------------------------------------
 1 | import java.io.*;
 2 | import java.math.*;
 3 | import java.security.*;
 4 | import java.text.*;
 5 | import java.util.*;
 6 | import java.util.concurrent.*;
 7 | import java.util.regex.*;
 8 | 
 9 | public class Solution {
10 | 
11 |     // Complete the plusMinus function below.
12 |     static void plusMinus(int[] arr) {
13 | 
14 |         // len is total number of elements in arr
15 |         float len = arr.length;
16 | 
17 |         // count of positive elements
18 |         int countPositive = 0;
19 | 
20 |         // count of negative elements;
21 |         int countNegative = 0;
22 | 
23 |         for(int i=0; i<len; i++){
24 | 
25 |             // positive number check
26 |             if(arr[i] > 0){
27 |                 countPositive++;
28 |             }
29 |             // negative number check
30 |             else if(arr[i] < 0){
31 |                 countNegative++;
32 |             }
33 | 
34 |             if(i == (len-1)){
35 |                 // int countZeros = len - (countPositive+countNegative);
36 | 
37 |                 System.out.printf("%1.6f \n",countPositive/len);
38 |                 System.out.printf("%1.6f \n",countNegative/len);
39 |                 System.out.printf("%1.6f \n",(len -(countPositive+countNegative))/len);
40 |             }
41 |         }
42 |         
43 |     }
44 | 
45 |     private static final Scanner scanner = new Scanner(System.in);
46 | 
47 |     public static void main(String[] args) {
48 |         int n = scanner.nextInt();
49 |         scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
50 | 
51 |         int[] arr = new int[n];
52 | 
53 |         String[] arrItems = scanner.nextLine().split(" ");
54 |         scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
55 | 
56 |         for (int i = 0; i < n; i++) {
57 |             int arrItem = Integer.parseInt(arrItems[i]);
58 |             arr[i] = arrItem;
59 |         }
60 | 
61 |         plusMinus(arr);
62 | 
63 |         scanner.close();
64 |     }
65 | }
66 | 


--------------------------------------------------------------------------------
/Algorithms/roadsandlibraries.java:
--------------------------------------------------------------------------------
 1 | import java.io.*;
 2 | import java.math.*;
 3 | import java.security.*;
 4 | import java.text.*;
 5 | import java.util.*;
 6 | import java.util.concurrent.*;
 7 | import java.util.regex.*;
 8 | 
 9 | //by jnaneswar
10 | public class Solution {
11 | 
12 |     // Complete the roadsAndLibraries function below.
13 |     static long roadsAndLibraries(int n, int c_lib, int c_road, int[][] cities) {
14 |        ArrayList<ArrayList<Integer>> adj = new ArrayList<ArrayList<Integer>>(n+1);
15 |        for(int i=0;i<=n;i++)
16 |        adj.add(new ArrayList<Integer>());
17 |        for(int i=0;i<cities.length;i++)
18 |        {
19 |            adj.get(cities[i][0]).add(cities[i][1]);
20 |            adj.get(cities[i][1]).add(cities[i][0]);
21 |        }
22 |   
23 |     boolean vis[] = new boolean[n+1];
24 |     ArrayList<Integer> comp = new ArrayList<Integer>();
25 | 
26 |     for(int i=1;i<=n;i++)
27 |     { 
28 |         if(!vis[i])
29 |         {
30 |             comp.add(dfs(adj,vis,i));
31 |         }
32 | 
33 |     }
34 |     long ans=0;
35 |     for(int i=0;i<comp.size();i++)
36 |     {
37 |         ans+=Math.min((comp.get(i)-1)*c_road+c_lib,comp.get(i)*c_lib);
38 |     }
39 |     return ans;
40 |     }
41 |     static int dfs(ArrayList<ArrayList<Integer>> adj,boolean[] vis , int s)
42 |     {    int ans=1;
43 |         vis[s]=true;
44 |         
45 |         for(int v:adj.get(s))
46 |         {
47 |             if(vis[v]==false)
48 |             ans+=dfs(adj,vis,v);
49 |         }
50 |         return ans;
51 |     }
52 | 
53 |     private static final Scanner scanner = new Scanner(System.in);
54 | 
55 |     public static void main(String[] args) throws IOException {
56 |         BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
57 | 
58 |         int q = scanner.nextInt();
59 |         scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
60 | 
61 |         for (int qItr = 0; qItr < q; qItr++) {
62 |             String[] nmC_libC_road = scanner.nextLine().split(" ");
63 | 
64 |             int n = Integer.parseInt(nmC_libC_road[0]);
65 | 
66 |             int m = Integer.parseInt(nmC_libC_road[1]);
67 | 
68 |             int c_lib = Integer.parseInt(nmC_libC_road[2]);
69 | 
70 |             int c_road = Integer.parseInt(nmC_libC_road[3]);
71 | 
72 |             int[][] cities = new int[m][2];
73 | 
74 |             for (int i = 0; i < m; i++) {
75 |                 String[] citiesRowItems = scanner.nextLine().split(" ");
76 |                 scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
77 | 
78 |                 for (int j = 0; j < 2; j++) {
79 |                     int citiesItem = Integer.parseInt(citiesRowItems[j]);
80 |                     cities[i][j] = citiesItem;
81 |                 }
82 |             }
83 | 
84 |             long result = roadsAndLibraries(n, c_lib, c_road, cities);
85 | 
86 |             bufferedWriter.write(String.valueOf(result));
87 |             bufferedWriter.newLine();
88 |         }
89 | 
90 |         bufferedWriter.close();
91 | 
92 |         scanner.close();
93 |     }
94 | }
95 | 


--------------------------------------------------------------------------------
/Algorithms/simple-array-sum.java:
--------------------------------------------------------------------------------
 1 | import java.io.*;
 2 | import java.math.*;
 3 | import java.text.*;
 4 | import java.util.*;
 5 | import java.util.regex.*;
 6 | 
 7 | public class Solution {
 8 | 
 9 |     /*
10 |      * Complete the simpleArraySum function below.
11 |      */
12 |     static int simpleArraySum(int[] ar) {
13 |         /*
14 |          * Write your code here.
15 |          */
16 | 
17 |         // ar = 1,2,3
18 | 
19 |         // intialize a variable with intial value as 0
20 |         // iterate through the array
21 |         // add each element's value to this variable
22 |         // assign the above value each time to variable
23 |         // return the final value of variable
24 | 
25 |         int sum = 0;
26 |         for(int i=0; i<ar.length; i++){
27 |            sum = sum + ar[i];
28 |            // 1st time sum - 1
29 |            // 2nd time sum - 3
30 |            // 3rd time sum - 6
31 |         }
32 |         return sum; // 6
33 |     }
34 | 
35 |     private static final Scanner scanner = new Scanner(System.in);
36 | 
37 |     public static void main(String[] args) throws IOException {
38 |         BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
39 | 
40 |         int arCount = Integer.parseInt(scanner.nextLine().trim());
41 | 
42 |         int[] ar = new int[arCount];
43 | 
44 |         String[] arItems = scanner.nextLine().split(" ");
45 | 
46 |         for (int arItr = 0; arItr < arCount; arItr++) {
47 |             int arItem = Integer.parseInt(arItems[arItr].trim());
48 |             ar[arItr] = arItem;
49 |         }
50 | 
51 |         int result = simpleArraySum(ar);
52 | 
53 |         bufferedWriter.write(String.valueOf(result));
54 |         bufferedWriter.newLine();
55 | 
56 |         bufferedWriter.close();
57 |     }
58 | }
59 | 


--------------------------------------------------------------------------------
/Algorithms/solve-me-first.java:
--------------------------------------------------------------------------------
 1 | import java.io.*;
 2 | import java.util.*;
 3 | import java.text.*;
 4 | import java.math.*;
 5 | import java.util.regex.*;
 6 | 
 7 | public class Solution {
 8 | 
 9 | 
10 |     static int solveMeFirst(int a, int b) {
11 |       	// Hint: Type return a+b; below 
12 |           return a+b;
13 |    }
14 | 
15 |  public static void main(String[] args) {
16 |         Scanner in = new Scanner(System.in);
17 |         int a;
18 |         a = in.nextInt();
19 |         int b;
20 |         b = in.nextInt();
21 |         int sum;
22 |         sum = solveMeFirst(a, b);
23 |         System.out.println(sum);
24 |    }
25 | }
26 | 


--------------------------------------------------------------------------------
/CODE_OF_CONDUCT.md:
--------------------------------------------------------------------------------
 1 | # Citizen Code of Conduct
 2 | 
 3 | ## 1. Purpose
 4 | 
 5 | A primary goal of codedecks-in/HackerRank Solutions is to be inclusive to the largest number of contributors, with the most varied and diverse backgrounds possible. As such, we are committed to providing a friendly, safe and welcoming environment for all, regardless of gender, sexual orientation, ability, ethnicity, socioeconomic status, and religion (or lack thereof).
 6 | 
 7 | This code of conduct outlines our expectations for all those who participate in our community, as well as the consequences for unacceptable behavior.
 8 | 
 9 | We invite all those who participate in Hacker Rank Solutions to help us create safe and positive experiences for everyone.
10 | 
11 | ## 2. Open [Source/Culture/Tech] Citizenship
12 | 
13 | A supplemental goal of this Code of Conduct is to increase open [source/culture/tech] citizenship by encouraging participants to recognize and strengthen the relationships between our actions and their effects on our community.
14 | 
15 | Communities mirror the societies in which they exist and positive action is essential to counteract the many forms of inequality and abuses of power that exist in society.
16 | 
17 | If you see someone who is making an extra effort to ensure our community is welcoming, friendly, and encourages all participants to contribute to the fullest extent, we want to know.
18 | 
19 | ## 3. Expected Behavior
20 | 
21 | The following behaviors are expected and requested of all community members:
22 | 
23 |  * Participate in an authentic and active way. In doing so, you contribute to the health and longevity of this community.
24 |  * Exercise consideration and respect in your speech and actions.
25 |  * Attempt collaboration before conflict.
26 |  * Refrain from demeaning, discriminatory, or harassing behavior and speech.
27 |  * Be mindful of your surroundings and of your fellow participants. Alert community leaders if you notice a dangerous situation, someone in distress, or violations of this Code of Conduct, even if they seem inconsequential.
28 |  * Remember that community event venues may be shared with members of the public; please be respectful to all patrons of these locations.
29 | 
30 | ## 4. Unacceptable Behavior
31 | 
32 | The following behaviors are considered harassment and are unacceptable within our community:
33 | 
34 |  * Violence, threats of violence or violent language directed against another person.
35 |  * Sexist, racist, homophobic, transphobic, ableist or otherwise discriminatory jokes and language.
36 |  * Posting or displaying sexually explicit or violent material.
37 |  * Posting or threatening to post other people's personally identifying information ("doxing").
38 |  * Personal insults, particularly those related to gender, sexual orientation, race, religion, or disability.
39 |  * Inappropriate photography or recording.
40 |  * Inappropriate physical contact. You should have someone's consent before touching them.
41 |  * Unwelcome sexual attention. This includes, sexualized comments or jokes; inappropriate touching, groping, and unwelcomed sexual advances.
42 |  * Deliberate intimidation, stalking or following (online or in person).
43 |  * Advocating for, or encouraging, any of the above behavior.
44 |  * Sustained disruption of community events, including talks and presentations.
45 | 
46 | ## 5. Weapons Policy
47 | 
48 | No weapons will be allowed at Hacker Rank Solutions events, community spaces, or in other spaces covered by the scope of this Code of Conduct. Weapons include but are not limited to guns, explosives (including fireworks), and large knives such as those used for hunting or display, as well as any other item used for the purpose of causing injury or harm to others. Anyone seen in possession of one of these items will be asked to leave immediately, and will only be allowed to return without the weapon. Community members are further expected to comply with all state and local laws on this matter.
49 | 
50 | ## 6. Consequences of Unacceptable Behavior
51 | 
52 | Unacceptable behavior from any community member, including sponsors and those with decision-making authority, will not be tolerated.
53 | 
54 | Anyone asked to stop unacceptable behavior is expected to comply immediately.
55 | 
56 | If a community member engages in unacceptable behavior, the community organizers may take any action they deem appropriate, up to and including a temporary ban or permanent expulsion from the community without warning (and without refund in the case of a paid event).
57 | 
58 | ## 7. Reporting Guidelines
59 | 
60 | If you are subject to or witness unacceptable behavior, or have any other concerns, please notify a community organizer as soon as possible. codedeckscompete@gmail.com.
61 | 
62 | 
63 | 
64 | Additionally, community organizers are available to help community members engage with local law enforcement or to otherwise help those experiencing unacceptable behavior feel safe. In the context of in-person events, organizers will also provide escorts as desired by the person experiencing distress.
65 | 
66 | ## 8. Addressing Grievances
67 | 
68 | If you feel you have been falsely or unfairly accused of violating this Code of Conduct, you should notify codedecks-in with a concise description of your grievance. Your grievance will be handled in accordance with our existing governing policies. 
69 | 
70 | 
71 | 
72 | ## 9. Scope
73 | 
74 | We expect all community participants (contributors, paid or otherwise; sponsors; and other guests) to abide by this Code of Conduct in all community venues--online and in-person--as well as in all one-on-one communications pertaining to community business.
75 | 
76 | This code of conduct and its related procedures also applies to unacceptable behavior occurring outside the scope of community activities when such behavior has the potential to adversely affect the safety and well-being of community members.
77 | 
78 | ## 10. Contact info
79 | 
80 | codedeckscompete@gmail.com
81 | 
82 | ## 11. License and attribution
83 | 
84 | The Citizen Code of Conduct is distributed by [Stumptown Syndicate](http://stumptownsyndicate.org) under a [Creative Commons Attribution-ShareAlike license](http://creativecommons.org/licenses/by-sa/3.0/). 
85 | 
86 | Portions of text derived from the [Django Code of Conduct](https://www.djangoproject.com/conduct/) and the [Geek Feminism Anti-Harassment Policy](http://geekfeminism.wikia.com/wiki/Conference_anti-harassment/Policy).
87 | 
88 | _Revision 2.3. Posted 6 March 2017._
89 | 
90 | _Revision 2.2. Posted 4 February 2016._
91 | 
92 | _Revision 2.1. Posted 23 June 2014._
93 | 
94 | _Revision 2.0, adopted by the [Stumptown Syndicate](http://stumptownsyndicate.org) board on 10 January 2013. Posted 17 March 2013._
95 | 


--------------------------------------------------------------------------------
/CONTRIBUTING.md:
--------------------------------------------------------------------------------
 1 | # Contributing
 2 | 
 3 | When contributing to this repository, please first discuss the change you wish to make via issue,
 4 | email, or any other method with the owners of this repository before making a change. 
 5 | 
 6 | Please note we have a code of conduct, please follow it in all your interactions with the project.
 7 | 
 8 | ## Pull Request Process
 9 | 
10 | 1. Ensure any install or build dependencies are removed before the end of the layer when doing a 
11 |    build.
12 | 2. Update the README.md with details of changes to the interface, this includes new environment 
13 |    variables, exposed ports, useful file locations and container parameters.
14 | 3. You may merge the Pull Request in once you have the sign-off of two other developers, or if you 
15 |    do not have permission to do that, you may request the second reviewer to merge it for you.
16 | 
17 | ## Code of Conduct
18 | 
19 | ### Our Pledge
20 | 
21 | In the interest of fostering an open and welcoming environment, we as
22 | contributors and maintainers pledge to making participation in our project and
23 | our community a harassment-free experience for everyone, regardless of age, body
24 | size, disability, ethnicity, gender identity and expression, level of experience,
25 | nationality, personal appearance, race, religion, or sexual identity and
26 | orientation.
27 | 
28 | ### Our Standards
29 | 
30 | Examples of behavior that contributes to creating a positive environment
31 | include:
32 | 
33 | * Using welcoming and inclusive language
34 | * Being respectful of differing viewpoints and experiences
35 | * Gracefully accepting constructive criticism
36 | * Focusing on what is best for the community
37 | * Showing empathy towards other community members
38 | 
39 | Examples of unacceptable behavior by participants include:
40 | 
41 | * The use of sexualized language or imagery and unwelcome sexual attention or
42 | advances
43 | * Trolling, insulting/derogatory comments, and personal or political attacks
44 | * Public or private harassment
45 | * Publishing others' private information, such as a physical or electronic
46 |   address, without explicit permission
47 | * Other conduct which could reasonably be considered inappropriate in a
48 |   professional setting
49 | 
50 | ### Our Responsibilities
51 | 
52 | Project maintainers are responsible for clarifying the standards of acceptable
53 | behavior and are expected to take appropriate and fair corrective action in
54 | response to any instances of unacceptable behavior.
55 | 
56 | Project maintainers have the right and responsibility to remove, edit, or
57 | reject comments, commits, code, wiki edits, issues, and other contributions
58 | that are not aligned to this Code of Conduct, or to ban temporarily or
59 | permanently any contributor for other behaviors that they deem inappropriate,
60 | threatening, offensive, or harmful.
61 | 
62 | ### Scope
63 | 
64 | This Code of Conduct applies both within project spaces and in public spaces
65 | when an individual is representing the project or its community. Examples of
66 | representing a project or community include using an official project e-mail
67 | address, posting via an official social media account, or acting as an appointed
68 | representative at an online or offline event. Representation of a project may be
69 | further defined and clarified by project maintainers.
70 | 
71 | ### Enforcement
72 | 
73 | Instances of abusive, harassing, or otherwise unacceptable behavior may be
74 | reported by contacting the project team at [INSERT EMAIL ADDRESS]. All
75 | complaints will be reviewed and investigated and will result in a response that
76 | is deemed necessary and appropriate to the circumstances. The project team is
77 | obligated to maintain confidentiality with regard to the reporter of an incident.
78 | Further details of specific enforcement policies may be posted separately.
79 | 
80 | Project maintainers who do not follow or enforce the Code of Conduct in good
81 | faith may face temporary or permanent repercussions as determined by other
82 | members of the project's leadership.
83 | 
84 | ### Attribution
85 | 
86 | This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,
87 | available at [http://contributor-covenant.org/version/1/4][version]
88 | 
89 | [homepage]: http://contributor-covenant.org
90 | [version]: http://contributor-covenant.org/version/1/4/
91 | 


--------------------------------------------------------------------------------
/Data-Structures/compare-two-linked-lists.java:
--------------------------------------------------------------------------------
 1 | // only compareLists method
 2 | static boolean compareLists(SinglyLinkedListNode head1, SinglyLinkedListNode head2)    {
 3 |         while(head1 != null || head2 != null){
 4 |             
 5 |             if(head1 == null || head2 == null){
 6 |                 return false;
 7 |             }
 8 |             
 9 |             if(head1.data != head2.data){
10 |                 return false;
11 |             }
12 |             
13 |             head1 = head1.next;
14 |             head2 = head2.next;
15 |         }
16 |         return true;
17 |     }
18 | 


--------------------------------------------------------------------------------
/Data-Structures/insertAtEndOfLinkedList.java:
--------------------------------------------------------------------------------
 1 | 
 2 | 
 3 |     // Complete the insertNodeAtTail function below.
 4 | 
 5 |     /*
 6 |      * For your reference:
 7 |      *
 8 |      * SinglyLinkedListNode {
 9 |      *     int data;
10 |      *     SinglyLinkedListNode next;
11 |      * }
12 |      *
13 |      */
14 |     static SinglyLinkedListNode insertNodeAtTail(SinglyLinkedListNode head, int data) {
15 |         SinglyLinkedListNode newNode = new SinglyLinkedListNode(data);
16 |         
17 |         if (head == null){
18 |             return newNode;
19 |         }
20 |         SinglyLinkedListNode currHead = head;
21 | 
22 |         while(currHead.next != null){
23 |             currHead = currHead.next;
24 |         }
25 |         currHead.next = newNode;
26 |         newNode.next = null;
27 | 
28 |         return head;
29 |     }
30 | 
31 | 


--------------------------------------------------------------------------------
/Data-Structures/insertAtHeadOfLinkedList.java:
--------------------------------------------------------------------------------
 1 | 
 2 | 
 3 |     // Complete the insertNodeAtHead function below.
 4 | 
 5 |     /*
 6 |      * For your reference:
 7 |      *
 8 |      * SinglyLinkedListNode {
 9 |      *     int data;
10 |      *     SinglyLinkedListNode next;
11 |      * }
12 |      *
13 |      */
14 |     static SinglyLinkedListNode insertNodeAtHead(SinglyLinkedListNode llist, int data) {
15 | 
16 |         SinglyLinkedListNode newNode = new SinglyLinkedListNode(data);
17 |         
18 |         newNode.next = llist;
19 |         
20 |         return newNode;
21 |     }
22 | 
23 | 


--------------------------------------------------------------------------------
/Data-Structures/insertAtPositionOfLinkedList.java:
--------------------------------------------------------------------------------
 1 | 
 2 | 
 3 |     // Complete the insertNodeAtPosition function below.
 4 | 
 5 |     /*
 6 |      * For your reference:
 7 |      *
 8 |      * SinglyLinkedListNode {
 9 |      *     int data;
10 |      *     SinglyLinkedListNode next;
11 |      * }
12 |      *
13 |      */
14 |     static SinglyLinkedListNode insertNodeAtPosition(SinglyLinkedListNode head, int data, int index) {
15 | 
16 |         if (head == null) {
17 |             return new SinglyLinkedListNode(data);
18 |         }
19 |         
20 |         SinglyLinkedListNode currHead = head;
21 |         SinglyLinkedListNode newNode = new SinglyLinkedListNode(data);
22 | 
23 |         int count = 0;
24 | 
25 |         if (count == index) {
26 |             newNode.next = currHead;
27 |             return newNode;
28 |         }
29 | 
30 |         while (count < index-1) {
31 |             currHead = currHead.next;
32 |             count++;
33 |         }
34 |         
35 |         SinglyLinkedListNode temp = currHead.next;
36 |         currHead.next = newNode;
37 |         newNode.next = temp;
38 | 
39 |         return head;
40 |     }
41 | 
42 | 


--------------------------------------------------------------------------------
/Data-Structures/traverse-linkedlist.java:
--------------------------------------------------------------------------------
 1 | import java.io.*;
 2 | import java.math.*;
 3 | import java.security.*;
 4 | import java.text.*;
 5 | import java.util.*;
 6 | import java.util.concurrent.*;
 7 | import java.util.regex.*;
 8 | 
 9 | public class Solution {
10 | 
11 |     static class SinglyLinkedListNode {
12 |         public int data;
13 |         public SinglyLinkedListNode next;
14 | 
15 |         public SinglyLinkedListNode(int nodeData) {
16 |             this.data = nodeData;
17 |             this.next = null;
18 |         }
19 |     }
20 | 
21 |     static class SinglyLinkedList {
22 |         public SinglyLinkedListNode head;
23 |         public SinglyLinkedListNode tail;
24 | 
25 |         public SinglyLinkedList() {
26 |             this.head = null;
27 |             this.tail = null;
28 |         }
29 | 
30 |         public void insertNode(int nodeData) {
31 |             SinglyLinkedListNode node = new SinglyLinkedListNode(nodeData);
32 | 
33 |             if (this.head == null) {
34 |                 this.head = node;
35 |             } else {
36 |                 this.tail.next = node;
37 |             }
38 | 
39 |             this.tail = node;
40 |         }
41 |     }
42 | 
43 |     // Complete the printLinkedList function below.
44 | 
45 |     /*
46 |      * For your reference:
47 |      *
48 |      * SinglyLinkedListNode {
49 |      *     int data;
50 |      *     SinglyLinkedListNode next;
51 |      * }
52 |      *
53 |      */
54 |     static void printLinkedList(SinglyLinkedListNode head) {
55 |         SinglyLinkedListNode currHead = head;
56 | 
57 |         while (currHead != null){
58 |             System.out.println(currHead.data);
59 |             currHead = currHead.next;
60 |         }
61 |     }
62 | 
63 |     private static final Scanner scanner = new Scanner(System.in);


--------------------------------------------------------------------------------
/Java-Strings/java-string-reverse.java:
--------------------------------------------------------------------------------
 1 | import java.io.*;
 2 | import java.util.*;
 3 | 
 4 | public class Solution {
 5 | 
 6 |     public static void main(String[] args) {
 7 |         
 8 |         Scanner sc=new Scanner(System.in);
 9 |         String A=sc.next();
10 |         /* Enter your code here. Print output to STDOUT. */
11 |         StringBuffer sb = new StringBuffer(A);
12 |         
13 |         sb.reverse();
14 |         String newA = sb.toString();
15 |         
16 |         if(A.equals(newA))
17 |             System.out.println("Yes");
18 |         else
19 |             System.out.println("No");
20 |     }
21 | }
22 | 


--------------------------------------------------------------------------------
/Java-Strings/java-strings-introduction.java:
--------------------------------------------------------------------------------
 1 | import java.io.*;
 2 | import java.util.*;
 3 | 
 4 | public class Solution {
 5 | 
 6 |     public static void main(String[] args) {
 7 |         
 8 |         Scanner sc=new Scanner(System.in);
 9 |         String A=sc.next();
10 |         String B=sc.next();
11 |          
12 |         /* Enter your code here. Print output to STDOUT. */
13 |         
14 |         //op 1
15 |         System.out.println(A.length()+B.length());
16 |         
17 |         //op 2
18 |         if(A.compareTo(B) > 1)
19 |             System.out.println("Yes");
20 |         else
21 |             System.out.println("No");
22 |         
23 |         //op 3
24 |         A = A.substring(0, 1).toUpperCase() + A.substring(1);
25 |         B = B.substring(0, 1).toUpperCase() + B.substring(1);
26 |         
27 |         System.out.println(A+" "+B);
28 |     }
29 | }
30 | 


--------------------------------------------------------------------------------
/Java-Strings/java-substring.java:
--------------------------------------------------------------------------------
 1 | import java.io.*;
 2 | import java.util.*;
 3 | import java.text.*;
 4 | import java.math.*;
 5 | import java.util.regex.*;
 6 | 
 7 | public class Solution {
 8 | 
 9 |     public static void main(String[] args) {
10 |         Scanner in = new Scanner(System.in);
11 |         String S = in.next();
12 |         int start = in.nextInt();
13 |         int end = in.nextInt();
14 |         
15 |         System.out.println(S.substring(start, end));
16 |     }
17 | }
18 | 


--------------------------------------------------------------------------------
/Java/java-end-of-file.java:
--------------------------------------------------------------------------------
 1 | import java.io.*;
 2 | import java.util.*;
 3 | import java.text.*;
 4 | import java.math.*;
 5 | import java.util.regex.*;
 6 | 
 7 | public class Solution {
 8 | 
 9 |     public static void main(String[] args) {
10 |         /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
11 |         Scanner kb = new Scanner(System.in);
12 |         String [] str = new String[100000];
13 |         int i =0;
14 |         
15 |         while(kb.hasNext()){
16 |             str[i++] = kb.nextLine();
17 |         }
18 |         kb.close();
19 |         i--;
20 |         int x = i;
21 |         i = 0;
22 |         
23 |         while(i<=x){
24 |             System.out.println((i+1)+" "+str[i]);
25 |             i++;
26 |         }
27 |     }
28 | }
29 | 


--------------------------------------------------------------------------------
/Java/java-if-else.java:
--------------------------------------------------------------------------------
 1 | import java.io.*;
 2 | import java.math.*;
 3 | import java.security.*;
 4 | import java.text.*;
 5 | import java.util.*;
 6 | import java.util.concurrent.*;
 7 | import java.util.regex.*;
 8 | 
 9 | public class Solution {
10 | 
11 |     private static final Scanner scanner = new Scanner(System.in);
12 | 
13 |     public static void main(String[] args) {
14 |         int N = scanner.nextInt();
15 |         scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
16 | 
17 |         // N is odd
18 |         // N%2 give remainder when divided by 2
19 |         // if-else ladder
20 |         if (N%2 != 0) {
21 |             System.out.println("Weird");
22 |         }
23 |         else if (N>=2 && N<=5){
24 |             System.out.println("Not Weird");
25 |         }
26 |         else if (N>=6 && N<=20){
27 |             System.out.println("Weird");
28 |         }
29 |         else{
30 |           System.out.println("Not Weird");  
31 |         }
32 |         scanner.close();
33 |     }
34 | }
35 | 


--------------------------------------------------------------------------------
/Java/java-int-to-string.java:
--------------------------------------------------------------------------------
 1 | import java.util.*;
 2 | import java.security.*;
 3 | public class Solution {
 4 |  public static void main(String[] args) {
 5 | 
 6 |   DoNotTerminate.forbidExit();
 7 | 
 8 |   try {
 9 |    Scanner in = new Scanner(System.in);
10 |    int n = in .nextInt();
11 |    in.close();
12 |    //String s=???; Complete this line below
13 | 
14 |             String s = "" + n;
15 |    
16 |    if (n == Integer.parseInt(s)) {
17 |     System.out.println("Good job");
18 |    } else {
19 |     System.out.println("Wrong answer.");
20 |    }
21 |   } catch (DoNotTerminate.ExitTrappedException e) {
22 |    System.out.println("Unsuccessful Termination!!");
23 |   }
24 |  }
25 | }
26 | 
27 | //The following class will prevent you from terminating the code using exit(0)!
28 | class DoNotTerminate {
29 | 
30 |  public static class ExitTrappedException extends SecurityException {
31 | 
32 |   private static final long serialVersionUID = 1;
33 |  }
34 | 
35 |  public static void forbidExit() {
36 |   final SecurityManager securityManager = new SecurityManager() {
37 |    @Override
38 |    public void checkPermission(Permission permission) {
39 |     if (permission.getName().contains("exitVM")) {
40 |      throw new ExitTrappedException();
41 |     }
42 |    }
43 |   };
44 |   System.setSecurityManager(securityManager);
45 |  }
46 | }
47 | 


--------------------------------------------------------------------------------
/Java/java-loops-i.java:
--------------------------------------------------------------------------------
 1 | import java.io.*;
 2 | import java.math.*;
 3 | import java.security.*;
 4 | import java.text.*;
 5 | import java.util.*;
 6 | import java.util.concurrent.*;
 7 | import java.util.regex.*;
 8 | 
 9 | public class Solution {
10 | 
11 |     private static final Scanner scanner = new Scanner(System.in);
12 | 
13 |     public static void main(String[] args) {
14 |         int N = scanner.nextInt();
15 |         scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
16 |         
17 |         for(int i=1; i<=10; i++){
18 |             System.out.println(N+ " x " + i + " = " + (N*i));
19 |         }
20 |         scanner.close();
21 |     }
22 | }
23 | 


--------------------------------------------------------------------------------
/Java/java-loops-ii.java:
--------------------------------------------------------------------------------
 1 | import java.util.*;
 2 | import java.io.*;
 3 | 
 4 | class Solution{
 5 |     public static void main(String []argh){
 6 |         Scanner in = new Scanner(System.in);
 7 |         int t=in.nextInt();
 8 | 
 9 |         for(int i=0;i<t;i++){
10 |             int a = in.nextInt();
11 |             int b = in.nextInt();
12 |             int n = in.nextInt();
13 | 
14 |             // 0 2 10
15 | 
16 |             int sum = a;
17 | 
18 |             // sum = sum + Math.pow(2, j)
19 | 
20 |             for(int j=0;j<n;j++){
21 |                 sum += Math.pow(2,j) * b;
22 |                 System.out.print(sum + " ");
23 |             }
24 |             System.out.println();
25 |         }
26 |         in.close();
27 |     }
28 | }
29 | 


--------------------------------------------------------------------------------
/Java/java-output-formatting.java:
--------------------------------------------------------------------------------
 1 | import java.util.Scanner;
 2 | 
 3 | public class Solution {
 4 | 
 5 |     public static void main(String[] args) {
 6 |             Scanner sc=new Scanner(System.in);
 7 |             System.out.println("================================");
 8 |             for(int i=0;i<3;i++)
 9 |             {
10 |                 String s1=sc.next();
11 |                 int x=sc.nextInt();
12 |                 //Complete this line
13 |                 System.out.printf("%-15s%03d",s1,x);
14 |                 System.out.println();
15 |             }
16 |             System.out.println("================================");
17 | 
18 |     }
19 | }
20 | 


--------------------------------------------------------------------------------
/Java/java-static-initializer-block.java:
--------------------------------------------------------------------------------
 1 | import java.io.*;
 2 | import java.util.*;
 3 | import java.text.*;
 4 | import java.math.*;
 5 | import java.util.regex.*;
 6 | 
 7 | public class Solution {
 8 | 
 9 |      public static boolean flag = true;
10 |      public static int B = 0;
11 |      public static int H = 0;
12 | 
13 |      static{
14 |      //int flag = 1;
15 |      Scanner kb = new Scanner(System.in);
16 |             
17 |      B = kb.nextInt();
18 |      H = kb.nextInt();
19 |      
20 |      if(B<=0 || H<=0){
21 |          System.out.println("java.lang.Exception: Breadth and height must be positive");
22 |          flag=false;
23 |          }
24 |       }
25 | public static void main(String[] args){
26 | 		if(flag){
27 | 			int area=B*H;
28 | 			System.out.print(area);
29 | 		}
30 | 		
31 | 	}//end of main
32 | 
33 | }//end of class
34 | 


--------------------------------------------------------------------------------
/Java/java_stdin_stdout_ii.java:
--------------------------------------------------------------------------------
 1 | import java.util.Scanner;
 2 | 
 3 | public class Solution {
 4 | 
 5 |     public static void main(String[] args) {
 6 |         Scanner scan = new Scanner(System.in);
 7 |         int i = scan.nextInt();
 8 | 
 9 |         // Write your code here.
10 |         double d = scan.nextDouble();
11 |         // String s = scan.next(); // next will only read until space occurs
12 | 
13 |         // 3.1415_
14 |         // 
15 | 
16 |         scan.nextLine();
17 |         // Welcome to HackerRank's Java tutorials!
18 |         String s = scan.nextLine();
19 | 
20 |         System.out.println("String: " + s);
21 |         System.out.println("Double: " + d);
22 |         System.out.println("Int: " + i);
23 |     }
24 | }
25 | 


--------------------------------------------------------------------------------
/Java/scanner.java:
--------------------------------------------------------------------------------
 1 | import java.util.*;
 2 | 
 3 | public class Solution {
 4 | 
 5 |     public static void main(String[] args) {
 6 |         Scanner scan = new Scanner(System.in);
 7 |         int a = scan.nextInt();
 8 |         int b = scan.nextInt();
 9 |         int c = scan.nextInt();
10 |         // Complete this line
11 |         // Complete this line
12 | 
13 |         System.out.println(a);
14 |         System.out.println(b);
15 |         System.out.println(c);
16 |         // Complete this line
17 |         // Complete this line
18 |     }
19 | }
20 | 


--------------------------------------------------------------------------------
/Java/welcome-to-java.java:
--------------------------------------------------------------------------------
1 | public class Solution {
2 | 
3 |     public static void main(String[] args) {
4 |         /* Enter your code here. Print output to STDOUT. Your class should be named Solution. */
5 |         System.out.println("Hello, World.");
6 |         System.out.println("Hello, Java.");
7 |     }
8 | }
9 | 


--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
 1 | MIT License
 2 | 
 3 | Copyright (c) 2020 codedecks-in
 4 | 
 5 | Permission is hereby granted, free of charge, to any person obtaining a copy
 6 | of this software and associated documentation files (the "Software"), to deal
 7 | in the Software without restriction, including without limitation the rights
 8 | to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 9 | copies of the Software, and to permit persons to whom the Software is
10 | furnished to do so, subject to the following conditions:
11 | 
12 | The above copyright notice and this permission notice shall be included in all
13 | copies or substantial portions of the Software.
14 | 
15 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
21 | SOFTWARE.
22 | 


--------------------------------------------------------------------------------
/PULL_REQUEST_TEMPLATE:
--------------------------------------------------------------------------------
 1 | # Pull Request Template
 2 | 
 3 | ## Description
 4 | 
 5 | Please include a summary of the change and which issue is fixed. Please also include relevant motivation and context. List any dependencies that are required for this change.
 6 | 
 7 | Fixes # (issue)
 8 | 
 9 | ## How Has This Been Tested?
10 | 
11 | Please describe the tests that you ran to verify your changes. Please also note any relevant details for your test configuration.
12 | 
13 | - [ ] Test A
14 | - [ ] Test B
15 | 
16 | ## Checklist:
17 | 
18 | - [ ] My code follows the style guidelines of this project
19 | - [ ] I have performed a self-review of my own code
20 | - [ ] I have commented my code, particularly in hard-to-understand areas
21 | - [ ] I have made corresponding changes to the documentation
22 | - [ ] My changes generate no new warnings
23 | - [ ] Any dependent changes have been merged and published in downstream modules
24 | 


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
  1 | # HackerRank Solutions
  2 | 
  3 | <p align="center">
  4 | <a  href="https://www.facebook.com/groups/codedecks">
  5 |        <img align="left" height=85 src="https://static1.squarespace.com/static/5994a0f17131a5643f407c37/t/5bf9070c0ebbe88c3392b17c/1543047009836/facebook_button.png">
  6 |    </a>
  7 |    <a href="https://www.youtube.com/c/codedecks?sub_confirmation=1">
  8 |        <img align="right" height=85 src="https://www.freepngimg.com/thumb/subscribe/4-2-subscribe-png-2.png">
  9 |    </a>
 10 |  <p/>
 11 | 
 12 | 
 13 | [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://github.com/codedecks-in/HackerRank-Solutions/blob/master/LICENSE)
 14 | [![Open Source Love](https://badges.frapsoft.com/os/v1/open-source.svg?v=103)](https://github.com/ellerbrock/open-source-badges/)
 15 | [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg?style=flat-square)](https://github.com/codedecks-in/HackerRank-Solutions/blob/master/PULL_REQUEST_TEMPLATE)
 16 | [![first-timers-only-friendly](http://img.shields.io/badge/first--timers--only-friendly-blue.svg?style=flat-square)](https://code.publiclab.org#r=all)
 17 | [![HitCount](http://hits.dwyl.com/codedecks-in/HackerRank-Solutions.svg)](http://hits.dwyl.com/codedecks-in/HackerRank-Solutions)
 18 | 
 19 | [![Everything Is AWESOME](https://github.com/codedecks-in/HackerRank-Solutions/blob/master/codedecks.jpg)](https://www.youtube.com/c/codedecks?sub_confirmation=1 "Everything Is AWESOME")
 20 | 
 21 | - ### This project include solutions of the problem from hackerrank which will be helpful for coding interview preparation. This project is work in progress, we are uploading solutions as soon as new video is releasing in our youtube channel [codedecks](https://www.youtube.com/c/codedecks?sub_confirmation=1)
 22 | - ### Don't forget to give us a 🌟 to support us to make this helpful for people preparing for coding competitions and doing interview preparations.
 23 | 
 24 | ----------------------------
 25 | Welcome geeks !!!
 26 | <br>
 27 | 
 28 | Are you looking for anyone of these things ?
 29 | 
 30 | hackerrank solutions java GitHub | hackerrank tutorial in java | hackerrank 30 days of code solutions | hackerrank algorithms solutions | hackerrank cracking the coding interview solutions | hackerrank general programming solutions | hackerrank implementation solutions | hackerrank data structures solutions in java | hackerrank algorithm solution in java | hackerrank challenges solutions | hackerrank practices solutions | hackerrank coding challenges solutions | hackerrank questions | hackerrank problems | how to solve hackerrank practice problem in java | problem solving | coding interview | coding | programming | codedecks | codedecks compete
 31 | 
 32 | -----------------------------
 33 | 
 34 | ### Contents
 35 | * [JAVA](#java)
 36 | * [ALGORITHMS](#algorithms)
 37 | * [DATA STRUCTURES](#data-structures)
 38 | * [IMPLEMENTATION](#implementation)
 39 | * [LEARNING RESOURCES](#learning-resources)
 40 | 
 41 | 
 42 | # [JAVA](https://www.hackerrank.com/domains/java)
 43 | | Subdomain    | Description/Title                                                                | Solution                                                                         | Video Explaination      |
 44 | | ---- | ---------------------------------------------------------------------- | --------------------------------------------------------------------------------------- | ----------------- |
 45 | |  Introduction  | [Welcome to Java!](https://www.hackerrank.com/challenges/welcome-to-java/problem)| [Solution1.java](./Java/welcome-to-java.java)    									    |							[YT Video](https://youtu.be/r268lvNP5OU)							       |
 46 | |  Introduction  | [Java Stdin and Stdout I](https://www.hackerrank.com/challenges/java-stdin-and-stdout-1/problem)| [Solution2.java](./Java/scanner.java)    									    |								[YT Video](https://youtu.be/r268lvNP5OU)						       |
 47 | |  Introduction  | [Java If-Else](https://www.hackerrank.com/challenges/java-if-else/problem)| [Solution3.java](./Java/java-if-else.java)    									    |	[YT Video](https://youtu.be/O0q_zZI7ccM)													       |
 48 | |  Introduction  | [Java Stdin and Stdout II](https://www.hackerrank.com/challenges/java-stdin-stdout/problem)| [Solution4.java](./Java/java_stdin_stdout_ii.java)    									    |							[YT Video](https://youtu.be/BPjNbwO02IY)							       |
 49 | |  Introduction  | [Java Loops I](https://www.hackerrank.com/challenges/java-loops-i/problem)| [Solution5.java](./Java/java-loops-i.java)    									    |							[YT Video](https://youtu.be/kfTsUFggRhI)							       |
 50 | |  Introduction  | [Java Loops II](https://www.hackerrank.com/challenges/java-loops/problem)| [Solution6.java](./Java/java-loops-ii.java)    									    |						[YT Video](https://youtu.be/jXY0GVkSMDU)							       |
 51 | |  Introduction  | [Java Output Formatting](https://www.hackerrank.com/challenges/java-output-formatting/problem)| [Solution7.java](./Java/java-output-formatting.java)    									    |						[YT Video]()							       |
 52 | |  Introduction  | [Java End-of-file](https://www.hackerrank.com/challenges/java-end-of-file/problem)| [Solution8.java](./Java/java-end-of-file.java)    									    |						[YT Video]()							       |
 53 | |  Introduction  | [Java Static Initializer Block](https://www.hackerrank.com/challenges/java-static-initializer-block/problem)| [Solution9.java](./Java/java-static-initializer-block.java)    									    |						[YT Video]()							       |
 54 | |  Introduction  | [Java Int to String](https://www.hackerrank.com/challenges/java-int-to-string/problem)| [Solution10.java](./Java/java-int-to-string.java)    									    |						[YT Video]()							       |
 55 | 
 56 | 
 57 | 
 58 | # [ALGORITHMS](https://www.hackerrank.com/domains/algorithms)
 59 | | Subdomain    | Description/Title                                                                | Solution                                                                         | Video Explaination      |
 60 | | ---- | ---------------------------------------------------------------------- | --------------------------------------------------------------------------------------- | ----------------- |
 61 | |  Warmup  | [Solve Me First](https://www.hackerrank.com/challenges/solve-me-first/problem)| [Solution1.java](./Algorithms/solve-me-first.java)    									    |								[YT Video](https://youtu.be/pO3lF-trL6E)						       |
 62 | |  Warmup  | [Simple Array Sum](https://www.hackerrank.com/challenges/simple-array-sum/problem)| [Solution2.java](./Algorithms/simple-array-sum.java)    									    |							[YT Video](https://youtu.be/avg_9s_39fM)							       |
 63 | |  Warmup  | [Compare the Triplets](https://www.hackerrank.com/challenges/compare-the-triplets/problem)| [Solution3.java](./Algorithms/compare-the-triplets.java)    									    |								[YT Video](https://youtu.be/46SWRZ_yFvc)						       |
 64 | |  Warmup  | [Mini-Max Sum](https://www.hackerrank.com/challenges/mini-max-sum/problem)| [Solution4.java](./Algorithms/mini-max-sum.java)    									    |								[YT Video](https://youtu.be/iL6sAbLRspM)						       |
 65 | |  Warmup  | [Plus Minus](https://www.hackerrank.com/challenges/plus-minus/problem)| [Solution5.java](./Algorithms/plus-minus.java)    									    |								[YT Video](https://youtu.be/D4S9CQU-Cx0)						       |
 66 | |  Warmup  | [Birthday Cake Candles](https://www.hackerrank.com/challenges/birthday-cake-candles)| [Solution6.java](./Algorithms/birthday-cake-candles.java)    									    |								[YT Video](https://youtu.be/B9v4jqx17dY)						       |
 67 | |  Warmup  | [Roads and Libraries](https://www.hackerrank.com/challenges/torque-and-development/problem)| [Solution7.java](./Algorithms/roadsandlibraries.java)    									    |								[YT Video]()						       |
 68 | 
 69 | # [DATA STRUCTURES](https://www.hackerrank.com/domains/data-structures)
 70 | | Subdomain    | Description/Title                                                                | Solution                                                                         | Video Explaination      |
 71 | | ---- | ---------------------------------------------------------------------- | --------------------------------------------------------------------------------------- | ----------------- |
 72 | |  Easy  | [Print the Elements of a Linked List](https://www.hackerrank.com/challenges/print-the-elements-of-a-linked-list/problem)| [Solution1.java](./Data-Structures/traverse-linkedlist.java)    									    |								[YT Video](https://youtu.be/KVTaQ0jy7Jw)						       |
 73 | |  Easy  | [Insert a node at the head of a linked list](https://www.hackerrank.com/challenges/insert-a-node-at-the-head-of-a-linked-list/problem)| [Solution2.java](./Data-Structures/insertAtHeadOfLinkedList.java)    									    |								[YT Video](https://youtu.be/KVTaQ0jy7Jw)
 74 | |  Easy  | [Insert a Node at the Tail of a Linked List](https://www.hackerrank.com/challenges/insert-a-node-at-the-tail-of-a-linked-list/problem)| [Solution3.java](./Data-Structures/insertAtEndOfLinkedList.java)    									    |								[YT Video](https://youtu.be/KVTaQ0jy7Jw)
 75 | |  Easy  | [Insert a node at a specific position in a linked list](https://www.hackerrank.com/challenges/insert-a-node-at-a-specific-position-in-a-linked-list/problem)| [Solution4.java](./Data-Structures/insertAtPositionOfLinkedList.java)    									    |				[YT Video](https://youtu.be/KVTaQ0jy7Jw)
 76 | |  Easy  | [Compare two linked lists](https://www.hackerrank.com/challenges/compare-two-linked-lists/problem)| [Solution5.java](./Data-Structures/compare-two-linked-lists.java) |	[YT Video](https://youtu.be/KVTaQ0jy7Jw)
 77 | 
 78 | # Learning Resources
 79 | 1.) [Cracking the Coding Interview](https://amzn.to/3fH727G)
 80 | 
 81 | 2.) [Data Structures and Algorithms Made Easy in Java](https://amzn.to/3fJXsRC)
 82 | 
 83 | 3.) [Data Structure and Algorithmic Thinking with Python](https://amzn.to/30Ldczp)
 84 | 
 85 | 4.) [Grooking Algorithms](https://amzn.to/3aeTcrV)
 86 | 
 87 | 5.) [Dynamic Programming for Coding Interviews](https://amzn.to/31K16po)
 88 | 
 89 | DISCLAIMER: This above mentioned resources have affiliate links, which means if you buy one of the product from my links, I’ll receive a small commission. This helps support the channel and allows us to continue to add more tutorial. Thank you for the support!
 90 | 
 91 | 
 92 | ### Wanted to Contribute ?
 93 | ``Are you up for your first PR for this project !!!``
 94 | <br>
 95 | Awesome but please first go through the [PULL REQUEST TEMPLATE](https://github.com/codedecks-in/HackerRank-Solutions/blob/master/PULL_REQUEST_TEMPLATE) and use this template to submit your PR.
 96 | 
 97 | Please read [CONTRIBUTING.md](https://github.com/codedecks-in/HackerRank-Solutions/blob/master/CONTRIBUTING.md) and [CODE OF CONDUCT.md](https://github.com/codedecks-in/HackerRank-Solutions/blob/master/CODE_OF_CONDUCT.md) for details on our code of conduct, and the process for submitting pull requests to us.
 98 | 
 99 | ### Authors
100 | * **[Gourav Rusiya](https://github.com/GouravRusiya30)**
101 | 


--------------------------------------------------------------------------------
/_config.yml:
--------------------------------------------------------------------------------
1 | theme: jekyll-theme-dinky


--------------------------------------------------------------------------------
/codedecks.jpg:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/codedecks-in/HackerRank-Solutions/961bb383398837cf80d7e0a71db7d44bc395e49d/codedecks.jpg


--------------------------------------------------------------------------------