├── 169_Majority_element.java
├── 217_Contains_duplicate.java
└── 70_Climbing_Stairs.java


/169_Majority_element.java:
--------------------------------------------------------------------------------
 1 | class Solution {
 2 |     public int majorityElement(int[] nums) {
 3 |         int count = 0;
 4 |         int result =  0;
 5 |         for(int num : nums)
 6 |         {
 7 |             if(count == 0)
 8 |             {
 9 |                 result = num;
10 |             }
11 |             if(num == result)
12 |                 count++;
13 |             else
14 |                 count--;
15 |         }
16 |         return result;
17 |     }
18 | }


--------------------------------------------------------------------------------
/217_Contains_duplicate.java:
--------------------------------------------------------------------------------
 1 | class Solution {
 2 |     public boolean containsDuplicate(int[] nums) {
 3 |         
 4 |         Arrays.sort(nums);
 5 |         for (int i = 0; i < nums.length - 1; i++) {
 6 |             if (nums[i] == nums[i + 1]) {
 7 |                 return true;
 8 |             }
 9 |         }
10 |         return false;
11 |         }
12 |         }
13 |         /*
14 |         HashSet<Integer> numbers = new HashSet<>();
15 |         for (int i = 0; i < nums.length; i++) {
16 |             if (numbers.contains(nums[i]))
17 |                 return true;
18 |             numbers.add(nums[i]);
19 |         }
20 |         return false;
21 |     }
22 | }
23 | */
24 | 


--------------------------------------------------------------------------------
/70_Climbing_Stairs.java:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/Navdeep-04/Leet_Code/d8033ad1372e0857d30b5537376558cfd805f0be/70_Climbing_Stairs.java


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