Update appNew update is available. Click here to update.

Public Discussion

All discussions

Interview problems

Interview experiences

Contests and hackathons

Careers and placements

Guides and resources

General discussion

Support and feedback

AMA

Post a new discussion

Ninja Tip!

Descriptive titles get more views and replies. For eg. 'How do you prepare for data structures?' instead of 'data structures'

Add Tags
All discussions

Recent Posts

Top Posts

All tags
DevTown Interview Experience | SDE - 1 | Fresher | Nov 2022 | Off Campus
Interview experiences

Hey, I have shared my campus interview experience with DevTown for SDE - 1.


Hope this helps!


Interview experience link with approach


Number of rounds: 2


Round 1: Face to Face (1 problem | 60 Minutes)


Round 2: Online Coding Interview (1 problem | 70 minutes)


profile
Codestudio
Published On 24-Sep-2023
0 views
1 replies
0 upvotes
SASI Institute of Technology & Engineering x Python Language Coding Contest | 23 Sep, 2023 | Post Contest Discussion
Contests and hackathons

Hey Ninjas!

This is a post to ask doubts and share your logic for solving questions from SASI Institute of Technology & Engineering x Python Language Coding Contest! ūüėĄ

If you face any issues during the contest, do let us know by replying below. ‚úĆÔłŹ

How was your experience in the contest or got any feedback? Let us know here (link)

profile
Codestudio
Published On 24-Sep-2023
13 views
0 replies
0 upvotes
Nagarro Interview Experience | SDE - Intern | Fresher | Oct 2021 | On Campus
Interview experiences

Hey, I have shared my campus interview experience with Nagarro for SDE - Intern.


Hope this helps!


Interview experience link with approach


Number of rounds: 2


Round 1: Video Call (1 problem | 25 minutes)


Round 2: Online Coding Interview (3 problems | 90 minutes)


profile
SAHIL VERMA
Published On 24-Sep-2023
2 views
1 replies
0 upvotes
CodeStudio Library | Rearrange Positive and negative numbers in O(n) time and O(1) extra space
Guides and resources
In this article, we will discuss a very interesting problem, in which we have to rearrange the positive and negative numbers such that they will occupy alternate positions, and all extra positive or negative elements will be put an end.
Read Full Article: https://www.codingninjas.com/studio/library/rearrange-positive-and-negative-numbers-in-on-time-and-o1-extra-space
profile
Vaibhav Agarwal
Published On 24-Sep-2023
0 views
1 replies
0 upvotes
Count Leaf Nodes || Easiest Method - Beats 99% ūüĒ• || C++ ūüďĆ
Careers and placements

 

void inorder(BinaryTreeNode<int>* root, int &count) {

    if (root == NULL) {

        return;

    }

    inorder(root->left, count);

 

    // Leaf Node:

    if(root->left == NULL && root->right == NULL){

        count++;

    }

 

    inorder(root->right, count);

}

 

int noOfLeafNodes(BinaryTreeNode<int> *root){

    int count = 0;

    inorder(root, count);

    return count;

}

profile
Suraj10Pratap
Published On 24-Sep-2023
1 views
0 replies
1 upvotes
Delloitte Interview Experience | Analyst | Fresher | Sep 2021 | On Campus
Interview experiences

Hey, I have shared my campus interview experience with Delloitte for Analyst.


Hope this helps!


Interview experience link with approach


Number of rounds: 3


Round 1: Online Coding Interview (1 problem | 75 minutes)


Round 2: HR Round (1 problem | 20 minutes)

  • Basic HR Questions

Round 3: Video Call (2 problems | 45 minutes)


profile
Pratham Gupta
Published On 24-Sep-2023
2 views
1 replies
0 upvotes
SASI Institute of Technology & Engineering x C++ Language Coding Contest | 23 Sep, 2023 | Post Contest Discussion
Contests and hackathons

Hey Ninjas!

This is a post to ask doubts and share your logic for solving questions from SASI Institute of Technology & Engineering x C++ Language Coding Contest! ūüėĄ

If you face any issues during the contest, do let us know by replying below. ‚úĆÔłŹ

How was your experience in the contest or got any feedback? Let us know here (link)

profile
Codestudio
Published On 24-Sep-2023
64 views
0 replies
0 upvotes
Post Order Traversal || Easiest Approach || C++ ūüďĆ
Careers and placements

void postorder(TreeNode* root, vector<int> &ans) {

    if (root == NULL) {

        return;

    }

    postorder(root->left, ans);

    postorder(root->right, ans);

    ans.push_back(root->data);

}

vector<int> postorderTraversal(TreeNode* root)

{

    vector<int> ans;

    postorder(root, ans);

    return ans;

}

profile
Suraj10Pratap
Published On 24-Sep-2023
3 views
0 replies
1 upvotes
+27639132907 SWAZILAND POWERFULL SANDAWANA OIL FOR MONEY,BOOST BUSINESS,INCOME INCREASE IN BOTSWANA
Interview experiences

DUBAI POWERFULL 100%  SANDAWANA OIL FOR MONEY, BOOST BUSINESS +27639132907 CUSTOMER ATTRACTION, INCOME INCREASE,JOB PROMOTION,STOP BAD LUCK ,FOR CHURCH LEADERS TO GET CHURCH POWER, WIN COURT CASES,PASS EXAMS, BRING BACK LOST LOVER,STOP BAD LUCK,,SALARY INCREASE , WIN TANDERS,WIN COURT CASES,WIN LOTTO,CASINO,POWERBALL IN DUBAI,KUWAIT,BOTSWANA,SOUTH AFRICA,USA,CANADA,UK,AUSTRALIA #oil #business #dubai #leaders #canada #power #power #money #job #southafrica

profile
Mama Bweza
Published On 23-Sep-2023
1 views
0 replies
0 upvotes
Level Order Traversal || Best Approach || C++ SolutionūüďĆ
Interview problems

#include <bits/stdc++.h>  /************************************************************

   Following is the BinaryTreeNode class structure

   template <typename T>    class BinaryTreeNode {       public:        T val;        BinaryTreeNode<T> *left;        BinaryTreeNode<T> *right;

       BinaryTreeNode(T val) {            this->val = val;            left = NULL;            right = NULL;        }    };

************************************************************/ vector<int> getLevelOrder(BinaryTreeNode<int> *root) {    vector<int> result; // To store the level order traversal    if (root == nullptr) {        return result; // Return an empty vector for an empty tree    }

   queue<BinaryTreeNode<int>*> q;    q.push(root);

   while (!q.empty()) {        int levelSize = q.size(); // Number of nodes at the current level        for (int i = 0; i < levelSize; i++) {            BinaryTreeNode<int>* temp = q.front();            q.pop();            result.push_back(temp->val); // Add the node's value to the result

           if (temp->left) {                q.push(temp->left);            }            if (temp->right) {                q.push(temp->right);            }        }    }

   return result; // Return the level order traversal result }  

profile
Suraj10Pratap
Published On 23-Sep-2023
21 views
0 replies
1 upvotes