There are 50 declarer and 50 defense problems. They are tricky, but not very hard, like some of Hugh Kelseys problems.
The emphasis is on visualization, not squeeze play.
You need to think ahead and look at pitfalls.