"Caliber isn't claimed; it's conquered."
Master Algorithms.Win Competitions.
Join thousands of developers sharpening their skills on a platform built for speed, precision, and fair competition. No fluff, just code.
two_sum.py
Accepted4ms
def two_sum(nums, target):
seen = {}
for i, num in enumerate(nums):
if target - num in seen:
return [seen[target-num], i]
seen[num] = iPython
binary_search.cpp
Accepted2ms
int binarySearch(vector<int>& arr, int target) {
int left = 0, right = arr.size() - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (arr[mid] == target) return mid;
arr[mid] < target ? left = mid + 1 : right = mid - 1;
}
return -1;
}C++
merge_sort.java
Accepted8ms
void mergeSort(int[] arr, int l, int r) {
if (l < r) {
int m = l + (r - l) / 2;
mergeSort(arr, l, m);
mergeSort(arr, m + 1, r);
merge(arr, l, m, r);
}
}Java
dfs.js
Accepted5ms
function dfs(graph, node, visited = new Set()) {
if (visited.has(node)) return;
visited.add(node);
console.log(node);
for (const neighbor of graph[node]) {
dfs(graph, neighbor, visited);
}
}JavaScript
dp_fibonacci.rs
Accepted1ms
fn fibonacci(n: usize) -> u64 {
let mut dp = vec![0u64; n + 1];
dp[1] = 1;
for i in 2..=n {
dp[i] = dp[i-1] + dp[i-2];
}
dp[n]
}Rust
quick_sort.go
Accepted3ms
func quickSort(arr []int, low, high int) {
if low < high {
pi := partition(arr, low, high)
quickSort(arr, low, pi-1)
quickSort(arr, pi+1, high)
}
}Go
two_sum.py
Accepted4ms
def two_sum(nums, target):
seen = {}
for i, num in enumerate(nums):
if target - num in seen:
return [seen[target-num], i]
seen[num] = iPython
binary_search.cpp
Accepted2ms
int binarySearch(vector<int>& arr, int target) {
int left = 0, right = arr.size() - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (arr[mid] == target) return mid;
arr[mid] < target ? left = mid + 1 : right = mid - 1;
}
return -1;
}C++
merge_sort.java
Accepted8ms
void mergeSort(int[] arr, int l, int r) {
if (l < r) {
int m = l + (r - l) / 2;
mergeSort(arr, l, m);
mergeSort(arr, m + 1, r);
merge(arr, l, m, r);
}
}Java
dfs.js
Accepted5ms
function dfs(graph, node, visited = new Set()) {
if (visited.has(node)) return;
visited.add(node);
console.log(node);
for (const neighbor of graph[node]) {
dfs(graph, neighbor, visited);
}
}JavaScript
dp_fibonacci.rs
Accepted1ms
fn fibonacci(n: usize) -> u64 {
let mut dp = vec![0u64; n + 1];
dp[1] = 1;
for i in 2..=n {
dp[i] = dp[i-1] + dp[i-2];
}
dp[n]
}Rust
quick_sort.go
Accepted3ms
func quickSort(arr []int, low, high int) {
if low < high {
pi := partition(arr, low, high)
quickSort(arr, low, pi-1)
quickSort(arr, pi+1, high)
}
}Go
Solve problems in Python, C++, Java, JavaScript, Rust, Go and more
Trusted by engineers at
leading tech companies
Get In Touch
CONTACT
OUR TEAM
Have questions? We'd love to hear from you. Send us a message and we'll respond as soon as possible.
General Inquiry
Questions about SHASTRA platform
Enterprise
Solutions for teams & companies
Partnerships
Collaboration opportunities
Or reach us directly
tcetshastra@gmail.com