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
/* | |
* Assume s is a string of lower case characters. | |
* | |
* Write a program that prints the longest substring of s | |
* in which the letters occur in alphabetical order. | |
* | |
* For example, if s = 'azcbobobegghakl', then your program should print | |
* "Longest substring in alphabetical order is: beggh" | |
* | |
* In the case of ties, print the first substring. |
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
var work = process._getActiveHandles().length + process._getActiveRequests().length; | |
foo(); | |
var newWork = (process._getActiveHandles().length + process._getActiveRequests().length) - work; | |
if(newWork > 0) { | |
console.log("asynchronous work took place."); | |
} |
NewerOlder