data r;
set k;
by city;
if first.city then seq+1;
run;
If not then do
data r;
if _n_=1 then do;
dcl hash h();
h.defineKey ("city");
h.defineData ("seq");
h.defineDone ();
end;
set K;
if h.find() ne 0 then do;
seq+1;h.add();
end;
run;
Good news: We've extended SAS Hackathon registration until Sept. 12, so you still have time to be part of our biggest event yet – our five-year anniversary!