GeeksforGeeks

?

Channel Reputation Rank

#59
?

Activity Status

Stale

last updated

According to the data and stats that were collected, 'GeeksforGeeks' channel has an outstanding rank. Despite such a rank, the feed was last updated more than a year ago. The channel mostly uses medium-length articles along with sentence constructions of the basic readability level, which is a result indicating a well-crafted news inventory on the channel.

About 'GeeksforGeeks' Channel

A computer science portal for geeks

? Updates History Monthly Yearly
? Content Ratio
? Average Article Length

Medium-length materials prevail on 'GeeksforGeeks' that may be an effective tactic to grip their readers’ attention with a wider range of helpful content. Moreover, short articles make up more than one third of the channel’s content.

short

long

? Readability Level

'GeeksforGeeks' mostly contains texts of a basic readability level which may show their aim to reach a wider audience. Besides, there are articles of intermediate readability, which make up more than one third of all content on the channel.

advanced

basic

? Sentiment Analysis

Neutral sentiment normally indicates an unbiased attitude that prevails in the channel’s articles (e.g. it may include some kind of scientific or professional materials).

positive

negative

Recent News

Unfortunately GeeksforGeeks has no news yet.

But you may check out related channels listed below.

Diagonal Sum of a Binary Tree

[...] lines of slope -1 passing between nodes (dotted lines in below diagram). Diagonal sum in a binary tree is sum of all node’s data lying between these lines. Given a Binary Tree, print all diagonal [...]

Bottom View of a Binary Tree

[...] Given a Binary Tree, we need to print the bottom view from left to right. A node x is there in output if x is the [...]

Find the closest leaf in a Binary Tree

[...] Given a Binary Tree and a key ‘k’, find distance of the closest leaf from ‘k’. Examples: A / \ B C / \ E F / \ G H / [...]

Remove nodes on root to leaf paths of length < K

[...] Given a Binary Tree and a number k, remove all nodes that lie only on root to leaf path(s) of length smaller than k. [...]

Brocade Interview Experience

[...] Recently I attended Brocade Communications Interview. I would like to share my experiences. First Round: Written round 15 Aptitude + 25 Technical MCQs (c++ (mainly output qs), 2 questions on socket, [...]

Red Hat Interview Experience | Set 1 (For Internship)

[...] online for the post of a Associate software Engineer Intern at Red hat, Bangalore. The first round was a written test round. We had nearly around 30 questions in aptitude as […] The post [...]

Subex Interview Experience

[...] i was interviewed for the position of Software Engineer(Fresher) in Bangalore. Round 1: In the first round there was some aptitude questions and one coding paper in which we have to write 2 Programs. [...]

Practo Placement Experience

[...] There were total 3 rounds. First Round: It was online coding round, conducted through hackerrank. There were total 6 questions, in [...]

D E Shaw Interview | Set 7 (Off Campus)

[...] My profile got selected after 1-2 months. The HR called me and told that they want to have a telephonic round which was scheduled after 4 days. Telephonic Round: (1 Hour) 1. Tell me something about [...]

Amazon Interview Experience | Set 160 (For SDE 2)

[...] Amazon sde2 experience: Telephonic round : Design a site similar to junglee.com. Assume you are given a crawler, design a distributed [...]

Synopsys Interview Experience | Set 2

[...] rounds minimum 3 puzzles were asked, listed down only algorithm and programming questions. Telephonic Round 1 1. Fibonacci sequence expecting DP solution and corner cases like […] The post Synopsys [...]

Cadence Interview Experience | Set 2

[...] my linkedin link as resume. I got a call within a week and was asked to give a telephonic round. Round 1 – Telephonic 1. Tell me about yourself 2. What is the difference between C [...]

Housing.com Interview Experience | Set 2

[...] through Career page 1st Round : Online Written Round Coding Round on Hackerrank . 4 Coding questions. 2 were easy , 1 medium and 1 difficult. In each interview , a link was shared where a [...]

MAQ Software Interview Experience | Set 6 (On-Campus)

[...] of the following rounds. Round 1: It comprised of general aptitude questions and two coding questions. It was an offline test. The coding questions were: 1. Given an array A[] consisting of 0’s, [...]

Snapdeal Interview Experience | Set 4 (On Campus)

[...] : Round 1: First round was online written round.It consists of 25 Questions. 22 MCQ’s and 3 Coding questions 1) Check for balanced parentheses in an expression. 2) Find next greater number with same [...]

Snapdeal Interview Experience | Set 5 (On Campus)

[...] 1: First round was online written round.It consists of 25 Questions. 22 MCQ’s and 3 Coding questions 1) Check for balanced parentheses in an expression. http://www.geeksforgeeks.org/check- [...]

UHG(United Health Group) Interview Experience

[...] profile. Written Aptitude Round: 60 min Contained basic logic based questions. 30 problems. Difficulty Level ->Medium Written Programming Round: 30 min 1) 15 multiple choice questions. Difficulty [...]

Athena Health Interview Experience | Set 2

[...] Round 1: 10 Aptitude questions with difficulty level hard. Round 2: 3 programs given. 1st one mandatory. 1) Replace wild cards with all possible [...]

Given a binary string, count number of substrings that start and end with 1.

[...] “1001”, “100101” and “101”. Source: Amazon Interview Experience | Set 162 Difficulty Level: Rookie We strongly recommend to minimize your browser and try this yourself [...]

Manacher’s Algorithm – Linear Time Longest Palindromic Substring – Part 2

In Manacher’s Algorithm – Part 1, we gone through some of the basics and LPS length array. Here we will see how to calculate LPS length array effi [...]

Manacher’s Algorithm – Linear Time Longest Palindromic Substring – Part 3

In Manacher’s Algorithm Part 1 and Part 2, we gone through some of the basics, understood LPS length array and how to calculate it efficiently based [...]

Manacher’s Algorithm – Linear Time Longest Palindromic Substring – Part 4

In Manacher’s Algorithm Part 1 and Part 2, we gone through some of the basics, understood LPS length array and how to calculate it efficiently based [...]

Snapdeal Interview Experience | Set 6 (On Campus)

[...] visited our campus recently, and here’s my interview experience! Written Round: 20 Aptitude Questions. 2 Coding Questions – 1. Given points of two lines A(x1,y1 x2,y2) & B(x3,y3 x4, [...]

Athena Health Interview Experience | Set 2

[...] Round 1: 10 Aptitude questions with difficulty level hard. Round 2: 3 programs given. 1st one mandatory. 1) Replace wild [...]

Subex Interview Experience

[...] of Software Engineer(Fresher) in Bangalore. Round 1: In the first round there was some aptitude questions and one coding paper in which we have to write 2 Programs. The Coding part was as follows: [...]

MAQ Software Interview Experience | Set 3

[...] an algorithm for dutch national flag problem 2. Write an algorithm for n-queens problem 3) Technical Round 1: 1. Horse Race puzzle 2. A circle is inscribed […] The post MAQ Software Interview [...]

Snapdeal interview experience | Set 3

[...] and one manager and one HR round. Last two rounds are just for normal discussion. Round 1: Technical round: 1:30 to 2 hour The interview start from […] The post Snapdeal interview experience | Set 3 [...]

Magic Bricks Interview Experience

[...] First Round: Ten MCQ and 1 coding question. Technical Round: 1) Array based questions. 2) How to find total number of tables in ur data base. 3) About [...]

Given a linked list of line segments, remove middle points

[...] be changed to following (0,10)->(7,10) | (7,5)->(40,5) The given linked list […] The post Given a linked list of line segments, remove middle points appeared first on GeeksforGeeks. [...]

Given a matrix of ‘O’ and ‘X’, find the largest subsquare surrounded by ‘X’

[...] matrices. Examples: Input: mat[N][N] = { {'X', 'O', 'X', 'X', 'X'}, {'X', […] The post Given a matrix of ‘O’ and ‘X’, find the largest subsquare surrounded by ‘X’ appeared first on [...]

Given a matrix of ‘O’ and ‘X’, replace ‘O’ with ‘X’ if surrounded by ‘X’

[...] and west of it. Examples: Input: mat[M][N] = {{'X', 'O', 'X', 'X', 'X', […] The post Given a matrix of ‘O’ and ‘X’, replace ‘O’ with ‘X’ if surrounded by ‘X’ appeared first on [...]

Amazon Interview Experience | Set 167 (SDE I for 1 year 6 months experience)

[...] Round1: Online Coding Round There were 4 coding question. Was asked to answer 2 out of 4. 1) Given a list of N coins, [...]

Works Applications Co., Ltd. Japan Interview | Set 2

[...] Here is the hiring process they followed (in my case): Round-1: (Online Coding Round) Question-1: Abstract An orienteering map is to be given in the following format. ######## # [...]

Practo Placement Experience

[...] There were total 3 rounds. First Round: It was online coding round, conducted through hackerrank. There were total 6 questions, in which every type of [...]

?Key Phrases
Diagonal Sum of a Binary Tree

[...] lines of slope -1 passing between nodes (dotted lines in below diagram). Diagonal sum in a binary tree is sum of all node’s data lying between these lines. Given a Binary Tree, print all diagonal [...]

Bottom View of a Binary Tree

[...] Given a Binary Tree, we need to print the bottom view from left to right. A node x is there in output if x is the [...]

Find the closest leaf in a Binary Tree

[...] Given a Binary Tree and a key ‘k’, find distance of the closest leaf from ‘k’. Examples: A / \ B C / \ E F / \ G H / [...]

Remove nodes on root to leaf paths of length < K

[...] Given a Binary Tree and a number k, remove all nodes that lie only on root to leaf path(s) of length smaller than k. [...]

Related channels