TheJobOverflow

Request Recent Questions Now!

Showing : Oracle • reset

10 Votes | 6 Replies

free-public-post Product Oracle OAs coding-round

6 Votes | 3 Replies

Oracle free-public-post coding-round on-campus

0 Votes | 0 Replies

interview mts oracle

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

oracle ocs interview

7 months ago

Nishant Agarwal • 0

6 Votes | 1 Reply

Oracle on-campus coding-round free-public-post

7 Votes | 3 Replies

free-public-post on-campus coding-round Oracle

1 Vote | 0 Replies

2.2 years ago

criminal • 10

2 Votes | 2 Replies

oracle coding-round free-public-post on-campus

0 Votes | 0 Replies

4 Votes | 1 Reply

Oracle free-public-post on-campus coding-round

10 Votes | 6 Replies

free-public-post on-campus Oracle coding-round

2 Votes | 1 Reply

free-public-post coding-round on-campus oracle

1 Vote | 1 Reply

coding-round on-campus free-public-post oracle

2 Votes | 1 Reply

oracle coding-round on-campus free-public-post

9 Votes | 4 Replies

on-campus coding-round oracle free-public-post

14 Votes | 4 Replies

oracle free-public-post on-campus coding-round

49 Votes | 8 Replies

coding-round oracle on-campus

7 Votes | 3 Replies

coding-round oracle

5 Votes | 6 Replies

coding-round Oracle on-campus

6 Votes | 3 Replies

coding-round Oracle on-campus

6 Votes | 3 Replies

Oracle free-public-post on-campus interview

4 Votes | 1 Reply

on-campus free-public-post oracle NITs coding-round

4 Votes | 0 Replies

oracle on-campus free-public-post

0 Votes | 0 Replies

oracle interview on-campus free-public-post

1 Vote | 1 Reply

Oracle OnCapmus free-public-post

5 Votes | 0 Replies

free-public-post Oracle interview on-campus

1 Vote | 0 Replies

sde1 oracle free-public-post on-campus interview

27 results • Page 1 of 1

Request Recent Questions Now!

Filter Posts by Company

Recent Replies

Answer: GOOGLE OA | SWE Internship 2023 | Triangles | Maximize Collection | 22nd July (S by Nihal Reddy • 0

def solve_op(): t = int(input()) for _ in range(t): n = int(input()) costs = list(map(int, input().split())) …

Answer: Google , Online Assessment Asked Question (VIT) | More Ones | Minimum Cost Path by Nihal Reddy • 0

def merge_count_inversions(arr, temp, left, mid, right): i = left j = mid + 1 k = left inv_count = 0 while…

Answer: DE Shaw, Online Assessment Test (IIIT Bhopal | SDET | FTE) | Smallest Sorted Arr by Nihal Reddy • 0

from collections import defaultdict, deque def getMinOperations(gnodes, kap, edges): adj = defaultdict(list) for u, v in edg…

Answer: DE Shaw, Online Assessment Test (IIIT Bhopal | SDET | FTE) | Smallest Sorted Arr by Nihal Reddy • 0

def getSmallestSortedArray(arr): n = len(arr) sarr = [str(x) for x in arr] res = [""] * n # last element res[-…

Answer: DE Shaw , Online Assessment | Array of N - Integers | Different Strings | NIT Su by Nihal Reddy • 0

#Sliding Window effective use def smallest_subarray_infinite(nums, target): total = sum(nums) n = len(nums) k = target // tot…

Answer: DE Shaw OA | BITS PILANI | SWE Internship | 30th July 2023 by Nihal Reddy • 0

Effective use

Answer: DE Shaw OA | BITS PILANI | SWE Internship | 30th July 2023 by Nihal Reddy • 0

#Q1 def smallest_subarray_infinite(arr, k): n = len(arr) total = sum(arr) prefix = {0: -1} curr, min_len = 0, float(…

Answer: GOOGLE OA | SWE Internship 2023 | Cost of Groups | Queries and Arrays | 22nd Ju by Suryanarayana Raju • 0

from collections import defaultdict, deque def solve(): t = int(input()) for _ in range(t): …

Comment: VISA, Summer Internship Interview Experience in NITs, 2023 by Anil Thungesh RK • 0

For the testcases that you gave , it still works with the greedy approach right? maybe the solution you said is for Minimising the sum of A…

Comment: Goldman Sachs OA | Bird Singing | Number Factors and Permutations | Summer Analy by Vishal NA • 0

// Solution for first problem #include<bits/stdc++.h> using namespace std; using ll = long long; const int mod = 7 * 24 * 60…

Answer: Goldman Sach Coding Round | SDE, London | 8th August 2020 by Vishal NA • 0

for question 11 correct answer is C option [x+(n-1)y]*(x-y)^n-1

Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Abhishek Tiwari • 0

K Closest: Output the k-closest integers in ascending order. Avoiding Landmines: Return the shortest path (minimum number …

Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Abhishek Tiwari • 0

Write coad K Closest: Output the k-closest integers in ascending order. Avoiding Landmines: Return the shortest path (minim…

Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Abhishek Tiwari • 0

K Closest: Output the k-closest integers in ascending order. Avoiding Landmines: Return the shortest path (minimum number of roads) …

Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Abhishek Tiwari • 0

K Closest: Output the k-closest integers in ascending order. Avoiding Landmines: Return the shortest path (minimum number of roads) …

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now

Top Problem Solvers

Claim your TJO hamper 🎁

Recent Votes

Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximum | Median Path | Prime Path

Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu

Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximum | Median Path | Prime Path

Answer: Nvidia, Recent Online Assessment Question | String Search | 2023

How to get Premium Access?

Answer: Uber OA (on campus) | 6 Month Intern

AlgoUniversity Technology Fellowship: Stage 2 || Important Questions

PhonePe | 9th October | Online Assessments

Answer: Question from my last OA, Infeneon

Answer: Question from my last OA, Infeneon

Recent Locations

Bengaluru, 2 minutes ago

Faridabad, 1 hour ago

Potreddipalli, 1 hour ago

New Delhi, 1 hour ago

Hyderabad, 2 hours ago

Recent Awards • All

Great Question to John 1.0k

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to John 1.0k

Popular Question to pillaisamarth • 30