Bhushan Gawde bhushangawde

🎯

Focusing

woolpeeker / coco2yolo.py

Last active March 14, 2023 15:16

Convert other datasets to yolo format

SuryaPratapK / Vertical Order Traversal of a Binary Tree

Created August 10, 2020 17:32

	/**
	* Definition for a binary tree node.
	* struct TreeNode {
	* int val;
	* TreeNode *left;
	* TreeNode *right;
	* TreeNode() : val(0), left(nullptr), right(nullptr) {}
	* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
	* TreeNode(int x, TreeNode left, TreeNode right) : val(x), left(left), right(right) {}
	* };

SuryaPratapK / Single Number II

Created June 22, 2020 14:22

	class Solution {
	public:
	int singleNumber(vector<int>& nums) {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	//Using XOR + AND combination
	int ones = 0;
	int twos = 0;
	for(auto ele: nums)

SuryaPratapK / Range sum query Segment tree

Created February 8, 2020 16:14

	// C++ program to show segment tree operations like construction, query
	// and update
	#include <bits/stdc++.h>
	using namespace std;

	// A utility function to get the middle index from corner indexes.
	int getMid(int s, int e) { return s + (e -s)/2; }

	/* A recursive function to get the sum of values in the given range
	of the array. The following are parameters for this function.

babhishek21 / range_sum_query_mutable_leetcode.cpp

Last active May 23, 2023 16:21

Range Sum Query for Mutable Arrays using Segment Trees

	#include <bits/stdc++.h> // using GCC/G++11
	using namespace std;

	/**
	* Range Sum Query for Mutable Arrays using Segment Trees (LeetCode)
	* https://leetcode.com/problems/range-sum-query-mutable/
	*
	* Build a tree whose nodes represent the entire range. Its two children represent the two halves
	* of this range. This continues down the tree with height log(n) until we reach the n individual
	* leaves of the tree (each representing a single element).

rxaviers / gist:7360908

Last active March 20, 2026 18:16

Complete list of github markdown emoji markup

People