โ† Citrix questions

GCD complexity, prime numbers proof, DP, and Unix ls

Filed under Citrix

The question

Prove worst-case time complexity of GCD, prove that the number between twin primes is divisible by 6, solve a Dynamic Programming question, and explain the working of the Unix 'ls' command along with user permission systems.

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

Related Citrix questions

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