Given integer input $n,$ print all permutations of the first $n$ letter of the English alphabet $($small case$).$ The permutations should be printed in lexicographical order. $[$CO$2,$ PO$-$a$,$ P$1,$ P$3,$ P$7]$

$8$

Sample Input$/$Output

$\backslash$table$[[$Input$,$Output$],[3,$abc$],[,$acb$],[,$bac$],[,$bca$],[,$cab$],[$cba$,]]$

Given an array nums of integers, write a $C$ language program to move all the zeros to the end of the array while maintaining the relative order of the non$-$zero elements. The input will start with the number of elements in the array followed by the elements of the array. $[$CO$3,$ PO$-$a$,$ P$1,$ P$3,$P$7]$

$10$

You must do this in$-$place without making a copy of the array $($i$.$e$.,$ you cannot use any extra array$).$

You cannot use array indexing for accessing the elements in this problem. Use pointer operations and dynamic memory allocation instead.

Sample Input$/$Output

$\backslash$table$[[$Input$,$Output$],[5,131200],[010312,],[7,11456000],[10145060,]]$

Write a $C$ code to check whether a string is a substring of another. The two strings are given as inputs. $($The string "nana" is a substring of the string "banana"$).$

$7$