Check out the Most Asked Coding Interview Problem list compiled by Raja Vikramaditya AKA Striver. The sheet is popularly known as “Striver’s SDE Sheet”
Continue readingStrivers A2Z DSA Course/Sheet
The course is made for people who want to learn DSA from A to Z for FREE from one of
Continue readingMost trusted 90 days roadmap to placement – Guaranteed
This roadmap is aimed at helping entry-level software engineering jobs aspirants at top tech product-based companies and startups. Note: Please
Continue readingMUST-DO Questions for [DBMS, CN, OS] Interviews: SDE Core Sheet
(Sheet for the sole purpose of quick revision and preparation in less time) Made with love by takeUforward! What is
Continue readingStriver’s Tree Series : Tree Data Structure
In this post we will check “Striver’s Tree Series : Tree Data Structure”. What is a tree data structure? There
Continue readingTCS NQT Coding Sheet – TCS Coding Questions
This post contains all popular and most frequents coding questions asked in the TCS NQT test and other similar tests.
Continue readingPaid Work from Home Internship at takeUforward!
Hello Fam! Thanks for being a part of the community. We have 50 openings for paid work from home internships
Continue readingStriver Graph Series : Top Graph Interview Questions
Part 1: Introduction to Graph Find both C++/Java codes of all problem in the articles in the first column. Topic
Continue readingMinimum Spanning Tree – Theory: G-44
In this article, we will be discussing the minimum spanning tree. So, to understand the minimum spanning tree, we first
Continue readingFind the City With the Smallest Number of Neighbours at a Threshold Distance: G-43
Problem Statement: There are n cities numbered from 0 to n-1. Given the array edges where edges[i] = [fromi, toi,weighti]
Continue readingFloyd Warshall Algorithm: G-42
Problem Statement: The problem is to find the shortest distances between every pair of vertices in a given edge-weighted directed
Continue readingBellman Ford Algorithm: G-41
Problem Statement: Given a weighted, directed and connected graph of V vertices and E edges, Find the shortest distance of
Continue readingDijkstra’s Algorithm – Using Set : G-33
Given a weighted, undirected, and connected graph of V vertices and an adjacency list adj where adj[i] is a list
Continue readingDijkstra’s Algorithm – Using Priority Queue : G-32
Given a weighted, undirected, and connected graph of V vertices and an adjacency list adj where adj[i] is a list
Continue readingWord Ladder-II (Optimised Approach) G-31
Given two distinct words startWord and targetWord, and a list denoting wordList of unique words of equal lengths. Find all
Continue readingG-30 : Word Ladder-II
Given two distinct words startWord and targetWord, and a list denoting wordList of unique words of equal lengths. Find all
Continue readingAlien Dictionary – Topological Sort: G-26
Problem Statement: Given a sorted dictionary of an alien language having N words and k starting alphabets of a standard
Continue reading