✏️
GitBook
  • Home
  • Projects
    • ORBI Group. Hotels Services
    • ORBI Group. Sales Support System
    • ORBI Group. Financial Management
    • ORBI Group. Client Cabinet
    • BP. Insurance management admin panel
    • Ciklum. Seaports fisheries containers tracking system
  • Higher Education
    • KNUTD (2018 - 2019)
    • School 42 (2017 - 2020)
  • FLG Preparation
    • Algorithms
      • Basics
        • Learn How To Learn
        • Algo task pattern
        • Space/time complexity
      • Two Pointers
        • Tasks
      • Fast and Slow Pointers
        • Tasks
      • Sliding Window
        • Tasks
      • Merge Intervals
        • Tasks
      • In-place Reversal of a Linked List
        • Tasks
      • Two Heaps
        • Tasks
      • K-Way Merge
        • Tasks
      • Top K Elements
        • Tasks
      • Subsets
        • Tasks
      • Modified Binary Search
        • Tasks
      • Greedy Techniques
        • Tasks
      • Backtracking
        • Tasks
      • Dynamic Programming
        • Tasks
        • 0/1 Knapsack Problem
      • Cyclic Sort
        • Tasks
      • Topological Sort
        • Tasks
      • Matrices
        • Tasks
      • Stacks
        • Tasks
    • Data Structures
      • Doubly Linked List
      • Stack
      • Queue
      • Heap
    • Frontend
    • Resources
  • Courses
    • Animations
    • JS Algorithms and Data Structures Course
      • Add Up To
      • Anagrams
      • Binary Search
      • Divide and Conquer
      • Frequency Counter
      • Sliding Window
      • Two Pointers
    • Nest.js
      • Logging
    • PostgreSQL
      • Sequelize
      • SUM
      • COUNT, DISTINCT (unique)
      • WHERE
      • AND, OR, BETWEEN
      • Practice 1
      • IN, NOT IN
      • ORDER BY
      • MIN, MAX, AVG
      • Practice 2
      • Pattern matching with LIKE
      • LIMIT, check for NULL (IS, IS NOT), GROUP BY, HAVING
      • UNION, INTERSECT, EXCEPT
      • Practice 3
      • INNER JOIN
      • LEFT, RIGHT JOIN
      • SELF JOIN
      • USING & NATURAL JOIN
      • AS
      • Practice 4
      • Practice 5. Subrequests
      • DDL - Data Definition Language
      • Practice 6. DDL
      • Primary & foreign keys
      • Check
      • Default
      • Sequences
      • INSERT
      • UPDATE, DELETE, RETURNING
      • Practice 7. DDL(2)
      • Проектирование БД
      • Нормальная форма (НФ)
      • Представление (View)
      • Создание представления
      • Обновляемые представления
      • Опция Check
      • Practice 8. Views
      • CASE WHEN
      • COALESCE & NULLIF
      • Practice 9. Logic
    • DevOps
      • Linux
        • File System
        • Command Line
        • Package Manager
        • VIM
        • Linux Accounts & Groups (Users & Permissions)
        • Pipes & Redirects
        • Shell / bash scripting
        • Environment Variables
      • Networking
      • SSH
      • Git for DevOps
      • Nexus. Artifact repository manager
      • Docker
      • Jenkins
  • Daily Log
    • 2023
Powered by GitBook
On this page

Was this helpful?

  1. FLG Preparation
  2. Algorithms
  3. Stacks

Tasks

Stacks

Index
Task Name
Task Number
Difficulty
Link

1

Valid Parentheses

20

Easy

2

Min Stack

155

Easy

3

Implement Queue using Stacks

232

Easy

4

Simplify Path

71

Medium

5

Decode String

394

Medium

6

Largest Rectangle in Histogram

84

Hard

7

Evaluate Reverse Polish Notation

150

Medium

8

Trapping Rain Water

42

Hard

9

Valid Parenthesis String

678

Medium

10

Binary Tree Inorder Traversal

94

Medium

11

Basic Calculator

224

Hard

// 224. Basic Calculator

// Time: O(n)
// Space: O(n)
var calculate = function(s) {
    let sign = 1; 
    let sum = 0;
    const stack = [];

    for (let i = 0; i < s.length; i += 1) {
        if (s[i] >= '0' && s[i] <= '9') {
            let num = '';
	    // num can be multiple digits, iterate to build full num.
            while (s[i] >= '0' && s[i] <= '9') {
                num += s[i];
                i += 1;
            }
	    // add your completed sum.
            sum += (num * sign);
	    // while loop from earlier causes our index to move forward once, bring it back
            i -= 1;
        } else if (s[i] === '+') {
            sign = 1;
        } else if (s[i] === '-') {
            sign = -1;
        } else if (s[i] === '(') {
	    // open parens signifies that we should calculate the inside of the parens first and store the outer sum and sign in stack. 
	    // we can later retrieve the values in our stack once we find a closing bracket.
            stack.push(sum);
            stack.push(sign);
            sum = 0
	    // we used our sign, reset it to default.
            sign = 1;
        } else if (s[i] === ')') {
	    // closing bracket assumes we've calculated the sum inside the parens. 
	    // Earlier, we pushed the sum first into our stack. First pop will be the sign. Second pop will be the outer sum.
            sum = stack.pop() * sum;
            sum += stack.pop();
        }
    }
    
    return sum;
};
PreviousStacksNextData Structures

Last updated 1 year ago

Was this helpful?

Link
Link
Link
Link
Link
Link
Link
Link
Link
Link
Link