Created using Colaboratory

Author: Matinnorouzi2023

Copy_of_Recursion_Power_Sum.ipynb

@@ -0,0 +1,54 @@
+{
+  "nbformat": 4,
+  "nbformat_minor": 0,
+  "metadata": {
+    "colab": {
+      "provenance": [],
+      "authorship_tag": "ABX9TyMl8rik+h9XWJS4IX6zWWGE",
+      "include_colab_link": true
+    },
+    "kernelspec": {
+      "name": "python3",
+      "display_name": "Python 3"
+    },
+    "language_info": {
+      "name": "python"
+    }
+  },
+  "cells": [
+    {
+      "cell_type": "markdown",
+      "metadata": {
+        "id": "view-in-github",
+        "colab_type": "text"
+      },
+      "source": [
+        "<a href=\"https://colab.research.google.com/github/Matinnorouzi2023/Leetcode-Python-interview/blob/main/Copy_of_Recursion_Power_Sum.ipynb\" target=\"_parent\"><img src=\"https://colab.research.google.com/assets/colab-badge.svg\" alt=\"Open In Colab\"/></a>"
+      ]
+    },
+    {
+      "cell_type": "markdown",
+      "source": [
+        "# Question 2:\n",
+        "\n",
+        "**Power Sum -** Let’s define a peculiar type of array in which each element is either an integer or another peculiar array. Assume that a peculiar array is never empty. Write a function that will take a peculiar array as its input and find the sum of its elements. If an array is an element in the peculiar array you have to convert it to it’s equivalent value so that you can sum it with the other elements. Equivalent value of an array is the sum of its elements raised to the number which represents how far nested it is.\n",
+        "\n",
+        " For e.g. [2,3[4,1,2]] = 2+3+ (4+1+2)^2\n",
+        "\n",
+        "[1,2,[7,[3,4],2]] = 1 + 2 +( 7+(3+4)^3+2)^2"
+      ],
+      "metadata": {
+        "id": "uHOjP_znJ20G"
+      }
+    },
+    {
+      "cell_type": "code",
+      "execution_count": null,
+      "metadata": {
+        "id": "rQ2SjVuuJhuU"
+      },
+      "outputs": [],
+      "source": []
+    }
+  ]
+}