Skip to content

Instantly share code, notes, and snippets.

View hocyadav's full-sized avatar
😌
Working from home

Hariom Yadav hocyadav

😌
Working from home
View GitHub Profile
@hocyadav
hocyadav / Stack_ArrayImplementation.java
Created October 24, 2019 08:42
Stack implementation using array
package datastructure;
/**
*
* @author yadha02
*
*/
public class Stack_ArrayImplementation {
//declare global variable
static int stackSize = 11;
static int[] stack = new int[stackSize];
@hocyadav
hocyadav / Rajat.java
Created October 26, 2019 13:46
First half element in array are descending order and remaining are in ascending order : find the index where ascending order start
public class Rajat {
static int fun(int[] ary, int l, int r) {
int mid = l + (r-l+1)/2;
if(ary[mid-1]>ary[mid] && ary[mid] < ary[mid+1]) {//found index
return mid;
}
if(ary[mid-1]>ary[mid] && ary[mid] > ary[mid+1]) {//go right
return fun(ary, mid, r);
}
@hocyadav
hocyadav / Stack_Reverse_usingRecursion.java
Created November 2, 2019 18:46
Reverse stack using recursion : 1st insert at bottom of stack method, 2nd function call stack concept used
/**
*
* @author Hariom Yadav - Nov 3, 2019
*
*/
class Stack1{
//know something
int top;
int size;
String[] stack;
@hocyadav
hocyadav / Heap_BuildHeap_heapifyMin_Max_Delete.java
Last active November 9, 2019 16:58
Heap : build max , min heap, delete root/1st node , print
package ds9thNovNight;
/**
*
* @author Hariom Yadav - Nov 9, 2019
*build max heap from array, build min heap, delete root node i.e. delete 1st node and internally calls heapify (min or max)
*/
//data structure used is array
public class Heap_BuildHeap_heapifyMin_Max_Delete {
public static void main(String[] args) {
int[] arr = {12,1,3,34,9,5};
@hocyadav
hocyadav / BST_search_insert_delete_print.java
Created November 9, 2019 16:56
BST : search, insert, delete , print DFS BFS (level order traversal)
package ds9thNovNight;
/**
*
* @author Hariom Yadav - Nov 9, 2019
*
*/
//Data structure
class Node{
//know something
int data;
@hocyadav
hocyadav / Heap_insert.java
Created November 10, 2019 08:49
Heap insert : using Vector as dynamic array
package ds_10th_Nov;
import java.util.Vector;
/**
*
* @author Hariom Yadav - Nov 10, 2019
*
*/
public class Heap_insert {
static final int MAX = 1000;
@hocyadav
hocyadav / LruCacheImpl.java
Created November 23, 2019 02:32
LRU cache implementation using DQueue, data structure used : deque + set
package ds_collection_n_LRU_23rd_nov;
import java.util.Deque;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedList;
/**
*
* @author Hariom Yadav - Nov 23, 2019
*
@hocyadav
hocyadav / ASL
Created September 21, 2020 12:28 — forked from djg07/ASL
{
"Comment": "A simple AWS Step Functions state machine that automates a call center support session.",
"StartAt": "ProcessTransaction",
"States": {
"ProcessTransaction": {
"Type" : "Choice",
"Choices": [
{
"Variable": "$.TransactionType",
"StringEquals": "PURCHASE",
{
"Comment":"Transaction Processor State Machine Using SQS",
"StartAt":"ProcessTransaction",
"States":{
"ProcessTransaction":{
"Type":"Pass",
"Next":"BroadcastToSqs"
},
"BroadcastToSqs":{
"Type":"Task",
@hocyadav
hocyadav / console.sql
Last active March 13, 2021 02:50
important sql query
select * from movies;
-- create table + insert data + drop delete table
create table emp(
id int primary key auto_increment,
depid int default 1,
salary float default 0,
name varchar(5) not null
);
insert into emp(depid, salary, name)