Let π be a family of graphs. In the classical π-Vertex Deletion problem, given a graph G and a positive integer k, the objective is to check whether there exists a subset S of at most k vertices such that G − S is in π. In this paper, we introduce the conflict free version of this classical problem, namely Conflict Free π-Vertex Deletion (CF-π-VD), and study this problem from the viewpoint of classical and parameterized complexity. In the CF-π-VD problem, given two graphs G and H on the same vertex set and a positive integer k, the objective is to determine whether there exists a set S⊆ V(G) , of size at most k, such that G − S is in π and H[S] is edgeless. Initiating a systematic study of these problems is one of the main conceptual contribution of this work. We obtain several results on the conflict free versions of several classical problems. Our first result shows that if π is characterized by a finite family of forbidden induced subgraphs then CF-π-VD is Fixed Parameter Tractable (FPT). Furthermore, we obtain improved algorithms for conflict free versions of several well studied problems. Next, we show that if π is characterized by a “well-behaved” infinite family of forbidden induced subgraphs, then CF-π-VD is W-hard. Motivated by this hardness result, we consider the parameterized complexity of CF-π-VD when H is restricted to well studied families of graphs. In particular, we show that the conflict free version of several well-known problems such as Feedback Vertex Set, Odd Cycle Transversal, Chordal Vertex Deletion and Interval Vertex Deletion are FPT when H belongs to the families of d-degenerate graphs and nowhere dense graphs. © 2020, Springer Science+Business Media, LLC, part of Springer Nature.