Adams charity tech mahindra 2022

-

 Adams decided to be generous and do some charity. Starting today from day 1 until n days he decided to donate i^2 coins to charity.

Return total coins he donated.



connect with me on
Instagram
Github
Youtube


connect with me on
Instagram
Github
Youtube

Comments

Post a Comment

Popular posts from this blog

EV Minimize Array Cost asked in Infosys- march 2022 (available in c++ only)

-
                                                             EV_Minimize Array Cost connect with me on Facebook Twitter Instagram Github Youtube len(arr)-1 Σ(arri-arri-1)² i=1 len(arr) is the size of the array. Insert any integer at any location of the array such that the cost of the array is minimized. Find the minimum possible cost of the array after inserting exactly one element. Example a= [1, 3, 5, 2, 10] The cost of the array before insertion =(1-37+(3-57+(5-2)²+(2-102²= 81. Two of many scenarios are shown below. 1. Insert 4 between 3 and 5, cost of array = (1-37+(3-47+(4-57+(5-2)²+(2 107²2² = 79. 2. Insert 6 between 2 and 10, cost of array =(1-37+(3-5)+(5-27²+(2-67² + (6 107² = 49. It can be proven that 49 is the minimum cost possib...
Read more

Chomsky's hierarchy Explanation :

-
Image
                      Chomsky's hierarchy  Explanation  and its types : Connect with me on According to Chomsky, there are 4 types of Finite language. T0,T1,T2,T3. Chomsky's hierarchy  Diagram: T0 is superset of T1,T2,T3. T1 IS SUPERSET OF T2,T3. T2 IS SUPERSET OF T3. connect with me on A Topic from Theory of Computation (TOC) Chomsky's hierarchy Explanation Table: Language type Accepted Language Accepting machine T3 REGULAR LANGUAGE FINITE AUTOMATA T2 CONTEXT FREE LANGUAGE (CFL) PUSH DOWN AUTOMATA (PDA) T1 CONTEXT SENSETIVE LANGUAGE (CSL) LINEAR BOUND AUTOMATA (LBA) T0 RECURSSIVE ENUMERABLE LANGUAGE (REL) TURING MACHINE Knowledgable Ti...
Read more

Given an array A, find the size of the smallest subarray asked in MountainBlue, 2022

-
Problem Statement :  Given an array A, find the size of the smallest subarray such that it contains at least one occurrence of the maximum value of the array and at least one occurrence of the minimum value of the array. Problem Constraints 1<= |A| <= 2000 Input Format The first line is the number of elements in an array. The second line is the space-separated array elements. f.e: 123 4 means A= [1, 2, 3, 4] Output Format Return the lengtlh of the smallest subarray which has at léasi pne occurrence of minimum and maximum eleknenbot the array Example Input Input 1: LAG27A...........
Read more