Status Finished

Started Tuesday, 15 October 2024, 6:49 PM

Completed Tuesday, 15 October 2024, 7:54 PM
Duration 1 hour 5 mins
Marks 8.00/8.00
Grade 10.00 out of 10.00 (100%)


Question 1
Implement all methods in class Stack with template type T. The description of each method is written as
Correct
comment in frame code.
Mark 1.00 out
of 1.00

#ifndef STACK_H
#define STACK_H
#include "DLinkedList.h"
template<class T>
class Stack {
protected:
DLinkedList<T> list;
public:
Stack() {}
void push(T item) ;
T pop() ;
T top() ;
bool empty() ;
int size() ;
void clear() ;
};

#endif

You can use all methods in class DLinkedList without implementing them again. The description of
class DLinkedList is written as comment in frame code.

template <class T>

class DLinkedList
{
public:
class Node; //forward declaration
protected:
Node* head;
Node* tail;
int count;
public:
DLinkedList() ;
~DLinkedList();
void add(const T& e);
void add(int index, const T& e);
T removeAt(int index);
bool removeItem(const T& removeItem);
bool empty();
int size();
void clear();
T get(int index);
void set(int index, const T& e);
int indexOf(const T& item);
bool contains(const T& item);
};

For example:

Test Result

Stack<int> stack; 1 0
cout << stack.empty() << " " << stack.size(); 
Test Result

Stack<int> stack; 8

int item[] = { 3, 1, 4, 5, 2, 8, 10, 12 };

for (int idx = 0; idx < 8; idx++) stack.push(item[idx]);

assert(stack.top() == 12);

stack.pop();
stack.pop();

cout << stack.top();

Answer: (penalty regime: 0 %)

Reset answer

1 ▼ void push(T item) {

2 list.add(list.size(), item);
3 }
4
5 ▼ T pop() {
6 return list.removeAt(list.size() - 1);
7 }
8
9 ▼ T top() {
10 return list.get(list.size() - 1);
11 }
12
13 ▼ bool empty() {
14 return list.empty();
15 }
16
17 ▼ int size() {
18 return list.size();
19 }
20
21 ▼ void clear() {
22 list.clear();
23 }


 Test Expected Got

 Stack<int> stack; 1 0 1 0 
cout << stack.empty() << " " << stack.size();

 Stack<int> stack; 8 8 

int item[] = { 3, 1, 4, 5, 2, 8, 10, 12 };

for (int idx = 0; idx < 8; idx++) stack.push(item[idx]);

assert(stack.top() == 12);

stack.pop();
stack.pop();

cout << stack.top();

Passed all tests! 

Correct
Marks for this submission: 1.00/1.00.


Question 2
You are keeping score for a basketball game with some new rules. The game consists of several rounds, where the scores of
Correct
past rounds may affect future rounds' scores.
Mark 1.00 out
of 1.00 At the beginning of the game, you start with an empty record. You are given a list of strings ops, where ops[i] is the operation
you must apply to the record, with the following rules:

A non-negative integer x (from 0 to 9) - record a new score of x

'+' - Record a new score that is the sum of the previous two scores. It is guaranteed there will always be two previous
scores.
'D' - Record a new score that is double the previous score. It is guaranteed there will always be a previous score.
'C' - Invalidate the previous score, removing it from the record. It is guaranteed there will always be a previous score.

Finally, return the sum of all scores in the record.

For example:

ops = "52CD+"

'5' - add to the record. Record now is [5]

'2' - add to the record. Record now is [5,2]
'C' - invalid the previous score (2). Record now is [5]
'D' - Record new score that is double of previous score (5*2). Record now is [5,10]
'+' - Record a new score that is the sum of the previous two scores. Record now is [5,10,15]

Return the sum: 5+10+15 = 30

For example:

Test Result

cout << baseballScore("52CD+"); 30

cout << baseballScore("524CD9++"); 55

Answer: (penalty regime: 0 %)

Reset answer

1 ▼ int baseballScore(string ops) {

2 stack<int> scores;
3
4 ▼ for (char op : ops) {
5 ▼ if (isdigit(op)) {
6 scores.push(op - '0');
7 ▼ } else if (op == 'C') {
8 ▼ if (!scores.empty()) {
9 scores.pop();
10 }
11 ▼ } else if (op == 'D') {
12 ▼ if (!scores.empty()) {
13 scores.push(2 * scores.top());
14 }
15 ▼ } else if (op == '+') {
16 ▼ if (scores.size() >= 2) {
17 int topScore = scores.top();
18 scores.pop();
19 int secondTopScore = scores.top();
20 scores.push(topScore);
21 scores.push(topScore + secondTopScore);
22 }
23 }
24 }
25
26 int totalScore = 0;
27 ▼ while (!scores.empty()) { 
28 totalScore += scores.top();
29 scores.pop();
30 }
31
32 return totalScore;
33 }
 Test Expected Got

 cout << baseballScore("52CD+"); 30 30 

 cout << baseballScore("524CD9++"); 55 55 

 cout << baseballScore("5C4C2C11+D3"); 11 11 

Passed all tests! 

Correct
Marks for this submission: 1.00/1.00.


Question 3
Given an array nums[] of size N having distinct elements, the task is to find the next greater element for
Correct
each element of the array
Mark 1.00 out
Next greater element of an element in the array is the nearest element on the right which is greater than
of 1.00
the current element.
If there does not exist a next greater of a element, the next greater element for it is -1

Note: iostream, stack and vector are already included

Constraints:
1 <= nums.length <= 10^5
0 <= nums[i] <= 10^9

Example 1:
Input:
nums = {15, 2, 4, 10}
Output:
{-1, 4, 10, -1}

Example 2:
Input:
nums = {1, 4, 6, 9, 6}
Output:
{4, 6, 9, -1, -1}

For example:

Test Input Result

int N; 4 -1 4 10 -1
cin >> N; 15 2 4 10
vector<int> nums(N);
for(int i = 0; i < N; i++) cin >> nums[i];
vector<int> greaterNums = nextGreater(nums);
for(int i : greaterNums)
cout << i << ' ';
cout << '\n';

int N; 5 4 6 9 -1 -1
cin >> N; 1 4 6 9 6
vector<int> nums(N);
for(int i = 0; i < N; i++) cin >> nums[i];
vector<int> greaterNums = nextGreater(nums);
for(int i : greaterNums)
cout << i << ' ';
cout << '\n';

Answer: (penalty regime: 0 %)

Reset answer

1 ▼ vector<int> nextGreater(vector<int>& arr) {

2 int N = arr.size();
3 vector<int> result(N, -1);
4 stack<int> s;
5
6 ▼ for (int i = 0; i < N; i++) {
7 ▼ while (!s.empty() && arr[i] > arr[s.top()]) {
8 result[s.top()] = arr[i];
9 s.pop();
10 } 
11 s.push(i);
12 }
13
14 return result;
15 }
16
 Test Input Expected Got

 int N; 4 -1 4 10 -1 -1 4 10 -1 
cin >> N; 15 2 4 10
vector<int> nums(N);
for(int i = 0; i < N; i++) cin >> nums[i];
vector<int> greaterNums = nextGreater(nums);
for(int i : greaterNums)
cout << i << ' ';
cout << '\n';

 int N; 5 4 6 9 -1 -1 4 6 9 -1 -1 
cin >> N; 1 4 6 9 6
vector<int> nums(N);
for(int i = 0; i < N; i++) cin >> nums[i];
vector<int> greaterNums = nextGreater(nums);
for(int i : greaterNums)
cout << i << ' ';
cout << '\n';

Passed all tests! 

Correct
Marks for this submission: 1.00/1.00.


Question 4
Given a string S of characters, a duplicate removal consists of choosing two adjacent and equal letters, and
Correct
removing them.
Mark 1.00 out
of 1.00 We repeatedly make duplicate removals on S until we no longer can.

Return the final string after all such duplicate removals have been made.

Included libraries: vector, list, stack

For example:

Test Result

cout << removeDuplicates("abbaca"); ca

cout << removeDuplicates("aab"); b

Answer: (penalty regime: 0 %)

Reset answer

1 ▼ string removeDuplicates(string S) {
2 stack<char> s;
3
4 ▼ for (char c : S) {
5 ▼ if (!s.empty() && s.top() == c) {
6 s.pop();
7 ▼ } else {
8 s.push(c);
9 }
10 }
11
12 string result;
13 ▼ while (!s.empty()) {
14 result = s.top() + result;
15 s.pop();
16 }
17
18 return result;
19 }


 Test Expected Got

 cout << removeDuplicates("abbaca"); ca ca 

 cout << removeDuplicates("aab"); b b 

Passed all tests! 

Correct
Marks for this submission: 1.00/1.00.


Question 5 Given a string s containing just the characters '(', ')', '[', ']', '{', and '}'. Check if the input string is valid based
Correct on following rules:
Mark 1.00 out
1. Open brackets must be closed by the same type of brackets.
of 1.00
2. Open brackets must be closed in the correct order.

For example:

String "[]()" is a valid string, also "[()]".

String "[])" is not a valid string.

Your task is to implement the function

bool isValidParentheses (string s){
/*TODO*/
}

Note: The library stack of C++ is included.

For example:

Test Result

cout << isValidParentheses("[]"); 1

cout << isValidParentheses("[]()"); 1

cout << isValidParentheses("[)"); 0

Answer: (penalty regime: 0 %)

Reset answer

1 ▼ bool isValidParentheses(string s) {
2 stack<char> stk;
3
4 ▼ for (char c : s) {
5 ▼ if (c == '(' || c == '[' || c == '{') {
6 stk.push(c);
7 ▼ } else {
8 if (stk.empty()) return false;
9
10 char top = stk.top();
11 stk.pop();
12
13 if ((c == ')' && top != '(') ||
14 (c == ']' && top != '[') ||
15 ▼ (c == '}' && top != '{')) {
16 return false;
17 }
18 }
19 }
20
21 return stk.empty();
22 }


 Test Expected Got

 cout << isValidParentheses("[]()"); 1 1 

 cout << isValidParentheses("[)"); 0 0 

Passed all tests! 

Correct
Marks for this submission: 1.00/1.00.


Question 6
Correct
A Maze is given as 5*5 binary matrix of blocks and there is a rat initially at the upper left most block i.e.,
Mark 1.00 out
maze[0][0] and the rat wants to eat food which is present at some given block in the maze (fx, fy). In a
of 1.00
maze matrix, 0 means that the block is a dead end and 1 means that the block can be used in the path
from source to destination. The rat can move in any direction (not diagonally) to any block provided the
block is not a dead end.

Your task is to implement a function with following prototype to check if there exists any path so that the rat
can reach the food or not:
bool canEatFood(int maze[5][5], int fx, int fy);

Template:

#include <iostream> #include <fstream> #include <string> #include <cstring> #include <stack> #include
<vector> using namespace std;

class Node { public: int x, y; int dir; node(int i, int j) { x = i; y = j; // Initially direction // set to 0 dir = 0; } };

Some suggestions: - X : x coordinate of the node - Y : y coordinate of the node - dir : This variable will be
used to tell which all directions we have tried and which to choose next. We will try all the directions in anti-
clockwise manner starting from up.

If dir=0 try up direction.

If dir=1 try left direction.
If dir=2 try down direction.
If dir=3 try right direction.

For example:

Test Result

// Maze matrix 1
int maze[5][5] = {
{ 1, 0, 1, 1, 0 },
{ 1, 1, 1, 0, 1 },
{ 0, 1, 0, 1, 1 },
{ 1, 1, 1, 1, 0 },
{ 1, 0, 0, 1, 0 }
};

// Food coordinates
int fx = 1, fy = 4;

cout << canEatFood(maze, fx, fy);

// Maze matrix 1
int maze[5][5] = {
{ 1, 0, 1, 1, 0 },
{ 1, 1, 1, 0, 0 },
{ 0, 1, 0, 1, 1 },
{ 0, 1, 0, 1, 0 },
{ 0, 1, 1, 1, 0 }
};

// Food coordinates
int fx = 2, fy = 3;

cout << canEatFood(maze, fx, fy);

Answer: (penalty regime: 0 %)

Reset answer

1 ▼ bool canEatFood(int maze[5][5], int fx, int fy) {

2 ▼ if (maze[0][0] == 0 || maze[fx][fy] == 0) {
3 return false;
4 }
5
6 stack<Node> stk;
7 stk.push(Node(0, 0));
8 maze[0][0] = 0;
9
10 ▼ while (!stk.empty()) {
11 Node current = stk.top();
12 int x = current.x;
13 int y = current.y;
14 int dir = current.dir;
15
16 ▼ if (x == fx && y == fy) {
17 return true;
18 }
19
20 bool moved = false;
21 ▼ while (dir < 4) {
22 int newX = x, newY = y;
23
24 ▼ if (dir == 0) {
25 newX--;
26 ▼ } else if (dir == 1) {
27 newY--;
28 ▼ } else if (dir == 2) {
29 newX++;
30 ▼ } else if (dir == 3) {
31 newY++;
32 }
33
34 ▼ if (newX >= 0 && newX < 5 && newY >= 0 && newY < 5 && maze[newX][newY] == 1) {
35 stk.push(Node(newX, newY));
36 maze[newX][newY] = 0;
37 moved = true;
38 break;
39 }
40
41 dir++;
42 }
43
44 ▼ if (!moved) {
45 stk.pop();
46 }
47 }
48
49 return false;
50 }


 Test Expected Got

 // Maze matrix 1 1 
int maze[5][5] = {
{ 1, 0, 1, 1, 0 },
{ 1, 1, 1, 0, 1 },
{ 0, 1, 0, 1, 1 },
{ 1, 1, 1, 1, 0 },
{ 1, 0, 0, 1, 0 }
};

// Food coordinates
int fx = 1, fy = 4;

cout << canEatFood(maze, fx, fy);

 // Maze matrix 1 1 
int maze[5][5] = {
{ 1, 0, 1, 1, 0 },
{ 1, 1, 1, 0, 0 },
{ 0, 1, 0, 1, 1 },
{ 0, 1, 0, 1, 0 },
{ 0, 1, 1, 1, 0 }
};

// Food coordinates
int fx = 2, fy = 3;

cout << canEatFood(maze, fx, fy);

Passed all tests! 

Correct
Marks for this submission: 1.00/1.00.


Question 7 Vietnamese version:
Correct
Bài toán stock span là một bài toán về chủ đề kinh tế tài chính, trong đó ta có thông tin về giá của một cổ
Mark 1.00 out
phiếu qua từng ngày. Mục tiêu của bài toán là tính span của giá cổ phiếu ở từng ngày.
of 1.00
Span của giá cổ phiếu tại ngày thứ i (ký hiệu là Si) được định nghĩa là số ngày liên tục nhiều nhất liền trước
ngày thứ i có giá cổ phiếu thấp hơn, cộng cho 1 (cho chính nó).

Ví dụ, với chuỗi giá cổ phiếu là [100, 80, 60, 70, 60, 75, 85].

1. Ngày thứ 0 không có ngày liền trước nên S0 bằng 1.

2. Ngày thứ 1 có giá nhỏ hơn giá ngày thứ 0 nên S1 bằng 1.
3. Ngày thứ 2 có giá nhỏ hơn giá ngày thứ 1 nên S2 bằng 1.
4. Ngày thứ 3 có giá lớn hơn giá ngày thứ 2 nên S3 bằng 2.
5. Ngày thứ 4 có giá nhỏ hơn giá ngày thứ 3 nên S4 bằng 1.
6. Ngày thứ 5 có giá lớn hơn giá ngày thứ 4, 3, 2 nên S5 bằng 4.
7. Ngày thứ 6 có giá lớn hơn giá ngày thứ 5, 4, 3, 2, 1 nên S6 bằng 6.

Kết quả sẽ là [1, 1, 1, 2, 1, 4, 6].

Yêu cầu. Viết chương trình tính toán chuỗi span từ chuỗi giá cổ phiếu từ đầu vào.
Input. Các giá trị giá cổ phiếu, cách nhau bởi các ký tự khoảng trắng, được đưa vào standard input.

Output. Các giá trị span, cách nhau bởi một khoảng cách, được xuất ra standard ouput.

(Nguồn: Geeks For Geeks)

=================================

Phiên bản tiếng Anh:

The stock span problem is a financial problem where we have a series of daily price quotes for a stock and
we need to calculate the span of the stock’s price for each day.

The span Si of the stock’s price on a given day i is defined as the maximum number of consecutive days
just before the given day, for which the price of the stock on the current day is less than its price on the
given day, plus 1 (for itself).

For example: take the stock's price sequence [100, 80, 60, 70, 60, 75, 85]. (See image above)

The given input span for 100 will be 1, 80 is smaller than 100 so the span is 1, 60 is smaller than 80 so the span
is 1, 70 is greater than 60 so the span is 2 and so on.

Hence the output will be [1, 1, 1, 2, 1, 4, 6].

Requirement. Write a program to calculate the spans from the stock's prices.

Input. A list of whitespace-delimited stock's prices read from standard input. 

Output. A list of space-delimited span values printed to standard output.

(Source: Geeks For Geeks)

For example:
Input Result

100 80 60 70 60 75 85 1 1 1 2 1 4 6

10 4 5 90 120 80 1 1 2 4 5 1

Answer: (penalty regime: 0 %)

Reset answer

1 ▼ vector<int> stock_span(const vector<int>& prices) {

2 vector<int> spans(prices.size());
3 stack<int> stk;
4
5 ▼ for (size_t i = 0; i < prices.size(); i++) {
6 ▼ while (!stk.empty() && prices[stk.top()] < prices[i]) {
7 stk.pop();
8 }
9 spans[i] = (stk.empty()) ? (i + 1) : (i - stk.top());
10 stk.push(i);
11 }
12
13 return spans;
14 }


 Input Expected Got

 100 80 60 70 60 75 85 1 1 1 2 1 4 6 1 1 1 2 1 4 6 

 10 4 5 90 120 80 1 1 2 4 5 1 1 1 2 4 5 1 

Passed all tests!  

Correct
Marks for this submission: 1.00/1.00.
Question 8 Given string S representing a postfix expression, the task is to evaluate the expression and find the final
Correct value. Operators will only include the basic arithmetic operators like *, /, + and -.
Mark 1.00 out
Postfix expression: The expression of the form “a b operator” (ab+) i.e., when a pair of operands is followed
of 1.00
by an operator.

For example: Given string S is "2 3 1 * + 9 -". If the expression is converted into an infix expression, it will be 2
+ (3 * 1) – 9 = 5 – 9 = -4.

Requirement: Write the function to evaluate the value of postfix expression.

For example:

Test Result

cout << evaluatePostfix("2 3 1 * + 9 -"); -4

cout << evaluatePostfix("100 200 + 2 / 5 * 7 +"); 757

Answer: (penalty regime: 0 %)

Reset answer

1 ▼ int evaluatePostfix(string expr) {

2 stack<int> stk;
3 string token;
4 size_t pos = 0;
5
6 ▼ while (pos < expr.length()) {
7 size_t spacePos = expr.find(' ', pos);
8 ▼ if (spacePos == string::npos) {
9 spacePos = expr.length();
10 }
11
12 token = expr.substr(pos, spacePos - pos);
13
14 ▼ if (isdigit(token[0])) {
15 stk.push(stoi(token));
16 ▼ } else {
17 int right = stk.top(); stk.pop();
18 int left = stk.top(); stk.pop();
19 ▼ switch (token[0]) {
20 case '+': stk.push(left + right); break;
21 case '-': stk.push(left - right); break;
22 case '*': stk.push(left * right); break;
23 case '/': stk.push(left / right); break;
24 }
25 }
26 pos = spacePos + 1;
27 }
28
29 return stk.top();
30 }
31

Test Expected Got 

 cout << evaluatePostfix("2 3 1 * + 9 -"); -4 -4 

 cout << evaluatePostfix("100 200 + 2 / 5 * 7 +"); 757 757 

Passed all tests! 

Correct
Marks for this submission: 1.00/1.00.