flowchart TD
A([Procurement User]) -->|Sends invitation from UI| B[Invitation Email Sent\nstatus: invited]
B -->|Vendor replies with documents attached| C[Email Received\nstatus: received]
C --> D{Document\nExtraction}
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| const rfc = require('node-rfc'); | |
| module.exports = async (query, skip, count, cb) => { | |
| try { | |
| const abapSystem = { | |
| user: process.env['SAP_USER'], | |
| passwd: process.env['SAP_PASSWD'], | |
| ashost: process.env['SAP_ASHOST'], | |
| sysnr: process.env['SAP_SYSNR'], |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # List of plugins | |
| set -g @plugin 'tmux-plugins/tpm' | |
| set -g @plugin 'tmux-plugins/tmux-sensible' | |
| set -g @plugin 'tmux-plugins/tmux-yank' | |
| set -g @plugin 'tmux-plugins/tmux-resurrect' | |
| # Other examples: | |
| # set -g @plugin 'github_username/plugin_name' | |
| # set -g @plugin 'github_username/plugin_name#branch' |
practicing code challenge and improve typescript skill [[Leetcode/Resources|Resources]]
-
Classic Brute force: loop through number of array and then loop through again check if first value + second value = target value, return the current index and the compared index. time complexity would be:
$O(n^2)$ -
One Pass: Using hash map or in this case Object in typescript. loop through the array once, calculate the difference with target - current value, if the difference already in the hash table return that hash map value which is the nums index and the current index otherwise put it inside the hash map. time complexity would be:
$O(n)$