This file contains 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
<div class="container"> | |
<div class="grid"> | |
<div class="col-10_sm-12">PATIENT ID #1888450</div> | |
<div class="col-2_sm-12">12/04/18 20:15</div> | |
</div> | |
</div> | |
<div class="container"> |
This file contains 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
package main | |
import "fmt" | |
func main() { | |
s1 := "abcdefg%!~~" | |
s2 := "ac%dgf!b~e~" | |
fmt.Println(isPermutation(s1, s2)) | |
} |
This file contains 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
Authentciation aka AuthN proves an user or an application who they say they are, traditionally through username and password, or in modern days with biometrics or MFA. | |
Authorisation aka AuthZ comes after Authentication which determines the proven identity what it is allowed to do on a scope of resources. |
This file contains 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
class Solution { | |
public int maxDepth(Node root) { | |
if (root == null) { | |
return 0; | |
} | |
return dfs(root); | |
} | |
public int dfs(Node n) { | |
int maxChild = 0; |
This file contains 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
class Solution { | |
public List<List<Integer>> levelOrder(TreeNode root) { | |
List<List<Integer>> out = new ArrayList<List<Integer>>(); | |
dfs(root, out, -1); | |
return out; | |
} | |
public void dfs(TreeNode node, List<List<Integer>> out, int dep) { | |
dep++; | |
if(node != null) { |
This file contains 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
#!/bin/bash | |
MIN_COVER=67.5 | |
go test ./... -coverprofile cover.out | |
CODE_COVER=$( go tool cover -func=cover.out | tail -1 | sed '/^$/d;s/[[:blank:]]//g' | sed 's/total:(statements)//g' | sed 's/%//g' ) | |
rm -rf cover.out | |
if [[ "${CODE_COVER}" < "${MIN_COVER}" ]] | |
then | |
echo "*** CODE COVERAGE CHECK FAILED, EXEPECTED ${MIN_COVER}%, GOT ${CODE_COVER}% ***" |