Skip to content

Instantly share code, notes, and snippets.

View rishabhverma17's full-sized avatar
💭
I may be slow to respond.

Rishabh Verma rishabhverma17

💭
I may be slow to respond.
View GitHub Profile
@rishabhverma17
rishabhverma17 / CourseSchedule2.java
Last active October 24, 2021 16:57
LeetCode 210 Course Schedule II Problem. Solution Based on Topological Sorting.
package graph.leetcode;
import java.util.ArrayList;
import java.util.Stack;
public class CourseSchedule2 {
private static boolean isDAG = true;
public static void main(String[] args) {
@rishabhverma17
rishabhverma17 / RatInAMaze.java
Last active May 30, 2021 11:06
Solution to Rat in a Maze problem
class RatInAMaze {
public static ArrayList<String> findPath(int[][] m, int n) {
boolean[][] visited = new boolean[n][n];
ArrayList<String> result = new ArrayList<>();
StringBuilder sb = new StringBuilder();
backtrack(m,0,0,visited,result, sb);
Collections.sort(result);
return result;
}
@rishabhverma17
rishabhverma17 / Main.java
Created December 23, 2020 19:39
Print Odd Even on different threads
public class Main {
/**
* Expected Output
* Printing odd even till 10
oddThread :: 1
evenThread :: 2
oddThread :: 3
evenThread :: 4
oddThread :: 5
evenThread :: 6
@rishabhverma17
rishabhverma17 / Graph.java
Last active July 16, 2021 12:57
Graph Traversal (DFS/BFS) Using Adjacency Matrix
import java.util.LinkedList;
import java.util.Queue;
public class Graph {
public void printDFS(int[][] adj_mat){
int v = adj_mat.length;
boolean[] visited = new boolean[v];
for(int i=0; i<v; i++){
if(visited[i] == false){
@rishabhverma17
rishabhverma17 / LinkedList.java
Last active July 7, 2020 19:13
Linear Linked List operations Sample
public class LinkedList {
private ListNode head;
private int size = 0;
public void insertToHead(int data){
ListNode newNode = new ListNode(data);
if(head == null){
head = newNode;
size++;
return;
@rishabhverma17
rishabhverma17 / BreadthFirstSearch.java
Created December 28, 2019 16:09
Graph Using Adjacency List and Traversals(BFS and DFS)
package com.java.practice;
import java.util.*;
public class BreadthFirstSearch {
public Set<Integer> BFS (GraphAdjacencyList graph, int root){
Set<Integer> visited = new LinkedHashSet<>();
Queue<Integer> queue = new LinkedList<>();
queue.offer(root);
while(!queue.isEmpty()){
@rishabhverma17
rishabhverma17 / Main.java
Created December 20, 2019 17:02
Liinked List Code Snippets
package com.verma.rishabh;
public class Main {
public static void main(String[] args){
singlyMethodsTest();
SLL_Loop();
reverseTest();
checkPalindrome();
}
package com.verma.rishabh;
import java.util.ArrayList;
import java.util.Collections;
public class NextGreaterElementWithSameSet {
public ArrayList<Integer> returnNextGreatest(int[] num){
ArrayList<Integer> part1 = new ArrayList<>();
ArrayList<Integer> part2 = new ArrayList<>();
int arrayLen = num.length;
@rishabhverma17
rishabhverma17 / Singleton.java
Created December 14, 2019 02:03
Singleton Class in Java
package com.java.practice;
public class Singleton {
/*** Create a private Static variable of type Singleton */
private static Singleton singleton_instance = null;
String str;
/*** Mark the constructor as private */
@rishabhverma17
rishabhverma17 / Immutable.java
Created December 14, 2019 02:03
Immutable Class in Java
package com.java.practice;
/*
Immutable means : Once the object has been created, The object
state cannot be modified.
This Class Can be instantiated but cannot be extended.
*/
// Class available to all for instansiation(Communicaiton)