Skip to content

TECH DOSE

LEARN -> PRACTICE -> GET HIRED

  • Schedule an Interview
  • Courses
  • Interview Experiences
  • Profile
  • Write
Search Search Close
  • Home
  • Spetsnaz
  • Page 2

Author: Spetsnaz

Tech Enthusiast
Dec 22

Reconstruct Itinerary | Leetcode #332

SpetsnazLeave a commentData Structuresgraph, leetcode 332, Reconstruct Itinerary, sorting

This video explains an important graph programming interview problem which is to reconstruct itinerary.This problem can be solved by using just simple graph traversal technique by using multiset and stack.Map is used to construct the adjacency list because we need Read full

Dec 22

Cheapest Flights Within K Stops | DFS + Pruning | Leetcode #787

SpetsnazLeave a commentGraphbellman ford algorithm, Cheapest Flights Within K Stops, dfs, dijkstra algorithm, graph, Leetcode 787

This video explains a very important graph programming interview problem which is to find the minimum cost path from source to destination.This is a very typical shortest path problem and can be solved by using a variety of algorithms like Read full

Dec 22

Course Schedule | Deadlock Detection | Graph Coloring

SpetsnazLeave a commentGraph, Interview PreparationCourse Schedule, Deadlock Detection, graph coloring, leetcode 207

This video explains a very important programming interview problem which is, given a course schedule with prerequisites for each course, find if it is possible to take all the courses satisfying the prerequisites for each course. If it is possible Read full

Dec 22

Detect cycle in undirected graph

SpetsnazLeave a commentData Structurescycle detection in graph, Detect cycle in an undirected graph, graph, graph algorithm, graph coloring, graph colouring

This video explains how to detect cycle in an undirected graph. I have explained the graph coloring method for this problem. This problem is very frequently asked in coding round as well as in interview.

Dec 19

Implement LRU cache

SpetsnazLeave a commentData StructuresLRU Cache, LRU Cache implementation

Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement the LRUCache class: LRUCache(int capacity) Initialize the LRU cache with positive size capacity. int get(int key) Return the value of the key if the key exists, otherwise return -1. void put(int key, int value)  Update Read full

Posts navigation

Previous 1 2 3 … 6 Next

Placement Preparation Plan

https://www.youtube.com/watch?v=g_qAXBFglj0

Recent Posts

  • Pairs of songs with total durations divisible by 60 | Leetcode #1010 April 7, 2021
  • Trapping Rainwater Problem | Leetcode #42 March 25, 2021
  • 4 Sum Problem | Leetcode #18 March 17, 2021
  • Chaining in Hashmap | Collision Resolution Technique February 28, 2021
  • How to Sort a very large file | External Sorting technique February 26, 2021
  • Schedule an Interview
  • Courses
  • Interview Experiences
  • Profile
  • Write
Copyright © TECH DOSE
Education Soul by WEN Themes