GeeksforGeeks
Enter a key term, phrase, name or location to get a selection of only relevant news from all RSS channels.
Enter a domain's or RSS channel's URL to read their news in a convenient way and get a complete analytics on this RSS feed.
Unfortunately GeeksforGeeks has no news yet.
But you may check out related channels listed below.
[...] 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 [...]
[...] 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 [...]
[...] Given a Binary Tree and a key ‘k’, find distance of the closest leaf from ‘k’. Examples: A / \ B C / \ E F / \ G H / [...]
[...] 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. [...]
[...] 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, [...]
[...] 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 [...]
[...] 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. [...]
[...] There were total 3 rounds. First Round: It was online coding round, conducted through hackerrank. There were total 6 questions, in [...]
[...] 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 sde2 experience: Telephonic round : Design a site similar to junglee.com. Assume you are given a crawler, design a distributed [...]
[...] 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 [...]
[...] 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 [...]
[...] 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 [...]
[...] 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, [...]
[...] : 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 [...]
[...] 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- [...]
[...] 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 [...]
[...] Round 1: 10 Aptitude questions with difficulty level hard. Round 2: 3 programs given. 1st one mandatory. 1) Replace wild cards with all possible [...]
[...] “1001”, “100101” and “101”. Source: Amazon Interview Experience | Set 162 Difficulty Level: Rookie We strongly recommend to minimize your browser and try this yourself [...]
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 [...]
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 [...]
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 [...]
[...] 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, [...]
[...] Round 1: 10 Aptitude questions with difficulty level hard. Round 2: 3 programs given. 1st one mandatory. 1) Replace wild [...]
[...] 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: [...]
[...] 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 [...]
[...] 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 [...]
[...] 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 [...]
[...] 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. [...]
[...] 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 [...]
[...] 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 [...]
[...] Round1: Online Coding Round There were 4 coding question. Was asked to answer 2 out of 4. 1) Given a list of N coins, [...]
[...] 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. ######## # [...]
[...] 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 [...]
[...] 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 [...]
[...] 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 [...]
[...] Given a Binary Tree and a key ‘k’, find distance of the closest leaf from ‘k’. Examples: A / \ B C / \ E F / \ G H / [...]
[...] 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
-
Ritambhara Technologies
Coding / System Design Interviews
-
Ubergizmo
Opinionated news and reviews of consumer electronics
-
Recent Questions - Software Engineering Stack Exchange
most recent 30 from softwareengineering.stackexchange.com
-
PeoplePerHour.com freelance projects, jobs, work
Find freelance jobs, freelance work and freelance projects
- Gregor Ulm