Largest Sum Contiguous Subarray

 Complexity is O(n)

public static void kandealgo ()
    {
        int[] numbers = { -1, -2 };
        int max_so_far = 0;
        int max_end_here = 0;

        boolean allnegative = false;
        int max_negative_value = 0;

        for (int i = 0; i < (numbers.length); i++)
        {
            if (numbers[i] > 0)
            {
                allnegative = true;
            }
            else
            {
                if (max_negative_value == 0 || max_negative_value < numbers[i])
                {
                    max_negative_value = numbers[i];
                }

            }

            max_end_here = max_end_here + numbers[i];

            max_end_here = Math.max(max_end_here, 0);
            max_so_far = Math.max(max_so_far, max_end_here);
        }

        if (!allnegative)
        {
            System.out.println("All values are negative in array , and min value is " + max_negative_value);
        }
        else
        {
            System.out.println("Max so far is " + max_so_far);
        }
    }

Fix: SoapUI - 4.6.3 Test case

If you have installed newer version of soapUI chances are it wont work with mac

• Installation problems

---

If your installed SoapUI instance on a Mac is not responsive, try the following steps to resolve the issue:

1. In soapui-settings.xml file add or update the following line:
   true
2. If that doesn't work, start SoapUI Pro with the following parameter added to the command line:
   -Dsoapui.jxbrowser.disable=true
3. Alternatively, you can navigate to SoapUI*.app and do "Show Package Info" ( from popup menu ).
   Then you should see Contents directory. Open Info.plist file for editing where you can add:
   soapui.jxbrowser.disable
   true
4. We have also seen some issues with SoapUI installs in Mac when GateKeeper is active. So to rule out that possible conflict, deactivate GateKeeper and try starting SoapUI

---

Also if you want to change the look and feel of SoapUI or SoapUI Pro to look more like a Mac application, change the following settings:

1. Go to File > Preferences > UI Settings tab
2. Check "Use native look & feel"
3. Restart SoapUI Pro

Installing soapui

Once you've downloaded the installer the installation is pretty strait forward. Start it by just double-clicking on it. After preparing the installation which takes only a few seconds you'll see the starting screen:


Just click Next to continue. You'll be asked to accept our license agreement



After accepting and clicking Next you'll be able to select the destination folder which by default is set to /Applications but can be changed.


Next step gives you opportunity to optionally include, as additional components, soapUI source files and Hermes installation.



In case of installing soapUI Pro JDBC drivers jars can be included as additional option (and of course no source is available).


After that a window appears where you'll be asked to select if desktop icon should be created and if jxbrowser should be disabled. Starting from version soapUI 3.6-beta2 JxBrowser is working on mac, but there is still a issue left with  browser being always displayed on top if opened.

Finally, by clicking Next, the installation starts

If you have chosen to install Hermes the installation will be triggered next, with it's own info and license agreement



and choosing the destination






After couple of minutes most the installation should be finished and you should see the next screen:

Now you are ready to use it. Good luck!

Match Making Algorithm

My friend is interviewing for Cerner Corporation and one of the questions asked was how will you design a match making algo for hospitals and students where

Hospitals rank students as per their preference
Students ranks hospitals as per their preference
Number of positions in hospitals and number of students are equal so student will end up going in hospital.


Given :

Student1 ->  Hospital1 - 1(pref) , Hospital2(pref)
Student 2 -> Hospital1 -1(pref) ,  Hospital2 (pref)

Hospital1 -> Student2 - 1(pref), Student1 - 2(Pref)
Hospital2 -> Student 1 - (pref) , Student 2 - 2 (pref)


We need a list of hospitals in rank stating with super awesome to lower

for each student
                   check preference in acceding order
                                  if hospital has space accommodate student
                                   else
                                   check the internal ranking for hospital and see if current student has higher preference
                                              if so kick a student with lowest rank as per hospital list who still has got admission to his next best preference

                                                        if the second college is filled do that for same as above college
                     end the student loop

The algo will be very well written recursively

Tracing given example

Hospital one = empty , Hospital 2 =  empty both having capacity of accommodating 1 Student each

----Student1 wants in Hospital 1 -> go for it

----Student 2 wants in Hospital 1 but Hospital 1 can only accommodate one student so checking internal list -> Student2 is more preferred so Student 1 has to go to Hospital 2

Final Solution

Hospital1 will have Student2
Hospital2 will have Student1


Algorithm is more biased to students as Students preferred list is first checked.

Complexity of Algorithm would be O(n!) which is quite high probably someone can do it better.

Please Comment will love to hear more about it.