assign3.ipynb

{
 "cells": [
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "##### P1\n",
    "You are given an integer N. You need to print the series of all prime numbers till N.\n",
    "\n",
    "Input Format\n",
    "\n",
    "The first and only line of the input contains a single integer N denoting the number till where you need to find the series of prime number.\n",
    "\n",
    "Output Format\n",
    "\n",
    "Print the desired output in single line separated by spaces.\n",
    "\n",
    "Constraints\n",
    "\n",
    "1<=N<=1000\n",
    "\n",
    "\n",
    "SAMPLE INPUT\n",
    "\n",
    "9\n",
    "\n",
    "SAMPLE OUTPUT\n",
    "\n",
    "2 \n",
    "\n",
    "3 \n",
    "\n",
    "5 \n",
    "\n",
    "7"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 8,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "Enter the Number that you want to the prime number 3\n",
      "3\n",
      "5\n",
      "7\n",
      "9\n",
      "11\n",
      "13\n",
      "15\n",
      "17\n",
      "19\n"
     ]
    }
   ],
   "source": [
    "# Answer\n",
    "number = int(input('Enter the Number that you want to the prime number '))\n",
    "\n",
    "for i in range(number,20,2):\n",
    "    print(i)"
   ]
  },
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "## P2\n",
    "\n",
    "### using for loop implement factorial find program\n",
    "\n",
    "### Example: factorial of 5 = 120"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 51,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "Enter the number that you want to check factorial Number has 5\n",
      "120\n",
      "120\n"
     ]
    }
   ],
   "source": [
    "# Answer\n",
    "# result = []\n",
    "# value  = int(input('Enter the value '))\n",
    "# for i in range(1,value +1):\n",
    "#     final =  (value * i) \n",
    "#     result.append(final)\n",
    "\n",
    "# print(result)\n",
    "\n",
    "\n",
    "# for i in result:\n",
    "#     add  += i\n",
    "#     print(add)\n",
    "\n",
    "n =  int(input('Enter the number that you want to check factorial Number has '))\n",
    "print(fact)\n",
    "fact = 1\n",
    "\n",
    "while(n >  0):\n",
    "    fact = fact * n\n",
    "    n = n -1\n",
    "    \n",
    "print(fact)\n",
    "\n",
    "# n=int(input(\"Enter number:\"))\n",
    "# fact=1\n",
    "# while(n>0):\n",
    "#     fact=fact*n\n",
    "#     n=n-1\n",
    "# print(\"Factorial of the number is: \")\n",
    "# print(fact)\n"
   ]
  },
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "## P3\n",
    "\n",
    "### Implement Fibonacci finding program"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 1,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "How many time you need fibonacci 10\n"
     ]
    }
   ],
   "source": [
    "# Answer\n",
    "limit =  int(input('How many time you need fibonacci '))\n",
    "a  = 1\n",
    "b =  1\n"
   ]
  },
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "## P4\n",
    "\n",
    "### Print a triangle via python"
   ]
  },
  {
   "cell_type": "raw",
   "metadata": {},
   "source": [
    "        * \n",
    "       * * \n",
    "      * * * \n",
    "     * * * * \n",
    "    * * * * * "
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 5,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "***************"
     ]
    }
   ],
   "source": [
    "for row in range(0,6):\n",
    "    for col in range(0,row):\n",
    "        print('*',end=\"\")"
   ]
  },
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "## P5\n",
    "\n",
    "Given an array arr of N integers. Find the contiguous sub-array with maximum sum.\n",
    "\n",
    "Input:\n",
    "The first line of input contains an integer T denoting the number of test cases. The description of T test cases follows. The first line of each test case contains a single integer N denoting the size of array. The second line contains N space-separated integers A1, A2, ..., AN denoting the elements of the array.\n",
    "\n",
    "Output:\n",
    "Print the maximum sum of the contiguous sub-array in a separate line for each test case.\n",
    "\n",
    "Example:\n",
    "Input\n",
    "\n",
    "2\n",
    "\n",
    "5\n",
    "\n",
    "1 2 3 -2 5\n",
    "\n",
    "4\n",
    "\n",
    "-1 -2 -3 -4\n",
    "\n",
    "Output\n",
    "\n",
    "9\n",
    "\n",
    "-1\n",
    "\n",
    "Explanation:\n",
    "Testcase 1: Max subarray sum is 6 of elements (1, 2, 3) which is a contiguous subarray."
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 2,
   "metadata": {},
   "outputs": [],
   "source": [
    "# question 5 asked in many coding interviews like at Amazon,Flipkart,Samsung,Wallmart So try to do it from Yourself\n"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": null,
   "metadata": {},
   "outputs": [],
   "source": []
  }
 ],
 "metadata": {
  "kernelspec": {
   "display_name": "Python 3",
   "language": "python",
   "name": "python3"
  },
  "language_info": {
   "codemirror_mode": {
    "name": "ipython",
    "version": 3
   },
   "file_extension": ".py",
   "mimetype": "text/x-python",
   "name": "python",
   "nbconvert_exporter": "python",
   "pygments_lexer": "ipython3",
   "version": "3.7.3"
  }
 },
 "nbformat": 4,
 "nbformat_minor": 2
}