Join Regular Classroom : Visit ClassroomTech

interview coding questions

EY Welcomes Aspiring AI/ML Interns to Unlock the Future of -codewindow.in

/*! elementor – v3.16.0 – 20-09-2023 */ .elementor-column .elementor-spacer-inner{height:var(–spacer-size)}.e-con{–container-widget-width:100%}.e-con-inner>.elementor-widget-spacer,.e-con>.elementor-widget-spacer{width:var(–container-widget-width,var(–spacer-size));–align-self:var(–container-widget-align-self,initial);–flex-shrink:0}.e-con-inner>.elementor-widget-spacer>.elementor-widget-container,.e-con>.elementor-widget-spacer>.elementor-widget-container{height:100%;width:100%}.e-con-inner>.elementor-widget-spacer>.elementor-widget-container>.elementor-spacer,.e-con>.elementor-widget-spacer>.elementor-widget-container>.elementor-spacer{height:100%}.e-con-inner>.elementor-widget-spacer>.elementor-widget-container>.elementor-spacer>.elementor-spacer-inner,.e-con>.elementor-widget-spacer>.elementor-widget-container>.elementor-spacer>.elementor-spacer-inner{height:var(–container-widget-height,var(–spacer-size))}.e-con-inner>.elementor-widget-spacer.elementor-widget-empty,.e-con>.elementor-widget-spacer.elementor-widget-empty{position:relative;min-height:22px;min-width:22px}.e-con-inner>.elementor-widget-spacer.elementor-widget-empty .elementor-widget-empty-icon,.e-con>.elementor-widget-spacer.elementor-widget-empty .elementor-widget-empty-icon{position:absolute;top:0;bottom:0;left:0;right:0;margin:auto;padding:0;width:22px;height:22px} /*! elementor – v3.16.0 – 20-09-2023 */ .elementor-heading-title{padding:0;margin:0;line-height:1}.elementor-widget-heading .elementor-heading-title[class*=elementor-size-]>a{color:inherit;font-size:inherit;line-height:inherit}.elementor-widget-heading .elementor-heading-title.elementor-size-small{font-size:15px}.elementor-widget-heading .elementor-heading-title.elementor-size-medium{font-size:19px}.elementor-widget-heading .elementor-heading-title.elementor-size-large{font-size:29px}.elementor-widget-heading .elementor-heading-title.elementor-size-xl{font-size:39px}.elementor-widget-heading .elementor-heading-title.elementor-size-xxl{font-size:59px} Hot Topics /*! elementor – v3.16.0 – 20-09-2023 */ .elementor-widget-divider{–divider-border-style:none;–divider-border-width:1px;–divider-color:#0c0d0e;–divider-icon-size:20px;–divider-element-spacing:10px;–divider-pattern-height:24px;–divider-pattern-size:20px;–divider-pattern-url:none;–divider-pattern-repeat:repeat-x}.elementor-widget-divider .elementor-divider{display:flex}.elementor-widget-divider .elementor-divider__text{font-size:15px;line-height:1;max-width:95%}.elementor-widget-divider .elementor-divider__element{margin:0 var(–divider-element-spacing);flex-shrink:0}.elementor-widget-divider .elementor-icon{font-size:var(–divider-icon-size)}.elementor-widget-divider .elementor-divider-separator{display:flex;margin:0;direction:ltr}.elementor-widget-divider–view-line_icon .elementor-divider-separator,.elementor-widget-divider–view-line_text .elementor-divider-separator{align-items:center}.elementor-widget-divider–view-line_icon .elementor-divider-separator:after,.elementor-widget-divider–view-line_icon .elementor-divider-separator:before,.elementor-widget-divider–view-line_text .elementor-divider-separator:after,.elementor-widget-divider–view-line_text .elementor-divider-separator:before{display:block;content:””;border-bottom:0;flex-grow:1;border-top:var(–divider-border-width) var(–divider-border-style) var(–divider-color)}.elementor-widget-divider–element-align-left .elementor-divider .elementor-divider-separator>.elementor-divider__svg:first-of-type{flex-grow:0;flex-shrink:100}.elementor-widget-divider–element-align-left .elementor-divider-separator:before{content:none}.elementor-widget-divider–element-align-left .elementor-divider__element{margin-left:0}.elementor-widget-divider–element-align-right .elementor-divider .elementor-divider-separator>.elementor-divider__svg:last-of-type{flex-grow:0;flex-shrink:100}.elementor-widget-divider–element-align-right […]

EY Welcomes Aspiring AI/ML Interns to Unlock the Future of -codewindow.in Read More »

Latenview Analytics Overall Interview Questions + Coding Solutions – codewindow.in

Hot Topics Latenview Analytics Solution Technical Round Question 1 Reverse a string Answer Here’s a simple implementation of a reverse string algorithm in C: #include <stdio.h> #include <string.h> void reverse(char *str) { int len = strlen(str); int i; for (i = 0; i < len / 2; i++) { char temp = str[i]; str[i] =

Latenview Analytics Overall Interview Questions + Coding Solutions – codewindow.in Read More »

Adobe Overall Interview Questions + Coding Solutions – codewindow.in

Hot Topics Adobe Solution Technical Round Question 1 There is an array of size n which consists of any numbers from 1 to n .Find the numbers in the array which are appear more than once. Answer #include <stdio.h> void printDuplicates(int arr[], int n) { int i; int count[n]; // Initialize count array with 0

Adobe Overall Interview Questions + Coding Solutions – codewindow.in Read More »

Linkedin Overall Interview Questions + Coding Solutions- codewindow.in

Hot Topics Linkedin Solution Technical Round Question 1 Find the second largest element in a Binary Search Tree. Answer The second largest element in a Binary Search Tree can be found by traversing the tree in the following steps: Start by initializing a variable to store the current node, and set it to the root

Linkedin Overall Interview Questions + Coding Solutions- codewindow.in Read More »

Optum – Overall Interview Questions + Coding Solutions – codewindow.in

Hot Topics Optum Solution Technical Round Question 1 Data structure for finding all files under a drive. Answer For finding all files under a drive, a tree-like data structure can be used, where the root node represents the drive and each child node represents a subdirectory. The data structure can be implemented as a file

Optum – Overall Interview Questions + Coding Solutions – codewindow.in Read More »

Salesforce – Overall Interview Questions + Coding Solutions – codewindow.in

Hot Topics Salesforce Solution Technical Round Question 1 Reverse the words in a string. Answer #include <bits/stdc++.h> using namespace std; void reverseWords(string s){ vector<string> tmp; string str = ""; for (int i = 0; i < s.length(); i++) { if (s[i] == ‘ ‘) { tmp.push_back(str); str = ""; } else str += s[i]; }

Salesforce – Overall Interview Questions + Coding Solutions – codewindow.in Read More »

Flipkart – Overall Interview Questions + coding Solutions- codewindow.in

Hot Topics Filpkart Solution Technical Round Question 1 Find the second maximum element in an unsorted array of integers, using single for loop. Answer #include <iostream> using namespace std; int main() { int n; cin >> n; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } int first

Flipkart – Overall Interview Questions + coding Solutions- codewindow.in Read More »

Code Nation – Overall Interview Questions + coding Solutions – codewindow.in

Hot Topics Code Nation Solution Technical Round Question 1 You’re given a string that (may) be appended with a number at last. You need to find whether the length of string excluding that number is equal to that number. Answer You can check if a given string ends with a number and extract the number,

Code Nation – Overall Interview Questions + coding Solutions – codewindow.in Read More »

Bridgei2i Analytics – Overall Interview Questions + Coding Solutions – codewindow.in

Hot Topics Bridgei2i Analytics Solution Technical Round Question 1 (x-a).(x-b)…..(x-z)=? Answer The expression (x-a)(x-b) … (x-z) is the expanded form of a polynomial with degree equal to the number of terms, where each term is of the form (x-k) for some constant value “k”. The result of the expression would be a polynomial with degree

Bridgei2i Analytics – Overall Interview Questions + Coding Solutions – codewindow.in Read More »