Skip to content
TutorialCup
  • Home
  • Tutorials
    • C
    • C++
    • DBMS
    • Java
    • Python
    • SQL
    • Testing
    • GitHub
    • Spring Boot
    • R
    • JavaScript
  • Interviews
    • Technical Interview Questions
    • Interview Questions

TutorialCup

  • Home
  • Tutorials
    • C
    • C++
    • DBMS
    • Java
    • Python
    • SQL
    • Testing
    • GitHub
    • Spring Boot
    • R
    • JavaScript
  • Interviews
    • Technical Interview Questions
    • Interview Questions

Evaluate Division

In evaluate division problem we have given some equations, in the form, A/B = k, where A and B are strings and k is a real number. Answer some queries, if the answer does not exist return -1. Example Input: equations: a/b = 2.0 and b/c = 3.0 queries: a/c …

Read moreEvaluate Division

Categories Algorithm Interview Questions Tags Amazon, Bloomberg, Facebook, Google, Graph, Medium, Microsoft, Uber, Union Find

Kruskal Algorithm

What is Kruskal Algorithm? Kruskal’s algorithm is used to find the minimum spanning tree(MST) of a connected and undirected graph. Example Graph Minimum Spanning Tree(MST) Algorithm Kruskal’s algorithm is a greedy algorithm to find the minimum spanning tree. Sort the edges in ascending order according to their weights. At every …

Read moreKruskal Algorithm

Categories Graph Interview Questions Tags Amazon, Depth First Search, Hard, Union Find

Search




© TutorialCup 2021 | Feeds | Privacy Policy | Terms | Contact Us | Linkedin | About Us
Scroll back to top