Staticity’s gists

Staticity / StateSpacePath.java

Last active October 2, 2018 05:15

BFS and Recursive DFS for finding the path from 'start' to 'end' nodes.

Staticity / LevelOrderBFS.java

Last active September 11, 2015 18:07

Four ways to do Level Order BFS. They're ordered from worst (A) to best (D) based on Jaime's preferences.

Staticity / StateSpaceSearch.java

Last active June 9, 2023 04:35

Examples of Breadth-First Search (BFS) and Depth-First Search (DFS)

Staticity / StringBuildReverse.java

Created September 10, 2015 02:22

Example of StringBuilder's reverse() function.

	import java.util.*;

	public class StringBuildReverse
	{
	public static void main(String args[])
	{
	String s = "test";
	StringBuilder sb = new StringBuilder(s);
	StringBuilder sbR = sb.reverse();

Staticity / JavaExampleNextLine.java

Created September 9, 2015 20:54

	import java.util.Scanner;
	import java.util.List;

	public class Solution
	{
	public static void main(String args[])
	{
	// Construct a Scanner with the argument System.in to read from
	// standard input.
	Scanner scan = new Scanner(System.in);

Staticity / cpp_example.cpp

Last active September 1, 2015 14:21

How to perform IO for C++ in Codeforces.

	#include <iostream>

	// So I don't have to include "std::" every time...
	using namespace std;

	int main()
	{
	// Declare the variable you wish to read into...
	int apples;

Staticity / JavaExample.java

Created September 1, 2015 04:19

How to perform IO for Java in Codeforces.

	import java.util.Scanner;

	public class Solution
	{
	public static void main(String args[])
	{
	// Construct a Scanner with the argument System.in to read from
	// standard input.
	Scanner scan = new Scanner(System.in);

Staticity / rotated_sorted_array.cc

Created May 29, 2015 07:45

Rotated Sorted Array

	#include <iostream>
	#include <vector>

	using namespace std;

	class Solution {

	int find(vector<int>& nums, int start, int end, int target)
	{
	int lo = start, hi = end, mid;

Staticity / sudoku.cc

Created March 25, 2015 21:08

	bool safe(int grid[9][9], int row, int col)
	{
	for (int i = 0; i < 9; ++i)
	{
	if (i != col && grid[row][i] == grid[row][col])
	{
	return false;
	}
	}

Staticity / permutation_substring.cc

Created November 9, 2014 23:42

Given a list of characters, find shortest substring in a string that contains all of those characters.

	#include <iostream>
	#include <string>
	#include <vector>
	#include <map>
	#include <utility>
	#include <algorithm>

	using namespace std;

	void accumulateIndices(string container, string c, vector<int>& positions)

Jaime Rivera Staticity