Sparse Table -Range Query TechniqueHey Guys, If you are a problem solver, you face some problem that requires new algorithms to solve that problem in the most optimal way…Aug 21, 2021Aug 21, 2021
Cloud Technology — what if it “Rain”Hey Guys, if you are interested in technology,you have heard much latest technology like machine learning, artificial intelligence, cloud…Aug 5, 2021Aug 5, 2021
Fast I/O in java for Competitive programmingOne day I was solving a problem on the CSES problem set of graph theory and one famous problem LCMSUM of SPOJ which the application of…Aug 4, 2021Aug 4, 2021
BigInteger in javaIf you are interested in coding or math,one famous question you often heard is “ find the factorial of n numbers ”.And you did this…Aug 4, 2021Aug 4, 2021
Increasing Array -[CSES]You are given an array of n integers. You want to modify the array so that it is increasing, i.e., every element is at least as large as…Aug 1, 2021Aug 1, 2021
Soduku (Backtracking )- GFGGiven an incomplete Sudoku configuration in terms of a 9 x 9 2-D square matrix (grid[][]), the task to find a solved Sudoku. For…Jul 31, 2021Jul 31, 2021
Cyclically rotate an array by one — GFGGiven an array, rotate the array by one position in clockwise direction.Jul 31, 2021Jul 31, 2021
why the graph is favourite for FAANG?If you are a competative programmmer or a computer science student ,you often heard about a buzzword in tech industry “Graph”.Let’s talk…Jul 31, 2021Jul 31, 2021
Redundant Connection (Graph)-[LeetCode]Prerequisite :- Graph , DSU Algorithms, DFS AlgorithmsJul 29, 2021Jul 29, 2021
Application of BFS On GridSuppose you have a given a matrix as a map of nxm which contains dot(.) and hash(#) symbol in given matrix .Dot is consider as floor and…Jul 16, 2021Jul 16, 2021
Monk and the Islands-HackerEarth(Graph)Prerequisite:- Graph, shortest path using BFS , DijkstraJul 14, 2021Jul 14, 2021
Longest path in a tree -SpojPrerequisite:- DFS,graph implementation,Diameter of TreeJul 14, 2021Jul 14, 2021
![Binary Tree Level Order Traversal (Tree) -[Leetcode]](https://miro.medium.com/v2/resize:fill:80:53/0*Rr6jFENXYvYWt4_i.jpg)
![Binary Tree Level Order Traversal (Tree) -[Leetcode]](https://miro.medium.com/v2/resize:fill:160:107/0*Rr6jFENXYvYWt4_i.jpg)
![Redundant Connection (Graph)-[LeetCode]](https://miro.medium.com/v2/resize:fill:80:53/0*uZtMz-bQfvTHVESH.jpg)
![Redundant Connection (Graph)-[LeetCode]](https://miro.medium.com/v2/resize:fill:160:107/0*uZtMz-bQfvTHVESH.jpg)
