top of page
Coding Solutions is a great section for every coder. You can get answers to your programming questions here by the Team ATC. You can even ask for the answer to competitive programming language questions as well. First, search your question here, and if not found. Then, ask your question to Ask The Code members, and you will get your answer in no time from the members of this Indian Developer Community. Happy Coding.
Search
Python Program for compound interest
Asked: Anonymously |Category: Python p=eval(input("Enter the value of P : ")) r=eval(input("Enter the value of r : "))...
Team ATC
Sep 26, 20201 min read
Â
Â
Â
Python Program for simple interest
Asked: Anonymously |Category: Python p=eval(input("Enter the value of P : ")) r=eval(input("Enter the value of r : "))...
Team ATC
Sep 26, 20201 min read
Â
Â
Â
Python Program for simple interest
Asked: Anonymously |Category: Python p=eval(input("Enter the value of P : ")) r=eval(input("Enter the value of r : "))...
Team ATC
Sep 26, 20201 min read
Â
Â
Â
Python Program for factorial of a number
Asked: Anonymously |Category: Python a=eval(input("Enter the value of a : ")) def factorial(n): if n==1: return 1 return n*factorial(n-1)...
Team ATC
Sep 26, 20201 min read
Â
Â
Â
Python Program for factorial of a number
Asked: Anonymously |Category: Python n=eval(input("Enter the number")) temp=n fac=1 while temp>0: fac*=temp temp-=1 print('factorial...
Team ATC
Sep 26, 20201 min read
Â
Â
Â
Python program to add two numbers
Asked: Anonymously |Category: Python a=eval(input("Enter 1st Number : ")) b=eval(input("Enter 2nd Number : ")) sum=a+b print(sum)
Team ATC
Sep 26, 20201 min read
Â
Â
Â
Sort a list of elements using bubble sort algorithm
Asked: Anonymously |Category: Python a=[8,4,1,3,2,6] for i in range(len(a)): for j in range(1,len(a)): if a[j-1]>a[j]:...
Team ATC
Sep 24, 20201 min read
Â
Â
Â
Sort a list of elements using bubble sort algorithm.
Asked: Anonymously |Category: Python def bubbleSort(lst): n = len(lst) for i in range(n-1): for j in range(0, n-i-1): if lst[j] >...
Team ATC
Sep 24, 20201 min read
Â
Â
Â
Calculate the factorial of a number using recursion.
Asked: Anonymously |Category: Python n=eval(input("Enter The number")) def factorial (n): if n==1: return 1 return n*factorial(n-1)...
Team ATC
Sep 24, 20201 min read
Â
Â
Â
Calculate the factorial of a number
Asked: Anonymously |Category: Python n=eval(input("Enter the number")) temp=n fac=1 while temp>0: fac*=temp temp-=1 print('factorial...
Team ATC
Sep 24, 20201 min read
Â
Â
Â
Calculate the +,- ,* and / of two user given no.s using function and return type.
Asked: Anonymously |Category: Python def func(a,b): add=a+b sub=a-b mul=a*b div=a/b return (add,sub,mul,div); a=int(input("Enter the 1st...
Team ATC
Sep 24, 20201 min read
Â
Â
Â
Nested List | HackerRank
Asked: Anonymously | Category: Python n=int(input()) arr=[[input(),float(input())] for _ in range(0,n)] arr.sort(key=lambda x:...
Team ATC
Sep 16, 20201 min read
Â
Â
Â
Print the lower left triangle of a matrix.
Asked: Anonymously |Category: Python R= int(input("Enter the number of rows:")) C = int(input("Enter the number of columns:")) matrix =...
Team ATC
Sep 13, 20201 min read
Â
Â
Â
Print the sum of rows of a matrix.
Asked: Anonymously |Category: Python n1=input(" Enter the dimension of matrix: ") n1=int(n1) n=[] l=[0]*n1 c=0 for i in range(0,n1):...
Team ATC
Sep 13, 20201 min read
Â
Â
Â
Print the sum of diagonal elements of a matrix. Take input from the user.
Asked: Anonymously |Category: Python n1=input(" Enter the dimension of matrix: ") n1=int(n1) n=[] l=[0]*n1 d=0 da=0 for i in range(0,n1):...
Team ATC
Sep 13, 20201 min read
Â
Â
Â
Check whether a list is palindrome or not. Also print the reverse list.
Asked: Anonymously |Category: Python n = eval(input("Enter the no. of elements you want.")) l1 = list() l2 = list() for i in range(n):...
Team ATC
Sep 13, 20201 min read
Â
Â
Â
Define scope of a variable.
Asked: Anonymously | Category: Python Scope of a variable is the portion of program where the variable is recognized.
Team ATC
Sep 13, 20201 min read
Â
Â
Â
bottom of page