Is this a good usage of Decorator pattern? I'm trying to use Interfaces instead of Abstract classes.
(Component) Interface
public interface IBake
{
string Name { get; }
double Price { get; }
}
(Concrete Component)
public class BakeBase : IBake
{
private s...
I'm fairly new to C++ programming. To help I've been writing my own data structures for practice. I'd liked this to be judged as if it was written by a professional, and receive honest feedback. I already have a few concerns.
Am I managing memory correctly? I don't believe I have any leaks. A l...
I have this number return from ajax request 015-0011-00001 i want to increment the last part of the number (00001) on load of document. What i did is get the last number and increment it then combine again the numbers. Is there a cleaner way to increment this number without slicing the number int...
Can below extension method be improved?
public static string GetAvatar(this System.Security.Principal.IIdentity user)
{
var service = SmObjectFactory.Container.GetInstance<IApplicationUserManager>();
return service.FindByIdAsync(int.Parse(user.GetUserId())).Result.Avatar...
This code is in a really early state in the lifecycle. I'm still in the process of implementing some core features, but nevertheless the code up to here works and accomplishes its task.
I have no idea as to how well, though.
This code is intended to give a dead-simple way of creating growable a...
Currently I am assigned to a project which has a standard view-flow, yet this flow is determined by whether settings are set to either true or false.
So, for example, let the standard flow be View1 > View2 > View3. When the customer has no need for View2, the application should be adjusting thi...
I got rejected for a junior Ruby job entry where I had to solve a 2d matrix as a maze with walls. This is the main class:
solver.rb
##
# 2d matrix maze solver
#
# The story:
# The program parses the maze as a string when the object is initialized and
# saves it in an array. The nodes are saved ...
x.field is a boolean value; boolean values are primitives and are read-only. When you attempt to assign a value to x.field.netType, you are attempting to modify the value of x.field. Pointy's answer mostly explains this.
When in 'normal' JavaScript mode, this results in the value simply being un...
Scenario:
I need to insert a record in a database and use the id resulting from that operation for every other operation needed.
So I've created a class that contains all details of the object that needs to be persisted in the database and added an Id field to store the record id returned by th...
I am new to Qt and am trying to understand object destruction and where I need to explicitly destroy objects using delete. The following is the code.
class MainDialog: public QWidget {
Q_OBJECT
public: MainDialog(QWidget *parent=0);
private:
QPushButton *m_newClick;
...
Given
You are given a square matrix of size N×N. Calculate the absolute difference of the sums across the two main diagonals.
Input Format
The first line contains a single integer N. The next N lines contain N integers (each) describing the matrix.
Constraints
1≤N≤100
−100≤...
I have been trying to code a shoot 'em up game and so far i noticed a few problems when i run the code.
Problems i see include a few light red circles and bullets appearing at the start when it should not.
After that, two light red circles should appear and move down like a sine wave smoothly.H...
I feel pretty stupid about this question, so asking your advice about this.
Let's say you have suppliers and customers and orders from one to other.
For example,
s1 ==apples,tomatoes=> c1
==apples => c2
s2 ==potatoes ==> c2
s2 ==oranges, potatoes => c3
etc.
There are two version to implement...
Expected Output:- b
Problem Encountered:- Segmentation Fault
#include<stdio.h>
void main()
{
char *k = "ayqm";
printf("%c", ++*(k++));
}
Your algorithm goes through each cell, and for each cell, you compare the values against each possible value (200,000 of them). If you call the cells the input size (\$n\$) and the distinct values (\$m\$), then your complexity is \$O(nm)\$.
You cannot avoid the scan of each cell in the matrix (t...
I like that you use an immutable map. However I don't like the name map: you should give it a more descriptive name and it should be capitalized since it is a constant. You should also declare the type of map as LinkedHashMap: it is important here since you do use the ordering property. You ca...
