Skip to content

Commit 9c13242

Browse files
nikoo28nikoo28
committed
Change access modifiers of classes
1 parent 73b4ff8 commit 9c13242

File tree

168 files changed

+259
-257
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

168 files changed

+259
-257
lines changed

Diff for: ‎src/main/java/codility/ambitious/IdenticalPairOfIndices.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -7,9 +7,9 @@
77
* Created by nikoo28 on 2019-08-25 13:39
88
*/
99

10-
public class IdenticalPairOfIndices {
10+
class IdenticalPairOfIndices {
1111

12-
public int solution(int[] a) {
12+
private int solution(int[] a) {
1313

1414
// Integer[] indices = new Integer[a.length];
1515
// for (int i = 0; i < a.length; ++i) {

Diff for: ‎src/main/java/codility/painless/BinaryGap.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
* Created by nikoo28 on 2019-08-25 16:31
55
*/
66

7-
public class BinaryGap {
7+
class BinaryGap {
88

99
public int solution(int N) {
1010
// write your code in Java SE 8

Diff for: ‎src/main/java/codility/painless/CroppedMessage.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -4,9 +4,9 @@
44
* Created by nikoo28 on 2019-08-25 14:21
55
*/
66

7-
public class CroppedMessage {
7+
class CroppedMessage {
88

9-
public String solution(String message, int K) {
9+
private String solution(String message, int K) {
1010
// write your code in Java SE 8
1111

1212
String[] splits = message.split(" ");

Diff for: ‎src/main/java/codility/painless/CyclicRotation.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
* Created by nikoo28 on 2019-08-25 20:03
55
*/
66

7-
public class CyclicRotation {
7+
class CyclicRotation {
88

99
public int[] solution(int[] nums, int k) {
1010
// write your code in Java SE 8
@@ -20,7 +20,7 @@ public int[] solution(int[] nums, int k) {
2020
return nums;
2121
}
2222

23-
public void reverse(int[] nums, int start, int end) {
23+
private void reverse(int[] nums, int start, int end) {
2424
while (start < end) {
2525
int temp = nums[start];
2626
nums[start] = nums[end];

Diff for: ‎src/main/java/codility/painless/OddOccurencesInAnArray.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
* Created by nikoo28 on 2019-08-25 19:51
55
*/
66

7-
public class OddOccurencesInAnArray {
7+
class OddOccurencesInAnArray {
88

99
public int solution(int[] A) {
1010
// write your code in Java SE 8

Diff for: ‎src/main/java/hackerrank/expedia/Braces.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -6,10 +6,10 @@
66
* Created by nikoo28 on 2019-08-25 20:55
77
*/
88

9-
public class Braces {
9+
class Braces {
1010

1111
// Complete the braces function below.
12-
static String[] braces(String[] values) {
12+
private static String[] braces(String[] values) {
1313

1414
String[] result = new String[values.length];
1515
int idx = 0;

Diff for: ‎src/main/java/hackerrank/expedia/LongestVowelSubsequence.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -7,9 +7,9 @@
77
* Created by nikoo28 on 2019-08-25 21:09
88
*/
99

10-
public class LongestVowelSubsequence {
10+
class LongestVowelSubsequence {
1111

12-
public static int longestSubsequence(String s) {
12+
private static int longestSubsequence(String s) {
1313

1414
Map<Character, Character> preVowelMap = new HashMap<>();
1515
preVowelMap.put('u', 'o');

Diff for: ‎src/main/java/hackerrank/expedia/ReachableEmployees.java

+3-3
Original file line numberDiff line numberDiff line change
@@ -6,8 +6,8 @@
66
* Created by nikoo28 on 2019-08-25 22:04
77
*/
88

9-
public class ReachableEmployees {
10-
public static void bfs(int i, boolean[] visited, ArrayList<Integer>[] graph, int[][] bfs_res) {
9+
class ReachableEmployees {
10+
private static void bfs(int i, boolean[] visited, ArrayList<Integer>[] graph, int[][] bfs_res) {
1111

1212
visited[i] = true;
1313
Queue<Integer> q = new LinkedList<>();
@@ -29,7 +29,7 @@ public static void bfs(int i, boolean[] visited, ArrayList<Integer>[] graph, int
2929

3030
}
3131

32-
public static List<Integer> order(int employeeNodes, List<Integer> employeesFrom, List<Integer> employeesTo, int host) {
32+
private static List<Integer> order(int employeeNodes, List<Integer> employeesFrom, List<Integer> employeesTo, int host) {
3333

3434
List<Integer> res = new ArrayList<>();
3535

Diff for: ‎src/main/java/hackerrank/projecteuler/Problem1.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55
/**
66
* Created by nikhil.lohia on 08/03/2017.
77
*/
8-
public class Problem1 {
8+
class Problem1 {
99

1010
public static void main(String[] args) {
1111

Diff for: ‎src/main/java/hackerrank/projecteuler/Problem2.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55
/**
66
* Created by nikhil.lohia on 08/04/2017.
77
*/
8-
public class Problem2 {
8+
class Problem2 {
99

1010
public static void main(String[] args) {
1111
Scanner in = new Scanner(System.in);

Diff for: ‎src/main/java/hackerrank/projecteuler/Problem3.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66
* Created by nikhil.lohia on 08/07/2017.
77
*/
88

9-
public class Problem3 {
9+
class Problem3 {
1010

1111
public static void main(String[] args) {
1212

Diff for: ‎src/main/java/hackerrank/projecteuler/Problem4.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -2,9 +2,9 @@
22

33
import java.util.Scanner;
44

5-
public class Problem4 {
5+
class Problem4 {
66

7-
public static int check(String s) {
7+
private static int check(String s) {
88
int len = s.length();
99
for (int i = 0; i < len / 2; i++) {
1010
if (s.charAt(i) != s.charAt(len - 1 - i)) return 0;

Diff for: ‎src/main/java/hackerrank/projecteuler/Problem5.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
import java.util.List;
55
import java.util.Scanner;
66

7-
public class Problem5 {
7+
class Problem5 {
88

99
public static void main(String[] args) {
1010

Diff for: ‎src/main/java/hackerrank/projecteuler/Problem6.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
import java.util.Scanner;
44

5-
public class Problem6 {
5+
class Problem6 {
66

77
public static void main(String[] args) {
88

Diff for: ‎src/main/java/hackerrank/projecteuler/Problem7.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
import java.util.Scanner;
44

5-
public class Problem7 {
5+
class Problem7 {
66

77
public static void main(String[] args) {
88
Scanner sc = new Scanner(System.in);
@@ -33,7 +33,7 @@ public static void main(String[] args) {
3333
}
3434
}
3535

36-
public static int[] findPrime(int[] primeChecker, int[] primeNumbers, int end, int size) {
36+
private static int[] findPrime(int[] primeChecker, int[] primeNumbers, int end, int size) {
3737
int i = 2;
3838
boolean cond;
3939
while (end < size) {

Diff for: ‎src/main/java/hackerrank/sorting/InsertionSortPartOne.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -2,10 +2,10 @@
22

33
import java.util.Scanner;
44

5-
public class InsertionSortPartOne {
5+
class InsertionSortPartOne {
66

77

8-
public static void insertIntoSorted(int[] ar) {
8+
private static void insertIntoSorted(int[] ar) {
99
int n = ar.length;
1010
int insert = ar[n - 1];
1111

Diff for: ‎src/main/java/leetcode/ASCIIDistance.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -8,9 +8,9 @@
88
/**
99
* @author nikoo28 on 9/15/17
1010
*/
11-
public class ASCIIDistance {
11+
class ASCIIDistance {
1212

13-
public int distance(String str1, String str2) {
13+
private int distance(String str1, String str2) {
1414

1515
char[] histogram = new char[26];
1616
Set<Character> str1Set = new HashSet<>();

Diff for: ‎src/main/java/leetcode/AddDigits.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33
/**
44
* @author nikoo28 on 9/17/17
55
*/
6-
public class AddDigits {
6+
class AddDigits {
77

88
public int addDigits(int num) {
99
return 1 + (num - 1) % 9;

Diff for: ‎src/main/java/leetcode/AddTwoNumbers.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
* Created by nikoo28 on 7/5/19 12:29 AM
55
*/
66

7-
public class AddTwoNumbers {
7+
class AddTwoNumbers {
88

99
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
1010
if (l1 == null)

Diff for: ‎src/main/java/leetcode/AlmostPalindromes.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33
/**
44
* @author nikoo28 on 9/15/17
55
*/
6-
public class AlmostPalindromes {
6+
class AlmostPalindromes {
77

88
public static int almost_palindromes(String str) {
99

Diff for: ‎src/main/java/leetcode/ArrayNesting.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -4,9 +4,9 @@
44
* Created by nikoo28 on 6/3/19 1:43 AM
55
*/
66

7-
public class ArrayNesting {
7+
class ArrayNesting {
88

9-
public int findSetS(int[] nums) {
9+
private int findSetS(int[] nums) {
1010
boolean[] visited = new boolean[nums.length];
1111
int res = 0;
1212
for (int i = 0; i < nums.length; i++) {

Diff for: ‎src/main/java/leetcode/ArrayPartition1.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55
/**
66
* @author nikoo28 on 9/10/17
77
*/
8-
public class ArrayPartition1 {
8+
class ArrayPartition1 {
99

1010
public int arrayPairSum(int[] nums) {
1111

Diff for: ‎src/main/java/leetcode/AssignCookies.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66
* Created by nikoo28 on 12/17/17 8:50 PM
77
*/
88

9-
public class AssignCookies {
9+
class AssignCookies {
1010

1111
public int findContentChildren(int[] g, int[] s) {
1212
Arrays.sort(g);

Diff for: ‎src/main/java/leetcode/AverageOfLevelsInBinaryTree.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@
88
/**
99
* @author nikoo28 on 9/10/17
1010
*/
11-
public class AverageOfLevelsInBinaryTree {
11+
class AverageOfLevelsInBinaryTree {
1212

1313
public List<Double> averageOfLevels(TreeNode root) {
1414
List<Double> result = new ArrayList<>();

Diff for: ‎src/main/java/leetcode/BaseballGame.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66
* Created by nikoo28 on 12/16/17 4:30 PM
77
*/
88

9-
public class BaseballGame {
9+
class BaseballGame {
1010

1111
public int calPoints(String[] ops) {
1212

Diff for: ‎src/main/java/leetcode/BestTimeToBuyAndSellAStock.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
* Created by nikoo28 on 12/19/17 1:26 AM
55
*/
66

7-
public class BestTimeToBuyAndSellAStock {
7+
class BestTimeToBuyAndSellAStock {
88

99
public int maxProfit(int[] prices) {
1010

Diff for: ‎src/main/java/leetcode/BestTimeToBuyAndSellAStockII.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
* Created by nikoo28 on 12/17/17 2:58 PM
55
*/
66

7-
public class BestTimeToBuyAndSellAStockII {
7+
class BestTimeToBuyAndSellAStockII {
88

99
public int maxProfit(int[] prices) {
1010

Diff for: ‎src/main/java/leetcode/BinaryNumberWithAlternatingBits.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
* Created by nikoo28 on 12/16/17 10:43 PM
55
*/
66

7-
public class BinaryNumberWithAlternatingBits {
7+
class BinaryNumberWithAlternatingBits {
88

99
public boolean hasAlternatingBits(int n) {
1010

Diff for: ‎src/main/java/leetcode/BinaryTreeInOrderTraversal.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@
88
* Created by nikoo28 on 12/19/17 1:22 AM
99
*/
1010

11-
public class BinaryTreeInOrderTraversal {
11+
class BinaryTreeInOrderTraversal {
1212

1313
public List<Integer> inorderTraversal(TreeNode root) {
1414

Diff for: ‎src/main/java/leetcode/BinaryTreeRightSIdeView.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -9,9 +9,9 @@
99
* Created by nikoo28 on 7/20/19 3:11 PM
1010
*/
1111

12-
public class BinaryTreeRightSIdeView {
12+
class BinaryTreeRightSIdeView {
1313

14-
public List<Integer> rightSideView(TreeNode root) {
14+
private List<Integer> rightSideView(TreeNode root) {
1515

1616
if (root == null)
1717
return new ArrayList<>();

Diff for: ‎src/main/java/leetcode/Brackets.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55
/**
66
* @author nikoo28 on 9/15/17
77
*/
8-
public class Brackets {
8+
class Brackets {
99

1010
public static int bracket_match(String bracket_string) {
1111

Diff for: ‎src/main/java/leetcode/ConstructRectangle.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
* Created by nikoo28 on 12/17/17 3:23 AM
55
*/
66

7-
public class ConstructRectangle {
7+
class ConstructRectangle {
88

99
public int[] constructRectangle(int area) {
1010

Diff for: ‎src/main/java/leetcode/ConstructStringFromBinaryTree.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -4,9 +4,9 @@
44
* Created by nikoo28 on 12/17/17 3:01 AM
55
*/
66

7-
public class ConstructStringFromBinaryTree {
7+
class ConstructStringFromBinaryTree {
88

9-
public String tree2str(TreeNode t) {
9+
private String tree2str(TreeNode t) {
1010

1111
if (t == null)
1212
return "";

Diff for: ‎src/main/java/leetcode/ContainerWithMostWater.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
* Created by nikoo28 on 12/18/17 9:25 PM
55
*/
66

7-
public class ContainerWithMostWater {
7+
class ContainerWithMostWater {
88

99
public int maxArea(int[] height) {
1010

Diff for: ‎src/main/java/leetcode/ConvertSortedArrayToBinarySearchTree.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
* Created by nikoo28 on 9/23/18 12:57 PM
55
*/
66

7-
public class ConvertSortedArrayToBinarySearchTree {
7+
class ConvertSortedArrayToBinarySearchTree {
88

99
public TreeNode sortedArrayToBST(int[] nums) {
1010

Diff for: ‎src/main/java/leetcode/CopyListWithRandomPointer.java

+3-3
Original file line numberDiff line numberDiff line change
@@ -22,11 +22,11 @@ public Node(int _val, Node _next, Node _random) {
2222
}
2323
}
2424

25-
public class CopyListWithRandomPointer {
25+
class CopyListWithRandomPointer {
2626

27-
Map<Node, Node> oldNodeNewNodeMap = new HashMap<>();
27+
private Map<Node, Node> oldNodeNewNodeMap = new HashMap<>();
2828

29-
public Node copyRandomList(Node head) {
29+
private Node copyRandomList(Node head) {
3030

3131
if (head == null)
3232
return null;

0 commit comments

Comments
 (0)