Algorithms

• Finding the lowest common ancestor (LCA) using Euler tour and sparse table
• Finding LCA of two nodes in a tree
• Prim's minimum spanning tree
• Kruskal's minimum spanning tree
• Isomorphic Trees - AHU Algorithm
• Find center of a tree
• Rooting a tree at a specific node
• Combinations
• Permutations
• Dijkstra's shortest path algorithm
• Detecting negative cycle - Bellman-Ford algorithm
• Tarjan's strongly connected components
• Single source shortest path - DAG
• Topological sort using Kahn's algorithm
• Topological sort using DFS
• Find connected components of a graph using DFS
• Depth first search (DFS)
• Cycle detection in a graph using DFS
• Breadth first search (BFS)
• Two Way Merge Sort
• Selection Sort
• Quick Sort
• Merge Sort
• Insertion sort
• Bubble Sort
• Heap sort in kotlin
• Pre, Post and In-order tree traversal

Android

• Mutable shared flow
• Custom Views - II
• Custom Views - I
• Pending Intents - Part 2
• Pending Intents - Part 1
• What to return from onStartCommand
• Looper/Handler API - Part 4
• Looper/Handler API - Part 3
• Looper/Handler API - Part 2
• Getting familiar with Loaders - Part 2
• Getting familiar with Loaders - Part 1
• Looper/Handler API - Part 1

Bash

• Indexed and associative arrays in bash
• Using netstat to find the process listening on specific port
• Here doc in bash
• Automating inputs to linux scripts

Best-practices

• Being consistent

Bfs

• Breadth first search (BFS)

Binary-tree

• Complete vs Perfect/Full binary tree
• Array representation of a binary tree

Cycle-detection

• Detecting negative cycle - Bellman-Ford algorithm
• Cycle detection in a graph using DFS

Data-structures

• Union-Find (Disjoint-Set)
• Range queries - sparse table
• Range queries - creating prefix sum of a 2D array
• Segment tree
• Binary Indexed Tree (BIT) or Fenwick tree
• Heap data structure in java/kotlin
• Binary heap implementation in kotlin
• Heap data structure, heap sort , heapify and priority queues
• Complete vs Perfect/Full binary tree
• Array representation of a binary tree

Dfs

• Topological sort using DFS
• Find connected components of a graph using DFS
• Depth first search (DFS)
• Cycle detection in a graph using DFS

Disjoint-sets

• Union-Find (Disjoint-Set)

Git

• Git reset

Gradle

• Gradle task rules
• Creating tasks in gradle - Tasks API
• Gradle - Build lifecycle
• Gradle Mysteries

Graphs

• Prim's minimum spanning tree
• Kruskal's minimum spanning tree
• Isomorphic Trees - AHU Algorithm
• Find center of a tree
• Rooting a tree at a specific node
• Dijkstra's shortest path algorithm
• Detecting negative cycle - Bellman-Ford algorithm
• Tarjan's strongly connected components
• Single source shortest path - DAG
• Topological sort using Kahn's algorithm
• Topological sort using DFS
• Find connected components of a graph using DFS
• Depth first search (DFS)
• Cycle detection in a graph using DFS
• Breadth first search (BFS)

Handlers

• Looper/Handler API - Part 4
• Looper/Handler API - Part 3
• Looper/Handler API - Part 2
• Looper/Handler API - Part 1

Heap

• Heap sort in kotlin
• Heap data structure in java/kotlin
• Binary heap implementation in kotlin
• Heap data structure, heap sort , heapify and priority queues

Java

• Callable & Future Interfaces
• Exchanger
• Synchronized keyword ?
• Semaphore
• Syncing with CyclicBarrier
• Syncing with CountDownLatch
• Exception Handling in Threads
• Thread Local Variables

Kotlin

• Mutable shared flow
• Heap data structure in java/kotlin

Lca

• Finding the lowest common ancestor (LCA) using Euler tour and sparse table
• Finding LCA of two nodes in a tree

Linux

• Ubuntu 22.04 is stuck on startup
• Stop Microsoft Teams from starting on startup
• Indexed and associative arrays in bash
• Using netstat to find the process listening on specific port
• Here doc in bash
• Automating inputs to linux scripts

Loaders

• Getting familiar with Loaders - Part 2
• Getting familiar with Loaders - Part 1

Mst

• Prim's minimum spanning tree
• Kruskal's minimum spanning tree

Random

• Being consistent
• Why should I fix it?

Shell-scripting

• Using netstat to find the process listening on specific port
• Here doc in bash
• Automating inputs to linux scripts

Sorting

• Topological sort using Kahn's algorithm
• Topological sort using DFS
• Two Way Merge Sort
• Selection Sort
• Quick Sort
• Merge Sort
• Insertion sort
• Bubble Sort
• Heap sort in kotlin
• Heap data structure, heap sort , heapify and priority queues

Sssp

• Dijkstra's shortest path algorithm
• Single source shortest path - DAG

Threads

• Callable & Future Interfaces
• Exchanger
• Synchronized keyword ?
• Semaphore
• Syncing with CyclicBarrier
• Syncing with CountDownLatch
• Exception Handling in Threads
• Thread Local Variables

Top-sort

• Topological sort using Kahn's algorithm
• Topological sort using DFS

Trees

• Finding the lowest common ancestor (LCA) using Euler tour and sparse table
• Finding LCA of two nodes in a tree
• Prim's minimum spanning tree
• Kruskal's minimum spanning tree
• Isomorphic Trees - AHU Algorithm
• Find center of a tree
• Rooting a tree at a specific node
• Pre, Post and In-order tree traversal

Ubuntu

• Ubuntu 22.04 is stuck on startup
• Stop Microsoft Teams from starting on startup

Views

• Custom Views - II
• Custom Views - I