This page provides necessary resources for individuals who are preparing for Coriolis Technologies . Here, you can access a comprehensive collection of Coriolis Technologies similar coding questions and answers commonly used in online assessments and technical interviews.
Along with coding questions, you can also find relevant information about the company’s job profiles, job locations, offered CTC , and the steps involved in their hiring process. By utilizing these resources, you can gain valuable insights and prepare effectively for your upcoming Coriolis Technologies Interview .
About Coriolis Technologies
Coriolis Technologies is a data intelligence company that provides advanced analytical solutions to help clients make better decisions based on data-driven insights. The company specializes in data acquisition, management, analysis, and visualization to help clients navigate complex and rapidly changing global markets.
Coriolis Technologies leverages cutting-edge technology and expert analysis to provide clients with comprehensive insights across a wide range of industries, including finance, energy, and commodities. The company’s platform allows clients to access real-time data, historical data, and predictive analytics, all in one place.
With headquarters in London and offices in New York and Singapore, Coriolis Technologies serves clients globally, including banks, hedge funds, and commodity traders. The company is committed to providing its clients with actionable intelligence and helping them navigate the complexities of today’s global markets.
About Coriolis Technologies Recruitment Process
The Coriolis Technologies Recruitment Process consists of the following steps :
Coding assessment
Technical Interview 1
Technical Interview 2
Final Interview/HR Interview
We have mentioned further details of the Coriolis Technologies Recruitment Process in the following Tabular Form
Coriolis Technologies has openings for fresher candidates for the Software Engineer position. Interested candidates having Bachelor’s degree in information technology, Computer Science or equivalent and are Freshers or have under 2 years of experience in software engineering field can apply.
Skills and Abilities
Good programming and logical skills in any language such as C, C++, Java, python,
Angular, React etc.
Understanding of Object-Oriented concepts, data structures, algorithms and
operating systems.
Good troubleshooting and debugging skills.
Good Linux/UNIX skills.
Passion for solid software engineering practices.
Should be self-driven.
Excellent communications skills, both verbal and written (English).
Willingness to proactively interact with the team to achieve results.
Strong team player.
Ability to think out of the box and to work with minimal direction.
Ready to learn new technologies quickly and use them in real-world situations.
Important NoteCoriolis Technologies offers 5-7 Lacs INR annual CTC depending on performance during internship period .
Coriolis Technologies Coding Questions and Answers
Question 1 : Game Of Clicks
Problem Statement :
Sahil watches TV all day and gets bored. He started playing this dumb game of identifying minimum number of inputs needed to reach a channel. As his cousin, you have to help him, but you live far from his house. So you decide to write a code that will ask Sahil for some inputs and give outputs respectively.
Here are the problems you need to keep in mind :
There are 13 buttons on his remote: 10 buttons for the numbers (0-9) to form integers denoting respective channel index, “Up channel” button and “ Down channel” button for going i +1th channel and i-1th channel from i respectively, and a “Last viewed” button to see what’s the last channel before it.
The number buttons allow you to jump directly to a specific channel (Ex: to go to channel 172 by typing 1,7,2).
If the channel which you are in is ith and that is the max channel index possible, by Up channel, you will reach the first channel possible. Same goes for the down channel button. You can go to the highest channel possible if you go down from the lowest channel possible.
Sahil can get from one channel to the next in one of the two ways.
Sahil’s parents have set some parental control on some channels on Aniruth’s television. The “Up Channel “ and “Down buttons” buttons skip these channels as these channels are not viewable.
Given a list of channels to view, the lowest channel, the highest channel, and a list of blocked channels, your program should return the minimum number of clicks necessary to get through all the shows that Anirudh would like to match.
Input Format :
First line is the lowest Channel
Second-line is the highest Channel
Followed by a number of blocked channels B, and the next B lines contain the actual blocked channels.
Followed by the number of Channels to view V, and the next V lines contain the actual channels to view.
Constraints :
The lowest channel on the television will be greater than 0. and less than or equal to 10,000.
The highest channel on the television will be greater than or equal to the lowest channel. and less than or equal to 10.000.
The list of channels that are blocked on Anirudh’s television. All the channels in this list will be valid channels (greater than or equal to lowest channel, less than or equal 1 to highest channel). Duplicates may be Ignored. The blocked list can be a maximum of 40 channels.
The sequence that Sahil must view contains between 1 and 50 elements. inclusive. All channels in this sequence are not in the blocked list and are between lowest channel and highest channel. Inclusive.
import java.util.*;
public class Main
{
public static void main (String[]args)
{
Scanner sc = new Scanner (System.in);
int l = sc.nextInt ();
int h = sc.nextInt ();
int b = sc.nextInt ();
List < Integer > bl = new ArrayList < >();
for (int i = 0; i < b; i++)
{
bl.add (sc.nextInt ());
}
int v = sc.nextInt ();
List < Integer > vl = new ArrayList < >();
for (int i = 0; i < v; i++)
{
vl.add (sc.nextInt ());
}
Set < Integer > sl = new HashSet < >();
int res = 0;
for (Integer i:vl)
{
if (bl.contains (i))
continue;
sl.add (i);
}
for (Integer i:sl)
{
String s = i + "";
res += s.length ();
}
System.out.println (res);
}
}
def prev(now, l, h, blocked):
if now != l:
if (now - 1) not in blocked:
return now - 1
else:
return prev(now - 1, l, h, blocked)
else:
if h not in blocked:
return h
else:
return prev(h, l, h, blocked)
def next(now, l, h, blocked):
if now != h:
if (now + 1) not in blocked:
return now + 1
else:
return next(now + 1, l, h, blocked)
else:
if l not in blocked:
return l
else:
return next(l, l, h, blocked)
def digits(n):
count = 0
while n > 0:
n = n // 10
count += 1
return count
for i in range(2):
if i == 0:
l = int(input())
else:
h = int(input())
b = int(input())
blocked = []
for i in range(b):
blocked.append(int(input()))
back = -1
now = -1
c = int(input())
k = 0
for i in range(c):
n = int(input())
n1 = digits(n)
if now == -1:
now = n
k += n1
continue
if back == n:
k += 1
back, now = now, back
continue
pf = 0
pb = 0
now1 = now
prev1 = now
for j in range(n1):
if j == (n1 - 1):
pf = n1
pb = n1
break
else:
now1 = next(now1, l, h, blocked)
pf += 1
prev1 = prev(prev1, l, h, blocked)
pb += 1
if now1 == n:
break
if prev1 == n:
break
k += pf
back = now
now = n
print(k)
Question 2 : Last student’s ID
Problem Statement :
There is an id code that is supposed to be given to all the aspirants of an exam. It is actually a substring of a given string. That means, the authority takes a string and then assigns all the unique substrings to all the students. Suppose there is a string “abcde”, so the ids of the students will be “a”,”b”,”c”,”d”,”e”,’ab”,”abc”,”abcd”,”abcde”,”bc”,”bcd”,”bcde”,”cd”,”cde”,”de”.
The students are standing in a line according to the lexicographic order of their given ids. You have to find out the id of the last student for the given input string from which the ids are generated.
Input Format: Single line with the id generating string Output format: The last id as per lexicographical order
Constraints: Number of characters in the string<=10^9
Sample Input: abdc
Sample output: dc
Explanation: The last student will be with the id dc. The order will be abdc a ab abd abdc b bd bdc c d dc
s = input()
j = 1
c = 0
while j < len(s):
if ord(s[c]) < ord(s[j]):
c = j
j += 1
print(s[c:])
Question 3 : Minimum Occurrence
Problem Statement : Given a sting , return the character that appears the minimum number of times in the string. The string will contain only ascii characters, from the ranges (“a”-”z”,”A”-”Z”,0-9), and case matters . If there is a tie in the minimum number of times a character appears in the string return the character that appears first in the string.
Input Format: Single line with no space denoting the input string.
Output Format: Single character denoting the least frequent character.
Constraints: Length of string <=10^6
Sample Input: cdadcda
Sample Output: c
Explanation: C and A both are with minimum frequency. So c is the answer because it comes first with less index.
s=input()
ans=[]
for i in s:
ans.append(s.count(i))
print(s[ans.index(min(ans))])
Question 2 : Find the homeless
Problem Statement -: There are N Homeless people in the community and N houses in the community. It will be given in the array (people) , height of the person and in the array house capacity of the house is given.
Government decided to give homes for people on the basis of following conditions:
Priority is given for the people from left to right of the array
Each person is allotted to a house if and only if the capacity of house is greater than or equal to persons height
Nearby empty Houses are alloted to the person( starting from extreme left)
You need to find the number of homeless people who have not allotted any home if the government follows the above conditions.So that government will have an idea for how many people they need to allot home for next time.
Constraints:
1 <= N <= 10^3
1 <= people[i] <= 10^5
1 <= house[i] <= 10^5
Input Format for Custom Testing:
The first line contains an integer, N, denoting the number of people and number of houses.
Each line i of the N subsequent lines (where 0 <= i <= N) contains an integer describing peoplei.
Each line i of the N subsequent lines (where 0 <= i <= N) contains an integer describing housei.
Sample Test Cases
Sample Input 1 3 4 2 7 3 5 10
Sample Output 1 0
Explanation people=[4,2,7] house=[3,5,10] People[0] has more priority , from left to right order in houses 5 is the nearest one which fits for people[0] people[1]=2 will fit in 3 which is nearer from left people[2]=7 will fit in remaining house of capacity of 10 So no homeless people left so return 0
Sample Input 2 3 3 8 5 1 9 4
Sample Output 2 2
Explanation people=[3,8,5] house=[1,9,4] people[0]=3 can fit in 9 which is nearest from left in array house people[1]=8 cannot fit in any home which is left (i.e, 1 and 4) people[2]=5 cannot fit in any home which is left (i.e, 1 and 4) So return 2,which is number of homeless people
N=int(input())
people=[]
house=[]
#to read data of people and house arrays
for i in range(N): people.append(int(input()))
for i in range(N): house.append(int(input()))
count=0
for i in range(N):
for j in range(N):
if(people[i] < house[j]):
count+=1
house[j]=-1
break
print(N-count)
Question 5 : Choco and chocolate
Problem Statement :
Choco, a chocolate lover, has N amount of money with him. He wants to buy as much chocolate as possible. So, he goes to a chocolate shop “Bandyman ”. Mike, the owner of “Bandyman ” has different types of chocolate in his store (represented by a character) placed in a row.
Mike, give an offer to Choco that he can buy a selected type of chocolate for free and need to pay for the other types of chocolates and Choco can only buy consecutive chocolates.
Now, you need to write a code to find the maximum amount of chocolates Choco can get by selecting the chocolates optimally.
Input format :
1st line contains 2 space separated integers A and B denoting the number of chocolates and the amount of money Choco has.
The 2nd line contains A chocolates represented by a string. All chocolates represented by lowercase alphabets.
The 3rd line represents 26 space separated integers representing the cost to buy the chocolates. [First integer represents the cost of the chocolate of type ‘a’, 2nd integer represents the cost of the chocolates of type ‘b’ and so on]
Output format : Print the maximum number of chocolates Choco can buy.
Constraints : 1<=A<=10^5 1<=B<=10^9 1<=cost of chocolate<=10^9
Choco can select the chocolate of type ‘a’ for free and start buying from index 0 and if he buys “aabc” then he has to pay less (0+0+4+4=8) than the total money he has.
This is the maximum number of chocolates he can get in this case.
#include<bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
string s, s1;
cin >> s;
cin.ignore();
getline(cin, s1);
istringstream ss(s1);
vector < int > a;
vector < char > a1;
while (ss) {
string w;
ss >> w;
if (w == "") break;
a.push_back(stoi(w));
}
map < char, int > mm;
for (auto i: s)
if (mm[i] == 0) {
mm[i]++;
a1.push_back(i);
}
int t = 0;
for (auto i: a1) {
vector < int > a2;
for (auto i1: s) {
if (i1 == i) a2.push_back(0);
else a2.push_back(a[i1 - 97]);
}
int l = 0, su = 0;
for (int i2 = 0; i2 < n; i2++) { if (l == i2) su += a2[i2]; else su += a2[i2]; if (su > m) {
while (su > m && l <= i2) { su -= a2[l]; l++; } } if (i2 - l + 1 > t) t = i2 - l + 1;
}
}
cout << t;
}
n, m = map(int, input().split())
s = input().strip()
a = list(map(int, input().split()))
s1 = set()
for i in s:
if i not in s1:
s1.add(i)
s1 = list(s1)
t = 0
for i in s1:
a1 = []
for i1 in s:
if i1 == i:
a1.append(0)
else:
a1.append(a[ord(i1) - 97])
l = 0
su = 0
for i2 in range(n):
if l == i2:
su = a1[i2]
else:
su += a1[i2]
if su > m:
while su > m and l <= i2: su -= a1[l] l += 1 if (i2 - l + 1) > t:
t = i2 - l + 1
print(t)
FAQs related to Coriolis Technologies Coding Questions
Question 1: How many rounds are there in Coriolis Technologies Hiring Process?
There are in total four rounds in the Coriolis Technologies Hiring Process which includes:-
Coding assessment
Technical Interview 1
Technical Interview 2
Final Interview/HR Interview
Question 2: Is Coding questions asked in Coriolis Technologies Recruitment Process?
Yes, Coding Questions are included in Online Assessment and Technical Interview of Coriolis Technologies .
Login/Signup to comment