R.E.P.A.I.R. T.H.E. K.E.Y.B.O.A.R.D Sequel of this AWESOME challenge
You, a genius tech prodigy detective, have successfully disarmed the bomb and want to break into the computer. The police found the password 67890-=yuiop[]hjkl;'\vbnm^&amp;*()_+:&quot;| on a piece of paper, but much of the keyboard is broken and there are no other ways of inputting characters.
The only characters left to use are 12345QWERTASDFG&lt;&gt;ZXCqwertasdfgzxc!@#$% and also Tab, Space, and Newline. However, a fairy appears and gives you one more character of your choice.
Using only these 42 characters, produce as many of the password's 35 characters as you can. Write a separate program/function for each password character.
Scoring:

Primary scoring is how many characters you can produce (1–35).

Secondary, tie-breaking score is the total length of your programs/functions.


Standard loopholes apply
Thanks to @Adám for rework
Deadfish, all 35 characters, 444 bytes
Uses s, d, and c, which are allowed, plus i as an extra.
6 iisiiisiiiiic
7 iisiiisiiiiiic
8 iisiiisiiiiiiic
9 iiisdsdddddddc
0 iisiiisdc
- iisiiisddddc
= iiisdsdddc
y iiisiisc
u iiisiisddddc
i iiisisiiiiic
o iiisisiiiiiiiiiiic
p iiisiisdddddddddc
[ iiissiiiiiiiiiic
] iiisisdddddddc
h iiisisiiiic
j iiisisiiiiiic
k iiisisiiiiiiic
l iiisisiiiiiiiic
; iiisdsdddddc
' iisiisiiic
\ iiisisddddddddc
v iiisiisdddc
b iiisisddc
n iiisisiiiiiiiiiic
m iiisisiiiiiiiiic
^ iiisisddddddc
&amp; iisiisiic
* iisiisiiiiiic
( iisiisiiiic
) iisiisiiiiic
_ iiisisdddddc
+ iisiisiiiiiiic
: iiisdsddddddc
&quot; iisiisddc
| iiisiisiiic

Unless I did my coding wrong, I believe these are necessarily optimal.
Here is the meta-golfer
Explanation
I do a pretty simple BFS by creating a priority queue that orders by length first (so the golfiest solution is always found) and state second (so that it doesn't waste time on ridiculously large numbers caused by repeated application of s). Also, I track a visited set to prevent revisiting values with suboptimal-length code.
Then, each time, I just add the state transitions (L,x,c)-&gt;(L+1,x+1,c+&quot;i&quot;), (L,x,c)-&gt;(L+1,x-1,c+&quot;d&quot;), and (L,x,c)-&gt;(L+1,x*x,c+&quot;s&quot;) where L is the code length, x is the current number, and c is the current code.
My meta-golfer code is fully commented if you want a more detailed explanation.