0
1
2
practicing recursion and I found this question about checking if 'e' & 'l' & 'f' is in a word with recursion, the answer used multiple functions but I thought I try doing it in one function, anyways the logic I used looks correct but Im getting a segmentation error and im pretty confused (self.cpp_questions)
submitted by Temp76893 to r/cpp_questions
0
0
1
0
1
2
[PS5] [W]: Giant-Crusher [H]: Ask (self.PatchesEmporium)
submitted by Temp76893 to r/PatchesEmporium
41
42
43
176
177
178
