Breaking News: Grepper is joining You.com. Read the official announcement!

leetcode problem 27 solution

Manifest answered on August 19, 2022 Popularity 7/10 Helpfulness 2/10

answer leetcode problem 27 solution

leetcode problem 27 solution

Comment

class Solution {
    public int removeElement(int[] nums, int val) {
        int count =0; 
        int j = 0;
        for(int i=0; i<nums.length; i++){
            if(nums[i]==val){
                count+=1;
                continue;
            }
            nums[j] = nums[i];
            j++;
        }
        return nums.length-count;
    }
}

//Remove Element

Popularity 7/10 Helpfulness 2/10 Language java

Source: Grepper

Tags: java solution

Link to this answer
Share Copy Link

Contributed on Aug 23 2022

Manifest

0 Answers Avg Quality 2/10

Closely Related Answers

leetcode problem 34

Comment

class Solution {
    public int[] searchRange(int[] nums, int target) {
        
       int res[] = new int[]{-1, -1};
        int start = 0;
        int last = nums.length-1;
        while(start <= last)
        {
            int mid = start + (last - start)/2;     
            if(nums[mid] == target)
            {                           
                res[0] = mid;
                last = mid - 1;                 
            }
            else if(nums[mid] < target)
            {
                start = mid+1;
            }
            else
            {
                last = mid -1;
            }
        }
       
        start =0;
        last = nums.length-1;
        
         while(start <= last)
        {
            int mid = start + (last - start)/2;
            if(nums[mid] == target)
            {
                res[1] = mid;
                start = mid + 1;
            }
            else if(nums[mid] < target)
            {
                start = mid+1;
            }
            else
            {
                last = mid -1;
            }
        }
          
        return res;
}
}

Popularity 5/10 Helpfulness 6/10 Language java

Source: Grepper

Tags: java

Link to this answer
Share Copy Link

Contributed on Aug 19 2022

Aditya jha

0 Answers Avg Quality 2/10

leetcode problem 19 solution

Comments(1)

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        
        if(head.next == null)
        {
            return null;
        }
        int size = 0;
        ListNode current = head;
        while(current != null)
        {
            current = current.next;
            size++;
        }
        if(n == size){
        return head.next;
        }    
                
        int indexToSearch = size - n;
        ListNode prev = head;
        int i = 1;
        while(i < indexToSearch)
        {
            prev = prev.next;
            i++;
        }
        prev.next = prev.next.next;
        return head;
        
    }
}

Popularity 8/10 Helpfulness 4/10 Language java

Source: Grepper

Tags: solution java ja

Link to this answer
Share Copy Link

Contributed on Aug 19 2022

Aditya jha

0 Answers Avg Quality 2/10

leetcode problem 9

Comment

class Solution {
    public boolean isPalindrome(int x) {
        int temp = x;
        int dig, sum=0;
        while(temp > 0)
        {
            dig = temp % 10;
            sum = sum * 10 + dig;
            temp = temp / 10;
        }
        if(sum == x)
            return true;
        else
            return false;
    }
}

Popularity 3/10 Helpfulness 1/10 Language java

Source: Grepper

Tags: java

Link to this answer
Share Copy Link

Contributed on Aug 22 2022

Manifest

0 Answers Avg Quality 2/10

leetcode problem 27 solution

Contents

More Related Answers

leetcode problem 27 solution

Closely Related Answers

leetcode problem 34

leetcode problem 19 solution

leetcode problem 9

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.