| const fs = require('fs'); | |
| // Reading a file | |
| fs.readFile('file.txt', 'utf8', (err, data) => { | |
| if (err) { | |
| console.error('Error reading file:', err); | |
| } else { | |
| console.log('File content:', data); | |
| } | |
| }); |
| /* | |
| Valid Parentheses | |
| s = "({})" | |
| o/p: true | |
| s = "(){}[]" | |
| o/p: true |
| class ListNode { | |
| constructor(val) { | |
| this.val = val; | |
| this.next = null; | |
| } | |
| } | |
| let getSum = head => { | |
| let ans = 0; | |
| while(head) { |
| /** | |
| * Return true if palindrom | |
| * place i = 0; j = arr1.length - 1 | |
| * while i < j end of loop return TRUE | |
| * if (arr1[i] != arr1[j]) { | |
| * return false | |
| *} | |
| * i++; | |
| * j--; | |
| * Time Complexity: O(N) |
Say you have an array for which the ith element is the price of a given stock on day i.
If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.
Example 1: Input: [7, 1, 5, 3, 6, 4] Output: 5
| <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> | |
| <html xmlns="http://www.w3.org/1999/xhtml"> | |
| <head> | |
| <meta http-equiv="Content-Type" content="text/html; charset=utf-8"> | |
| <meta http-equiv="X-UA-Compatible" content="IE=edge"> | |
| <meta name="viewport" content="width=device-width, initial-scale=1.0"> | |
| <title>HTML Email Template</title> | |
| </head> | |
| <body style="margin:0;background-color:#cccccc;"> |