Can you optimse my code for the given problem even further ?

Revision en1, by Ryuma_7810, 2024-04-19 10:17:32

Problem: (Binary path)

int n;  cin>>n;
string s,t; cin>>s>>t;

int count=1;
string path= s[0] + t;
string min_str= path;

for(int i=1; i<n; i++)
    path[i]= s[i];

    if(path < min_str){
        min_str= path;
    else if(path == min_str)



I have written this coder sample for the above problem, but it keeps on getting TLE on Test 4. I can't seem to understand it because the time complexity for this is O(n) and n<=2.10^5 Can you explain in which part of my code is there an issue ? I want to use this current approach.

Tags c++


  Rev. Lang. By When Δ Comment
en1 English Ryuma_7810 2024-04-19 10:17:32 771 Initial revision (published)