A signed graph \((G,\sigma)\) is a graph \(G\) equipped with a signature \(\sigma\), which assigns to each edge of \(G\) a sign (either \(+\) or \(-\) ). In extremal graph theory, the Turán problem is a significant one that involves finding out the exact value of the Turán number \(\operatorname{ex}(n, H)\). However, determining the Turán number is not a straightforward exercise. The paper discusses the spectral analogues of the Turán type problem for signed graphs, focusing on finding the maximum spectral radius among all \(n\)-vertex \(H\)-free graphs. The main findings are if \(\dot{G}\) is \(C^{-}_{3}\)-free, then \(e(\dot{G}) \leq \frac{n(n-1)}{2}-(n-2)\) and \(\rho(\dot{G})\leq \frac{1}{2}(\sqrt(n^{2}-8)+n-4)\) and equality holds in case when \(\dot{G}\) is switching equivalent to \(\dot{G}^{s,t}\) and \(\dot{G}^{1,n-3}\), respectively. The study revolves around the (spectral) Turán problem in \(C^{-}_{3}\)-free signed graphs with \(n\) vertices and the methodology is a blend of spectral analogues of the parameters of signed graphs.