|
| 1 | +# Amazon |
| 2 | + |
| 3 | +- **Year:** 2025 |
| 4 | +- **Type:** Placement |
| 5 | +- **Role:** Non-SDE |
| 6 | + - SE- Support engineer II |
| 7 | + - Quality Assurance enginner I |
| 8 | + - Programmer/Analyst |
| 9 | + - Buisness Intel Engineer I |
| 10 | + - Data Engineer I |
| 11 | + - Software Dev Engineer I-TEST |
| 12 | + - System devlopment engineer I |
| 13 | +--- |
| 14 | + |
| 15 | +## Online Assessment Overview |
| 16 | + |
| 17 | +- The test was a complete breakdown of all the core subjects for a CSE.And the questions were easy to an extent. |
| 18 | +- The duration of the test is 1.5Hrs |
| 19 | +- It comprises of 1 coding question followed by 65 MCQ in 13 sections thus totally 14 sections and 66 questions. |
| 20 | + - Hands on Programming |
| 21 | + - Algorithms |
| 22 | + - Data structre |
| 23 | + - Linux |
| 24 | + - Networking |
| 25 | + - Pseudo codes |
| 26 | + - Software test methodologies |
| 27 | + - Software testing concepts |
| 28 | + - Scripting - python |
| 29 | + - Data Query languages |
| 30 | + - Data visualisation and reporting |
| 31 | + - Data modeling and warehosuing |
| 32 | + |
| 33 | +--- |
| 34 | + |
| 35 | +## Question 1: ***Bounty*** |
| 36 | + |
| 37 | + |
| 38 | +**Description:** |
| 39 | + |
| 40 | +- The world government has set a bounty for a pirate, and they want the bounty amount to be represented by an integer containing `N` digits. However, they have a condition that the integer must contain ***at least 2 zeros***. |
| 41 | +Your task is to find and return an integer value representing the possible integers that are the perfect fit for a bounty with the above criteria. Return modulo $10^4+7$ . |
| 42 | + |
| 43 | +> Note: The N-digit integer should not contain any leading zeros. |
| 44 | +
|
| 45 | +#### Input Specification: |
| 46 | + |
| 47 | +- input1: An integer N, representing the number of digits to set a bounty. |
| 48 | + |
| 49 | +#### Output Specification: |
| 50 | +- Return an integer value representing the possible integers which are the perfect fit for a bounty with the above criteria. |
| 51 | + |
| 52 | + |
| 53 | +**Examples & Constraints:** |
| 54 | +- Example 1: |
| 55 | + - input1: `3` |
| 56 | + - Output: `9` |
| 57 | + - Explanation:Here in this example, the number of digits to set the bounty is $3$ . According to the criteria the Integer must contain *at least 2 zeros* . |
| 58 | + - So, all the possible integers with 3 digits and at least 2 zeros are: 100, 200, 300,400,500, 600, 700, 800, 900 |
| 59 | + - In total, there are 9 such integers that meet the given criteria. |
| 60 | + - Hence, 9 is retumed as the output |
| 61 | +- Example 2: |
| 62 | + - input1: `4` |
| 63 | + - Output: `252` |
| 64 | + - Explanation: Here in this example, the number of digits to set the bounty is `4`. According to the condition the integer must contain *at least 2 zeros* . |
| 65 | + - So, all the possible integers with 4 digits and at least 2 zeros are 1000,1001,1002,1003,1004, 1005, 1006, 1007,1008 1009,1010,1020, 1030,1040, 1050,1060,1070,1080,1090,1100, 1200, 1300, 1400,1500,1600, 1700,1800.........9010,9020,9030,9040,9050,9060,9070,9080,9090,9100,9200,9300,9400,9500,9600,9700,9800,9900 |
| 66 | + - In total, there are 252 such integers that meet the given criteria |
| 67 | + - Hence 252 is returned as the output |
| 68 | +- Constraints: |
| 69 | + |
| 70 | +**Tags:** |
| 71 | +(e.g., Arrays, Dynamic Programming, Graphs, Greedy, etc.) <if possible> |
| 72 | + |
| 73 | +**Similar Questions (if any):** |
| 74 | +- [LeetCode #XXX – Problem Name](https://leetcode.com/problems/...) |
| 75 | +- [GeeksforGeeks – Problem Name](https://www.geeksforgeeks.org/...) |
| 76 | +- [Codeforces/CodeChef Link] |
| 77 | + |
| 78 | +## Question 2: *[Question Title]* |
| 79 | +**Description:** |
| 80 | +Write the complete problem statement here. |
| 81 | + |
| 82 | +**Examples & Constraints:** |
| 83 | +- Example 1: ... |
| 84 | +- Example 2: ... |
| 85 | +- Constraints: ... |
| 86 | + |
| 87 | +**Tags:** |
| 88 | +(e.g., Arrays, Dynamic Programming, Graphs, Greedy, etc.) <if possible> |
| 89 | + |
| 90 | +**Similar Questions (if any):** |
| 91 | +- [LeetCode #XXX – Problem Name](https://leetcode.com/problems/...) |
| 92 | +- [GeeksforGeeks – Problem Name](https://www.geeksforgeeks.org/...) |
| 93 | +- [Codeforces/CodeChef Link] |
| 94 | + |
| 95 | +--- |
| 96 | + |
| 97 | +### Thought Process |
| 98 | +Explain how you approached the problem. Mention key observations, edge cases, and possible optimizations. |
| 99 | + |
| 100 | +--- |
| 101 | + |
| 102 | +### Solution |
| 103 | +*(Keep your code and explanation separate from the problem statement)* |
| 104 | + |
| 105 | + |
| 106 | +// Your solution here |
| 107 | +> ***ANYONE CAN CONRIBUTE! LET'S BUILD A COMMUNITY!!*** |
0 commit comments