← National Instruments questions

Maximum Sum Path and String Transformation

Filed under National Instruments

The question

Optimize a previous string decoding code, find the maximum sum path from root to leaf in a binary tree containing only positive integers (discussing parameter passing vs global arrays), and find the minimum steps to reach a destination string from a source string using graph traversal (BFS/DFS).

No write-up yet. Related questions below have one.

Related National Instruments questions

Collected from public candidate posts and coding forums. Updated Nov 2026.