We consider tiling problems in the integer lattice. Specifically, we look at a set of four T-tetrominoes and four skew tetrominoes and determine when this set can tile rectangles and modified rectangles. Local considerations and coloring arguments are the main methods used to prove the untileability of regions
