Skip to content
Gblog Bi-Wizard School Coding Tournament By GeeksforGeeks – For Class 8-12 Students
Bi-Wizard School Coding Tournament by GeeksforGeeks – ‘Coding is the New Literacy’ and no one can deny this fact! And especially, when it comes to… Read More
Given a array, write a program to construct a triangle where last row contains elements of given array, every element of second last row contains… Read More
I find GeeksforGeeks very helpful! It helped me prepare for my FactSet interview. Here’s my interview experience for FactSet which came to my college for… Read More
MakeMyTrip recently visited our campus. There were 4 rounds. Online Round ( 1 Hour ) This round consisted of 20 aptitude questions and 3 coding… Read More
There were three rounds. Round 1. It was a written round, questions were from algorithms and DBMS 1) Find two rectangles overlap 2)Find the k-th… Read More
I recently had interviews with IBM INDIA-ISDL, Bangalore. Here is my Interview Experience. Round 1 IPAT Online Aptitude Test This online test is timed, with… Read More
I find GeeksforGeeks very helpful! It helped me prepare for my FactSet interview. Here’s my interview experience for FactSet which came to my college for… Read More
This test consisted of only one section i.e. PROGRAMMING, conducted on Hackerrank. Details: 1. Find the difference between maximum and minimum element such that the… Read More
Intuit came to our college campus for placements. Shortlisted 13 students after written and then selected 4 students for Full Time Job. There were 3… Read More
What is the time complexity of the below function? C++ void fun(int n, int k) {     for (int i = 1; i <= n; i++)… Read More
Recently, HP R&D visited our campus as part of recruitment drive. There was a CGPA cut off of 7.75 Profile offered: R&D engineer. Location: Bangalore.… Read More
Consider below two C language functions to compute sum of elements in a 2D array. Ignoring the compiler optimizations, which of the two is better… Read More
A number is a perfect number if is equal to sum of its proper divisors, that is, sum of its positive divisors excluding the number… Read More
A number is non-decreasing if every digit (except the first one) is greater than or equal to previous digit. For example, 223, 4455567, 899, are… Read More
Recently I applied to Barracuda Networks and following is my experience. Round 1: It was a 1 hour duration paper consisting of questions from C/Computer… Read More
Grofes came to our campus for software engineer profile full time hires. only CS and IT branches were eligible. There was 1 online round and… Read More

Start Your Coding Journey Now!