'When writing pop_back in backtracking is necessary?

enter image description here[![ GFG Qtn Link:- https://practice.geeksforgeeks.org/problems/paths-from-root-with-a-specified-sum/1/

Why here without writing the ans.pop_back(); the code works perfectly and how to know when to pop and when not to pop

]2]2

recursionstdvectorbacktrackingrecursive-backtracking


Sources

This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.

Source: Stack Overflow

Solution Source

Related Questions

recursive tree as a list (array items) in a new attribute value child

Lazy Catalan Numbers in Haskell

Why is there no tail recursion optimization in Emacs lisp, not but like other scheme?

If myStr = 'test', why does myStr[4] produce error out of range but myStr[4:] does not?

Map of sets into list of all combinations

What is wrong with my Preorder traversal?

Get full tree of parent/child relationships in mysql of any node in the tree with all parents

Given sorted Array, Returns index i if array A contains an element A[i] such that A[i] = i (recursive and divide and conquer)

Is it possible to define function that creates an N-dimensional list of lists easily?

Loop through all nested dictionary values?

Building general trees in java (with recursion)

New state of the art in unlimited generation of Hamming sequence

Writing A Recursive Function That Counts Zeros

Division using recursion

count number of digit using recursive method