Charts are from different sources and thus colors are inconsistent, please carefully read the chart's legends.
Like this? Check React Native vs Flutter: https://gist.github.com/tkrotoff/93f5278a4e8df7e5f6928eff98684979
Charts are from different sources and thus colors are inconsistent, please carefully read the chart's legends.
Like this? Check React Native vs Flutter: https://gist.github.com/tkrotoff/93f5278a4e8df7e5f6928eff98684979
import { Directive, ElementRef, HostListener, AfterViewInit } from '@angular/core'; | |
/* | |
* Directive to add 'drag' support to Ngx Bootstrap modals (https://github.com/valor-software/ngx-bootstrap). | |
* Based on this library to enable drag support for an ng-bootstrap modal: https://github.com/mattxu-zz/ngb-modal-draggable | |
* | |
* Enable by adding the directive to the modal-header element, e.g.: | |
* | |
* <div class="modal-header" ngxModalDraggable> </div> | |
*/ |
class MainActivity : AppCompatActivity() { | |
var bluetoothAdapter : BluetoothAdapter? = null | |
var bluetoothScanner : BluetoothLeScanner? = null | |
override fun onCreate(savedInstanceState: Bundle?) { | |
super.onCreate(savedInstanceState) | |
setContentView(R.layout.activity_main) | |
rssiTextView = findViewById(R.id.rssiTextView) | |
bluetoothAdapter = BluetoothAdapter.getDefaultAdapter() |
blueprint: | |
name: Low Battery Notifications & Actions | |
description: > | |
# 🪫 Low Battery Notifications & Actions | |
**Version: 2.1** | |
🚀 Stay Charged, Stay Smart! Let's automate and take charge of your battery maintenance!🔋⚡ | |
I've recently joined Amazon Dublin from India and got opportunities to interview with Meta London, Zalando Berlin & some other companies. I extensively researched about companies hiring internationally which support visa & relocation for Tech roles. So sharing list of companies:
Do consider to STAR, if it helped you.
London
class Node: | |
def __init__(self, data: list, level, f_val): | |
self.data = data | |
self.level = level | |
self.f_val = f_val | |
def generate_children(self): | |
children = [] | |
values = [[0, 1], [1, 0], [-1, 0], [0, -1]] | |
row, col = self.find() |
def is_safe(graph, colours, colour, current): | |
neighbours = graph[current] | |
for neighbour in neighbours: | |
if colour == colours[neighbour - 1]: | |
return False | |
return True | |
def graph_traversal(graph, colours, vertices, current): | |
if current == vertices + 1: | |
return True |
import heapq | |
from typing import List | |
def djikstra(graph_inner, starting, vertices) -> List: | |
pq = [] | |
dist = [float('inf') for i in range(vertices)] | |
dist[starting] = 0 | |
print(dist) | |
heapq.heappush(pq, [0, starting]) |