GeeksforGeeks - RSS Feed

A computer science portal for geeks

Latest articles

How to Write a Strong Resume For Working Professionals?

In today’s job market, competition is going so high that only the A++ level resume parse through the ATS and goes right into the recruiter’s… Read More The post How to Write a Strong Resume For Working Professionals? appeared first on GeeksforGeeks.

Deloitte USI Interview Experience for Business Technology Analyst (On-Campus) 2021

Deloitte USI visited our campus for three roles: Analyst, Business Technology Analyst, and Risk and Financial Advisory. Around 150 students had applied for the role… Read More The post Deloitte USI Interview Experience for Business Technology Analyst (On-Campus) 2021 appeared first on GeeksforGeeks.

Tech Mahindra Interview Experience for Full Stack Developer (Fresher)

I gave this contest on HackerEarth and there were 2 questions that were of medium-hard difficulty. I was able to solve only 1 question after… Read More The post Tech Mahindra Interview Experience for Full Stack Developer (Fresher) appeared first on GeeksforGeeks.

Amazon Interview Experience SDE-2 (3 Years Experienced)

I was interviewed at Amazon Bengaluru for SDE 2 role. Round 1 (Online Test, Hackerrank): Doesn’t Remember the questions. But one was easy and the… Read More The post Amazon Interview Experience SDE-2 (3 Years Experienced) appeared first on GeeksforGeeks.

Check if last index can be reached by jumping atmost jump[i] in each position

Given an array of jumps[] of length N, where each element denotes the maximum length of a jump forward from each index. The task is… Read More The post Check if last index can be reached by jumping atmost jump[i] in each position appeared first on GeeksforGeeks.

Prove that Sparse Graph is NP-Complete

Prerequisite: NP-Completeness, NP Class, Sparse Graph, Independent Set Problem: Given graph G = (V, E) and two integers a and b. A set of a… Read More The post Prove that Sparse Graph is NP-Complete appeared first on GeeksforGeeks.

How to get largest and smallest number in an Array?

Given an array arr[] of length N, The task is to find the maximum and the minimum number in the array. Examples: Input: arr[] =… Read More The post How to get largest and smallest number in an Array? appeared first on GeeksforGeeks.

Difference between Brute Force and Dynamic Programming

Brute Force: It gives a solution to a problem by using the most straightforward method. However, it is typically not a very optimal solution or… Read More The post Difference between Brute Force and Dynamic Programming appeared first on GeeksforGeeks.

Perfect Binary Tree

What is a Perfect Binary Tree? A perfect Binary Tree is a binary tree in which each of the internal nodes has exactly two child… Read More The post Perfect Binary Tree appeared first on GeeksforGeeks.

Find two integers such that at least one exists in each given Pair

Given N pairs of integers, each integer is between 1 to M, the task is to check if there exist two integers x and y… Read More The post Find two integers such that at least one exists in each given Pair appeared first on GeeksforGeeks.

Discover, share and read the best on the web

Follow RSS Feeds, Blogs, Podcasts, Twitter searches, Facebook pages, even Email Newsletters! Get unfiltered news feeds or filter them to your liking.

Get Inoreader
Inoreader - Follow RSS Feeds, Blogs, Podcasts, Twitter searches, Facebook pages, even Email Newsletters!