Visit to the National Liberation War Museum, Dhaka on 14th January, 2021
Students of Grade 6, 7, and 8,
//Dijkstra algorithm is used to find the shortest distance between two nodes inside a valid weighted graph. Often used in Google Maps, Network Router etc. | |
//helper class for PriorityQueue | |
class Node { | |
constructor(val, priority) { | |
this.val = val; | |
this.priority = priority; | |
} | |
} |
const functions = require("firebase-functions"); | |
const admin = require("firebase-admin"); | |
const privateKey = ""; | |
const clientEmail = ""; | |
const projectId = ""; | |
if (!admin.apps.length) { | |
admin.initializeApp({ | |
credential: admin.credential.cert({ |
{"UserId":"12xxxx", | |
"PlatformID": ["twitter"], | |
"Description": "Hello World", | |
"Hashtags": ["#watch", "#cartier"], | |
"Mentions": ["@someone", "@else", "@here"], | |
"Image": ["data:image/jpeg;base64,/9j/4AAQSkZJRgABAQEAeAB4AAD/2wBDAAMCAgMCAgMDAwMEAwMEBQgFBQQEBQoHBwYIDAoMDAsKCwsNDhIQDQ4RDgsLEBYQERMUFRUVDA8XGBYUGBIUFRT/2wBDAQMEBAUEBQkFBQkUDQsNFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBT/wAARCAHgAnEDASIAAhEBAxEB/8QAHwAAAQUBAQEBAQEAAAAAAAAAAAECAwQFBgcICQoL/8QAtRAAAgEDAwIEAwUFBAQAAAF9AQIDAAQRBRIhMUEGE1FhByJxFDKBkaEII0KxwRVS0fAkM2JyggkKFhcYGRolJicoKSo0NTY3ODk6Q0RFRkdISUpTVFVWV1hZWmNkZWZnaGlqc3R1dnd4eXqDhIWGh4iJipKTlJWWl5iZmqKjpKWmp6ipqrKztLW2t7i5usLDxMXGx8jJytLT1NXW19jZ2uHi4+Tl5ufo6erx8vP09fb3+Pn6/8QAHwEAAwEBAQEBAQEBAQAAAAAAAAECAwQFBgcICQoL/8QAtREAAgECBAQDBAcFBAQAAQJ3AAECAxEEBSExBhJBUQdhcRMiMoEIFEKRobHBCSMzUvAVYnLRChYkNOEl8RcYGRomJygpKjU2Nzg5OkNERUZHSElKU1RVVldYWVpjZGVmZ2hpanN0dXZ3eHl6goOEhYaHiImKkpOUlZaXmJmaoqOkpaanqKmqsrO0tba3uLm6wsPExcbHyMnK0tPU1dbX2Nna4uPk5ebn6Onq8vP09fb3+Pn6/9oADAMBAAIRAxEA |
{% comment %} | |
@param class_root {String} | |
Base class root | |
@param show_range {Bool} | |
Show price range | |
@param price_range_format {String} | |
'range' or 'from', defaults to 'range' |
// A binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. | |
// Left child is always less than it's parent and the right child is always bigger than it's parent. | |
class Node { | |
constructor(value) { | |
this.value = value; | |
this.right = null; | |
this.left = null; | |
} | |
} |
[ | |
{ | |
"role": "system", | |
"content": "Imagine you're an expert product reviewers that tries to give insight on specific and important details based on reviews" | |
}, | |
{ | |
"role": "user", | |
"content": "This is the first product: Budge Lite Car Cover Dirtproof, Scratch Resistant, Breathable, Dustproof, Car Cover Fits Sedans up to 264\", Gray and here are its reviews from other people, I'll send more reviews in a bit: [{\"rating\":\"5.0 out of 5 stars\",\"title\":\"5.0 out of 5 stars\\n\\n\\n\\n\\n\\n\\n\\n \\n \\n Not suitable for 98+ Lincoln hood ornament modifications\",\"text\":\"I ordered this cover for a 1998 Lincoln Town Car. Its the right size, it wards off dust just like it says. I ordered just the dust cover and surprisingly its a tad “water resistant”. By that i mean any part of the cover that isn’t directly laying flat on your car will “roll” water off the side. Pretty cool! I ordered and used Amazon’s size confirming feature to make sure it would fit the 1998 lincoln town car i meant |
1. Colt Steele | |
2. Khan Academy | |
3. Udemy | |
4. 1337x.to | |
5. Krita (Maybe) | |
6. Take M. Rahmat to Australia | |
7. Buy Mehedi Hasan (hasan not sure) something pricy, he was a good teacher |
marniel | |
teacher |
//Suppose you have an svg element defined in html like this: | |
<img src="/profile.svg" alt="some svg" id="my-svg"/> | |
//to change its color, you can do this in the css: | |
#my-svg { | |
filter: invert(19%) sepia(48%) saturate(1556%) hue-rotate(223deg) brightness(91%) contrast(123%); | |
} |