dd

Author: Blooverh

LeetCode/Blind75/BestTimeToBuyAndSellStock.java

@@ -13,8 +13,8 @@ public static int maxProfit(int[] prices) {
             return 0;
         }
 
-        int lowestValDay= Integer.MAX_VALUE;
-        int profit=0;
+        int lowestValDay= Integer.MAX_VALUE; //current lowest value day
+        int profit=0; 
         int profitIfSoldToday=0;
 
         for(int i=0; i< prices.length; i++){ 

LeetCode/Blind75/TwoSum.java

@@ -22,9 +22,9 @@ public static void main(String[] args) {
 
     public static int[] twoSum(int[] nums, int target){
         int[] result= new int[2]; //array that will store both numbers 
-        Map<Integer, Integer> map= new HashMap<Integer, Integer>(); 
+        Map<Integer, Integer> map= new HashMap<Integer, Integer>(); //will store the value at index as key and value as index so we can fetch later if there is a key that contains the difference between target and a number in the array
         for(int i=0; i< nums.length; i++){
-            if(map.containsKey(target-nums[i])){ //
+            if(map.containsKey(target-nums[i])){ // there is a key in map where target - nums[i] exist 
                 result[1]=i;
                 result[0]=map.get(target-nums[i]);
                 return result;

LeetCode/Lt203.java

@@ -0,0 +1,24 @@
+/*Remove linked list elements that have the same val and variable val */
+class ListNode {
+    int val;
+    ListNode next;
+    ListNode() {}
+    ListNode(int val) { this.val = val; }
+    ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+}
+public class Lt203 {
+    public static void main(String[] args) {
+        
+    }
+
+    public ListNode removeElements(ListNode head, int val) {
+        if (head == null) return null;
+        head.next = removeElements(head.next, val); 
+        if(head.val ==val){
+            return head.next;
+        }else{
+            return head;
+        }
+       
+    }
+}