kulkarnism

 void sortColors(vector<int>& nums) {
       
        int zero = 0,one = 0,two = 0;
        for(int j=0;j<nums.size();j++) {
            if(nums[j]==0)zero++;
            else if(nums[j] == 1)one++;
            else two++;
        }
        
        int i,j,k;

kulkarnism

package edu.sjsu.cs.sparkdemo;

import java.util.Arrays;
import java.util.regex.Pattern;

import org.apache.spark.SparkConf;
import org.apache.spark.api.java.JavaRDD;
import org.apache.spark.api.java.JavaSparkContext;
import org.apache.spark.api.java.function.FlatMapFunction;
import org.apache.spark.api.java.function.Function;

kulkarnism

class Solution {
public:
    string longestCommonPrefix(vector<string> &strs) {
        
        if(strs.empty()) return "";
        
        string lpref = strs[0];
        
        for(int i = 1; i<strs.size();i++)
        {

kulkarnism

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:

kulkarnism

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:

kulkarnism

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:

kulkarnism

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:

kulkarnism

public class Solution {
    public int[] searchRange(int[] A, int target) {
        int left = findE(A, 0, A.length-1, target);
        int right = findR(A, 0, A.length-1, target);
        return new int[]{left,right};
    }
    public int findE(int[] arr, int low, int high, int elem)
    {
        if(high<low)return -1;
        if(arr[low]==elem)return low;